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
CWE190_Integer_Overflow__short_rand_multiply_11-good
goodB2G2
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 0, i32* %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 = mul i32 %7, 32768 %9 = call i32 @rand() %10 = xor i32 %9, %8 %11 = sext i1 %5 to i32 %storemerge.in = xor i32 %10, %11 %sext = mul i32 %storemerge.in, 65536 %12 = ashr exact i32 %sext, 16 store i32 %12, i32* %sv_0.0.reg2mem br label LBL_2 LBL_2: %13 = call i64 @FUNC() %14 = trunc i64 %13 to i32 %15 = icmp eq i32 %14, 0 store i64 %13, i64* %rax.0.reg2mem br i1 %15, label LBL_7, label LBL_3 LBL_3: %sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem %16 = trunc i32 %sv_0.0.reload to i16 %17 = icmp slt i16 %16, 1 store i64 %13, i64* %rax.0.reg2mem br i1 %17, label LBL_7, label LBL_4 LBL_4: %18 = icmp sgt i16 %16, ptrtoint (i1* @gv_0 to i16) br i1 %18, label LBL_6, label LBL_5 LBL_5: %sext2 = mul i32 %sv_0.0.reload, 131072 %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_7 LBL_6: %22 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_1 to i64)) store i64 %22, 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 %sv_0.0.reload, { 1, 0 } uselistorder i64* %rax.0.reg2mem, { 0, 2, 1, 3, 4 } }
0
juliet-test-suite-c
CWE124_Buffer_Underwrite__CWE839_fscanf_09-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.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, -20 %3 = inttoptr i64 %2 to i32* store i32 1, i32* %3, align 4 %4 = add i64 %0, -48 store i64 0, i64* %indvars.iv.reg2mem br label LBL_1 LBL_1: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %5 = mul i64 %indvars.iv.reload, 4 %6 = add i64 %4, %5 %7 = inttoptr i64 %6 to i32* %8 = load i32, i32* %7, align 4 %9 = zext i32 %8 to i64 %10 = call i64 @FUNC(i64 %9) %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_2, label LBL_1 LBL_2: %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %1, %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 uselistorder i64 %0, { 1, 0 } uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_int_declare_loop_06-good
goodG2B2
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 = ptrtoint i64* %sv_2 to i64 %1 = call i64 @FUNC(i64 40) %2 = bitcast i64* %sv_0 to i8* call void @FUNC(i8* nonnull %2, i64 0, i64 50) %3 = ptrtoint i64* %sv_1 to i64 %4 = add i64 %0, -416 store i64 0, i64* %storemerge2.reg2mem br label LBL_1 LBL_1: %storemerge2.reload = load i64, i64* %storemerge2.reg2mem %5 = mul i64 %storemerge2.reload, 4 %6 = add i64 %5, %3 %7 = add i64 %4, %5 %8 = inttoptr i64 %7 to i32* %9 = load i32, i32* %8, align 4 %10 = inttoptr i64 %6 to i32* store i32 %9, i32* %10, align 4 %11 = add nuw nsw i64 %storemerge2.reload, 1 %exitcond = icmp eq i64 %11, 100 store i64 %11, i64* %storemerge2.reg2mem br i1 %exitcond, label LBL_2, label LBL_1 LBL_2: %12 = bitcast i64* %sv_1 to i32* %13 = load i32, i32* %12, align 8 %14 = zext i32 %13 to i64 %15 = call i64 @FUNC(i64 %14) %16 = call i64 @FUNC(i64 40) %17 = icmp eq i64 %1, %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* %sv_1, { 1, 0 } uselistorder i64* %storemerge2.reg2mem, { 1, 0, 2 } uselistorder i64 (i64)* @printIntLine, { 1, 0 } }
0
juliet-test-suite-c
CWE126_Buffer_Overread__char_declare_memmove_11-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i64 %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %1 = load i64, i64* %0 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %2 = call i64 @FUNC(i64 40) %3 = call i64* @memset(i64* nonnull %sv_2, i32 65, i32 49) %4 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99) %5 = call i64 @FUNC() %6 = trunc i64 %5 to i32 %7 = icmp eq i32 %6, 0 %8 = ptrtoint i64* %sv_1 to i64 %spec.select = select i1 %7, i64 %1, i64 %8 %9 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %10 = bitcast i64* %sv_0 to i8* %11 = call i32 @strlen(i8* nonnull %10) %12 = inttoptr i64 %spec.select to i64* %13 = call i64* @memmove(i64* nonnull %sv_0, i64* %12, i32 %11) %14 = ptrtoint i64* %sv_0 to i64 %15 = call i64 @FUNC(i64 %14) %16 = call i64 @FUNC(i64 40) %17 = icmp eq i64 %2, %16 store i64 0, i64* %rax.0.reg2mem br i1 %17, 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* %sv_1, { 1, 0 } uselistorder i64* %sv_0, { 3, 0, 1, 2 } uselistorder i64* (i64*, i64*, i32)* @memmove, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 5, 4, 3, 2, 1, 0, 6 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_loop_05-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge2.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, 0 br i1 %5, label LBL_2.LBL_5_crit_edge, label LBL_4 LBL_3: %.pre = ptrtoint i64* %1 to i64 store i64 %.pre, i64* %.pre-phi.reg2mem br label LBL_5 LBL_4: %6 = call i64* @memset(i64* %1, i32 65, i32 49) %7 = ptrtoint i64* %1 to i64 %8 = add i64 %7, 49 %9 = inttoptr i64 %8 to i8* store i8 0, i8* %9, align 1 store i64 %7, i64* %.pre-phi.reg2mem br label LBL_5 LBL_5: %10 = bitcast i64* %1 to i8* %.pre-phi.reload = load i64, i64* %.pre-phi.reg2mem store i64 0, i64* %sv_0, align 8 %11 = call i32 @strlen(i8* %10) %12 = icmp eq i32 %11, 0 br i1 %12, label LBL_8, label LBL_6 LBL_6: %13 = sext i32 %11 to i64 %14 = ptrtoint i64* %sv_0 to i64 store i64 0, i64* %storemerge2.reg2mem br label LBL_7 LBL_7: %storemerge2.reload = load i64, i64* %storemerge2.reg2mem %15 = add i64 %storemerge2.reload, %.pre-phi.reload %16 = inttoptr i64 %15 to i8* %17 = load i8, i8* %16, align 1 %18 = add i64 %storemerge2.reload, %14 %19 = inttoptr i64 %18 to i8* store i8 %17, i8* %19, align 1 %20 = add nuw i64 %storemerge2.reload, 1 %21 = icmp ult i64 %20, %13 store i64 %20, i64* %storemerge2.reg2mem br i1 %21, label LBL_7, label LBL_8 LBL_8: %22 = call i64 @FUNC(i64 %.pre-phi.reload) call void @free(i64* %1) %23 = call i64 @FUNC(i64 40) %24 = icmp eq i64 %0, %23 store i64 0, i64* %rax.0.reg2mem br i1 %24, 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 %storemerge2.reload, { 0, 2, 1 } uselistorder i32 %11, { 1, 0 } uselistorder i64* %1, { 1, 5, 2, 3, 0, 4 } uselistorder i64* %storemerge2.reg2mem, { 1, 0, 2 } uselistorder void (i64*)* @free, { 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 } uselistorder label LBL_7, { 1, 0 } uselistorder label LBL_5, { 1, 0 } }
0
juliet-test-suite-c
CWE369_Divide_by_Zero__float_fgets_12-bad
CWE369_Divide_by_Zero__float_fgets_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i128 %rax.0.reg2mem = alloca i64 %sv_0.0.in.reg2mem = alloca i64 %1 = load i128, i128* %0 %2 = load i128, i128* %0 %sv_1 = alloca i64, align 8 %3 = call i64 @FUNC(i64 40) %4 = call i128 @FUNC(i128 %2, i128 %2) %5 = call i64 @FUNC(i128 %4) %6 = call i64 @FUNC() %7 = trunc i64 %6 to i32 %8 = icmp eq i32 %7, 0 br i1 %8, label LBL_4, label LBL_1 LBL_1: %9 = load %_IO_FILE*, %_IO_FILE** @gv_0, 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) store i64 %18, i64* %sv_0.0.in.reg2mem br label LBL_5 LBL_3: %19 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64)) store i64 %5, i64* %sv_0.0.in.reg2mem br label LBL_5 LBL_4: %20 = call i128 @__asm_movss.1(i32 1073741824) %21 = call i64 @FUNC(i128 %20) store i64 %21, i64* %sv_0.0.in.reg2mem br label LBL_5 LBL_5: %sv_0.0.in.reload = load i64, i64* %sv_0.0.in.reg2mem %sv_0.0 = trunc i64 %sv_0.0.in.reload to i32 %22 = call i64 @FUNC() %23 = trunc i64 %22 to i32 %24 = icmp eq i32 %23, 0 br i1 %24, label LBL_7, label LBL_6 LBL_6: %25 = call i128 @FUNC(i128 %1, i128 %1) %26 = call i128 @FUNC(i32 %sv_0.0) %27 = call i128 @FUNC(i64 4636737291354636288) %28 = call i128 @FUNC(i128 %27, i128 %26) %29 = call i32 @FUNC(i128 %28) %30 = zext i32 %29 to i64 %31 = call i64 @FUNC(i64 %30) br label LBL_8 LBL_7: %32 = call i128 @__asm_movss.1(i32 %sv_0.0) %33 = call i128 @__asm_movss.1(i32 2147483647) %34 = call i128 @FUNC(i128 %32, i128 %33) %35 = call i128 @__asm_cvtss2sd.2(i128 %34) %36 = load i128, i128* @gv_2, align 8 call void @FUNC(i128 %35, i128 %36) %37 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_3 to i64)) br label LBL_8 LBL_8: %38 = call i64 @FUNC(i64 40) %39 = icmp eq i64 %3, %38 store i64 0, i64* %rax.0.reg2mem br i1 %39, 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.0.in.reg2mem, { 0, 3, 2, 1 } uselistorder i128* %0, { 1, 0 } uselistorder i64 ()* @globalReturnsTrueOrFalse, { 1, 0 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__CWE131_memcpy_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 40) %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 0, i64* %sv_0, align 8 %4 = call i64* @memcpy(i64* %1, i64* nonnull %sv_0, i32 40) %5 = bitcast i64* %1 to i32* %6 = load i32, i32* %5, align 4 %7 = zext i32 %6 to i64 %8 = call i64 @FUNC(i64 %7) call void @free(i64* %1) %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %0, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, 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 void (i64*)* @free, { 1, 0, 2 } uselistorder i64 (i64)* @printIntLine, { 1, 0 } uselistorder i64* (i64*, i64*, i32)* @memcpy, { 1, 0, 2 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE506_Embedded_Malicious_Code__file_transfer_listen_socket_07-bad
CWE506_Embedded_Malicious_Code__file_transfer_listen_socket_07_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %rsp.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %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 = ptrtoint i64* %sv_2 to i64 store i64 %0, i64* %rsp.0.reg2mem br label LBL_1 LBL_1: %rsp.0.reload = load i64, i64* %rsp.0.reg2mem %2 = add i64 %rsp.0.reload, -4096 %3 = icmp eq i64 %2, %1 %4 = icmp eq i1 %3, false store i64 %2, i64* %rsp.0.reg2mem br i1 %4, label LBL_1, label LBL_2 LBL_2: %5 = call i64 @FUNC(i64 40) %6 = load i32, i32* @gv_0, align 4 %7 = icmp eq i32 %6, 5 %8 = icmp eq i1 %7, false br i1 %8, label LBL_13, label LBL_3 LBL_3: %9 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @gv_1, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_2, i64 0, i64 0)) %10 = icmp eq %_IO_FILE* %9, null br i1 %10, label LBL_7, label LBL_4 LBL_4: %11 = bitcast i64* %sv_1 to i8* %12 = call i8* @fgets(i8* nonnull %11, i32 65535, %_IO_FILE* nonnull %9) %13 = icmp eq i8* %12, null %14 = icmp eq i1 %13, false br i1 %14, label LBL_6, label LBL_5 LBL_5: %15 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_3 to i64)) store i64 0, i64* %sv_1, align 8 br label LBL_6 LBL_6: %16 = call i32 @fclose(%_IO_FILE* nonnull %9) br label LBL_7 LBL_7: %17 = call i32 @socket(i32 2, i32 1, i32 6) %18 = icmp eq i32 %17, -1 br i1 %18, label LBL_13, label LBL_8 LBL_8: %19 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16) store i64 2, i64* %sv_0, align 8 %20 = call i16 @htons(i16 27015) %21 = bitcast i64* %sv_0 to %sockaddr* %22 = call i32 @bind(i32 %17, %sockaddr* nonnull %21, i32 16) %23 = icmp eq i32 %22, -1 br i1 %23, label LBL_11, label LBL_9 LBL_9: %24 = call i32 @listen(i32 %17, i32 5) %25 = icmp eq i32 %24, -1 br i1 %25, label LBL_11, label LBL_10 LBL_10: %26 = call i32 @accept(i32 %17, %sockaddr* null, i32* null) %27 = icmp eq i32 %26, -1 br i1 %27, label LBL_11, label LBL_12 LBL_11: %28 = call i32 @close(i32 %17) br label LBL_13 LBL_12: %29 = bitcast i64* %sv_1 to i8* %30 = call i32 @strlen(i8* nonnull %29) %31 = call i32 @send(i32 %26, i64* nonnull %sv_1, i32 %30, i32 0) %32 = call i32 @strlen(i8* nonnull %29) %33 = call i32 @close(i32 %17) %34 = call i32 @close(i32 %26) br label LBL_13 LBL_13: %35 = call i64 @FUNC(i64 40) %36 = icmp eq i64 %5, %35 store i64 0, i64* %rax.0.reg2mem br i1 %36, label LBL_15, label LBL_14 LBL_14: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_15 LBL_15: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %17, { 4, 0, 1, 2, 3, 5 } uselistorder i64* %sv_1, { 0, 1, 3, 2 } uselistorder i64* %sv_0, { 0, 2, 1 } uselistorder i64* %rsp.0.reg2mem, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder i32 (i32)* @close, { 2, 1, 0, 3 } uselistorder i32 5, { 1, 0, 2 } uselistorder label LBL_13, { 2, 1, 0, 3 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__dest_char_alloca_cpy_04-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 = bitcast i64* %sv_0 to i8* %7 = call i8* @strcpy(i8* %4, i8* nonnull %6) %8 = call i64 @FUNC(i64 %3) %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %1, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, 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 }
0
juliet-test-suite-c
CWE197_Numeric_Truncation_Error__short_connect_socket_32-bad
CWE197_Numeric_Truncation_Error__short_connect_socket_32_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.05.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 65535, i32* %sv_0.05.reg2mem br i1 %2, label LBL_5, 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 i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0)) %5 = call i16 @htons(i16 27015) %6 = bitcast i64* %sv_2 to %sockaddr* %7 = call i32 @connect(i32 %1, %sockaddr* nonnull %6, i32 16) %8 = icmp eq i32 %7, -1 store i32 65535, i32* %sv_0.0.ph.reg2mem br i1 %8, label LBL_4, label LBL_2 LBL_2: %9 = call i32 @recv(i32 %1, i64* nonnull %sv_1, i32 7, i32 0) %10 = add i32 %9, 1 %11 = icmp ult i32 %10, 2 store i32 65535, i32* %sv_0.0.ph.reg2mem br i1 %11, label LBL_4, label LBL_3 LBL_3: %12 = ptrtoint i64* %sv_3 to i64 %13 = sext i32 %9 to i64 %14 = add i64 %12, -16 %15 = add i64 %14, %13 %16 = inttoptr i64 %15 to i8* store i8 0, i8* %16, align 1 %17 = bitcast i64* %sv_1 to i8* %18 = call i32 @atoi(i8* nonnull %17) store i32 %18, 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 %19 = call i32 @close(i32 %1) store i32 %sv_0.0.ph.reload, i32* %sv_0.05.reg2mem br label LBL_5 LBL_5: %sv_0.05.reload = load i32, i32* %sv_0.05.reg2mem %sext = mul i32 %sv_0.05.reload, 16777216 %20 = ashr exact i32 %sext, 24 %21 = zext i32 %20 to i64 %22 = call i64 @FUNC(i64 %21) %23 = call i64 @FUNC(i64 40) %24 = icmp eq i64 %0, %23 store i64 0, i64* %rax.0.reg2mem br i1 %24, 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 %9, { 1, 0 } uselistorder i32 %1, { 2, 0, 1, 3 } uselistorder i64* %sv_2, { 0, 2, 1 } uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 3, 2, 1 } uselistorder i32* %sv_0.05.reg2mem, { 0, 2, 1 } uselistorder i32 65535, { 2, 1, 0 } uselistorder label LBL_5, { 1, 0 } uselistorder label LBL_4, { 1, 2, 0 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__src_char_declare_cpy_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 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 49) %3 = add i64 %1, 49 %4 = inttoptr i64 %3 to i8* store i8 0, i8* %4, align 1 store i64 0, i64* %sv_0, align 8 %5 = bitcast i64* %sv_0 to i8* %6 = bitcast i64* %sv_1 to i8* %7 = call i8* @strcpy(i8* nonnull %5, i8* nonnull %6) %8 = call i64 @FUNC(i64 %1) %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %0, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, 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*, i32, i32)* @memset, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE135_08-good
goodG2B2
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: store i8* getelementptr inbounds ([43 x i8], [43 x i8]* @gv_0, i64 0, i64 0), i8** %sv_0, align 8 br label LBL_2 LBL_2: %4 = call i64 @FUNC() %5 = trunc i64 %4 to i32 %6 = icmp eq i32 %5, 0 br i1 %6, label LBL_4, label LBL_3 LBL_3: %7 = ptrtoint i8** %sv_0 to i64 %8 = load i8*, i8** %sv_0, align 8 %9 = call i32 @strlen(i8* %8) %10 = sext i32 %9 to i64 %11 = add nsw i64 %10, 24 %12 = udiv i64 %11, 16 %13 = mul i64 %12, 16 %14 = and i64 %13, -4096 %15 = and i64 %13, 4080 %16 = add i64 %7, 15 %17 = sub i64 %16, %15 %18 = sub i64 %17, %14 %19 = and i64 %18, -16 %20 = load i8*, i8** %sv_0, align 8 %21 = inttoptr i64 %19 to i8* %22 = call i8* @strcpy(i8* %21, i8* %20) %23 = call i64 @FUNC(i64 %19) br label LBL_4 LBL_4: %24 = call i64 @FUNC(i64 40) %25 = icmp eq i64 %0, %24 store i64 0, i64* %rax.0.reg2mem br i1 %25, 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 %19, { 1, 0 } uselistorder i64 %13, { 1, 0 } uselistorder i8** %sv_0, { 4, 3, 0, 2, 1 } uselistorder i64 16, { 0, 4, 1, 5, 2, 6, 3, 7 } uselistorder i64 ()* @staticReturnsTrue, { 5, 4, 3, 2, 1, 0 } }
0
juliet-test-suite-c
CWE369_Divide_by_Zero__int_fscanf_modulo_17-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 = 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 = urem 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 label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE400_Resource_Exhaustion__listen_socket_for_loop_04-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge11.reg2mem = alloca i64 %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 br i1 %2, label LBL_10, 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 -1, 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) br label LBL_10 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) %sv_0.0.off = add i32 %sv_0.0.ph.reload, -1 %25 = icmp ugt i32 %sv_0.0.off, 19 br i1 %25, label LBL_10, label LBL_8 LBL_8: %26 = sext i32 %sv_0.0.ph.reload to i64 store i64 0, i64* %storemerge11.reg2mem br label LBL_9 LBL_9: %storemerge11.reload = load i64, i64* %storemerge11.reg2mem %27 = call i64 @FUNC(i64 ptrtoint ([6 x i8]* @gv_0 to i64)) %28 = add nuw i64 %storemerge11.reload, 1 %29 = icmp ult i64 %28, %26 store i64 %28, i64* %storemerge11.reg2mem br i1 %29, label LBL_9, 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 i64* %storemerge11.reg2mem, { 1, 0, 2 } uselistorder label LBL_10, { 0, 3, 2, 1 } uselistorder label LBL_9, { 1, 0 } uselistorder label LBL_7, { 1, 0 } }
0
juliet-test-suite-c
CWE665_Improper_Initialization__char_cat_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 i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = bitcast i64* %sv_1 to i8* %2 = load i32, i32* @gv_0, align 4 %3 = icmp eq i32 %2, 0 br i1 %3, label LBL_2, label LBL_1 LBL_1: store i8 0, i8* %1, align 8 br label LBL_2 LBL_2: %4 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %5 = bitcast i64* %sv_0 to i8* %6 = call i8* @strcat(i8* nonnull %1, i8* nonnull %5) %7 = ptrtoint i64* %sv_1 to i64 %8 = call i64 @FUNC(i64 %7) %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %0, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, 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_struct_16-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) store i64 0, i64* %sv_0, align 8 %1 = call i64 @FUNC(i64* nonnull %sv_0) store i64 1, i64* %sv_0, align 8 %2 = call i64 @FUNC(i64* nonnull %sv_0) %3 = call i64 @FUNC(i64 40) %4 = icmp eq i64 %0, %3 store i64 0, i64* %rax.0.reg2mem br i1 %4, 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* %sv_0, { 0, 2, 1, 3 } uselistorder i64 (i64*)* @printStructLine, { 2, 1, 0 } }
0
juliet-test-suite-c
CWE127_Buffer_Underread__char_alloca_memmove_04-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, -97 %3 = and i64 %2, -16 %4 = inttoptr i64 %3 to i64* %5 = call i64* @memset(i64* %4, i32 65, i32 99) %6 = add i64 %3, 99 %7 = inttoptr i64 %6 to i8* store i8 0, i8* %7, align 1 store i64 %3, i64* %sv_1, align 8 %8 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %9 = load i64, i64* %sv_1, align 8 %10 = inttoptr i64 %9 to i64* %11 = call i64* @memmove(i64* nonnull %sv_0, i64* %10, i32 100) %12 = ptrtoint i64* %sv_0 to i64 %13 = call i64 @FUNC(i64 %12) %14 = call i64 @FUNC(i64 40) %15 = icmp eq i64 %1, %14 store i64 0, i64* %rax.0.reg2mem br i1 %15, 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, { 0, 2, 1 } uselistorder i64* %sv_0, { 2, 0, 1 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_memmove_13-bad
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_memmove_13_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* 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 10) %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 4702111234474983745, i64* %sv_1, align 8 %8 = bitcast i64* %sv_1 to i8* %9 = call i32 @strlen(i8* nonnull %8) %10 = add i32 %9, 1 %11 = inttoptr i64 %sv_0.0.reload to i64* %12 = call i64* @memmove(i64* %11, i64* nonnull %sv_1, i32 %10) %13 = call i64 @FUNC(i64 %sv_0.0.reload) call void @free(i64* %11) %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 }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__dest_char_declare_cat_12-good
goodG2B
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 = call i64 @FUNC() %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 = bitcast i64* %sv_0 to i8* %5 = call i8* @strcat(i8* nonnull %2, i8* nonnull %4) %6 = ptrtoint i64* %sv_1 to i64 %7 = call i64 @FUNC(i64 %6) %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 }
0
juliet-test-suite-c
CWE773_Missing_Reference_to_Active_File_Descriptor_or_Handle__open_12-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.in.reg2mem = alloca i32 %0 = call i32 (i8*, i32, ...) @open(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @gv_0, i64 0, i64 0), i32 66) %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 %4 = icmp eq i32 %0, -1 br i1 %3, label LBL_5, label LBL_1 LBL_1: br i1 %4, label LBL_3, label LBL_2 LBL_2: %5 = call i32 @close(i32 %0) br label LBL_3 LBL_3: %6 = call i32 (i8*, i32, ...) @open(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @gv_1, i64 0, i64 0), i32 66) %7 = icmp eq i32 %6, -1 store i32 -1, i32* %rax.0.in.reg2mem br i1 %7, label LBL_9, label LBL_4 LBL_4: %8 = call i32 @close(i32 %6) store i32 %8, i32* %rax.0.in.reg2mem br label LBL_9 LBL_5: br i1 %4, label LBL_7, label LBL_6 LBL_6: %9 = call i32 @close(i32 %0) br label LBL_7 LBL_7: %10 = call i32 (i8*, i32, ...) @open(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @gv_1, i64 0, i64 0), i32 66) %11 = icmp eq i32 %10, -1 store i32 -1, i32* %rax.0.in.reg2mem br i1 %11, label LBL_9, label LBL_8 LBL_8: %12 = call i32 @close(i32 %10) store i32 %12, i32* %rax.0.in.reg2mem br label LBL_9 LBL_9: %rax.0.in.reload = load i32, i32* %rax.0.in.reg2mem %rax.0 = sext i32 %rax.0.in.reload to i64 ret i64 %rax.0 uselistorder i1 %4, { 1, 0 } uselistorder i32 %0, { 1, 2, 0 } uselistorder i32* %rax.0.in.reg2mem, { 0, 3, 4, 1, 2 } uselistorder i32 (i32)* @close, { 3, 2, 1, 0, 4 } uselistorder i32 -1, { 1, 2, 0, 4, 3 } uselistorder i32 (i8*, i32, ...)* @open, { 2, 1, 0, 3 } }
0
juliet-test-suite-c
CWE400_Resource_Exhaustion__fscanf_for_loop_08-bad
CWE400_Resource_Exhaustion__fscanf_for_loop_08_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.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 = 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 ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* 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 %9 = load i32, i32* %sv_0, align 4 %10 = icmp eq i32 %9, 0 %or.cond = or i1 %8, %10 store i64 0, i64* %storemerge1.reg2mem br i1 %or.cond, label LBL_4, label LBL_3 LBL_3: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %11 = call i64 @FUNC(i64 ptrtoint ([6 x i8]* @gv_2 to i64)) %12 = add nuw i64 %storemerge1.reload, 1 %13 = load i32, i32* %sv_0, align 4 %14 = sext i32 %13 to i64 %15 = icmp ult i64 %12, %14 store i64 %12, i64* %storemerge1.reg2mem br i1 %15, label LBL_3, label LBL_4 LBL_4: %16 = call i64 @FUNC(i64 40) %17 = icmp eq i64 %0, %16 store i64 0, i64* %rax.0.reg2mem br i1 %17, 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 i32* %sv_0, { 2, 0, 1, 3 } uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 } uselistorder i64 ()* @staticReturnsTrue, { 1, 0 } uselistorder label LBL_3, { 1, 0 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_alloca_memmove_16-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 = ptrtoint i8** %sv_1 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 49) %7 = add i64 %3, 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* %5, i32 %9) %11 = call i64 @FUNC(i64 %3) %12 = call i64 @FUNC(i64 40) %13 = icmp eq i64 %1, %12 store i64 0, i64* %rax.0.reg2mem br i1 %13, 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, { 2, 1, 0, 3 } uselistorder i8** %sv_1, { 1, 0 } }
0
juliet-test-suite-c
CWE789_Uncontrolled_Mem_Alloc__malloc_char_fgets_02-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = call i64* @malloc(i32 20) %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 = bitcast i64* %0 to i32* store i32 1819043176, i32* %4, align 4 %5 = add i64 %3, 4 %6 = inttoptr i64 %5 to i16* store i16 111, i16* %6, align 2 %7 = call i64 @FUNC(i64 %3) call void @free(i64* %0) ret i64 ptrtoint (i32* @1 to i64) uselistorder i64* %0, { 0, 1, 3, 2 } uselistorder void (i64*)* @free, { 3, 2, 1, 0, 4 } uselistorder void (i32)* @exit, { 3, 2, 1, 0, 4 } uselistorder i64* (i32)* @malloc, { 3, 2, 1, 0, 4 } }
0
juliet-test-suite-c
CWE124_Buffer_Underwrite__CWE839_rand_13-bad
CWE124_Buffer_Underwrite__CWE839_rand_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %sv_0.02.reg2mem = alloca i32 %sv_1 = 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 store i32 -1, i32* %sv_0.02.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = call i32 @rand() %5 = urem i32 %4, 2 %6 = icmp eq i32 %5, 0 %7 = call i32 @rand() %8 = mul i32 %7, 1073741824 %9 = call i32 @rand() %10 = mul i32 %9, 32768 %11 = xor i32 %10, %8 %12 = call i32 @rand() %13 = xor i32 %11, %12 %14 = sext i1 %6 to i32 %storemerge1.in = xor i32 %13, %14 %15 = icmp sgt i32 %storemerge1.in, 9 store i32 %storemerge1.in, i32* %sv_0.02.reg2mem br i1 %15, label LBL_4, label LBL_2 LBL_2: %16 = ptrtoint i64* %sv_1 to i64 %sv_0.02.reload = load i32, i32* %sv_0.02.reg2mem %17 = sext i32 %sv_0.02.reload to i64 %18 = mul i64 %17, 4 %19 = add i64 %16, -64 %20 = add i64 %18, %19 %21 = inttoptr i64 %20 to i32* store i32 1, i32* %21, align 4 store i64 0, i64* %indvars.iv.reg2mem br label LBL_3 LBL_3: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %22 = mul i64 %indvars.iv.reload, 4 %23 = add i64 %22, %19 %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 br i1 %exitcond, label LBL_5, label LBL_3 LBL_4: %28 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_0 to i64)) br label LBL_5 LBL_5: %29 = call i64 @FUNC(i64 40) %30 = icmp eq i64 %0, %29 store i64 0, i64* %rax.0.reg2mem br i1 %30, 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* %sv_0.02.reg2mem, { 0, 2, 1 } uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 } uselistorder label LBL_5, { 1, 0 } uselistorder label LBL_2, { 1, 0 } }
1
juliet-test-suite-c
CWE457_Use_of_Uninitialized_Variable__int_array_alloca_no_init_11-good
goodG2B2
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: %indvars.iv4.reload = load i64, i64* %indvars.iv4.reg2mem %7 = mul i64 %indvars.iv4.reload, 4 %8 = add i64 %7, %3 %9 = inttoptr i64 %8 to i32* %10 = trunc i64 %indvars.iv4.reload to i32 store i32 %10, i32* %9, 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_2, label LBL_1 LBL_2: %11 = call i64 @FUNC() %12 = trunc i64 %11 to i32 %13 = icmp eq i32 %12, 0 store i64 0, i64* %indvars.iv.reg2mem br i1 %13, label LBL_4, label LBL_3 LBL_3: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %14 = mul i64 %indvars.iv.reload, 4 %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) %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_4, label LBL_3 LBL_4: %20 = call i64 @FUNC(i64 40) %21 = icmp eq i64 %1, %20 store i64 0, i64* %rax.0.reg2mem br i1 %21, 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* %indvars.iv4.reg2mem, { 2, 0, 1 } uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 } uselistorder i64 (i64)* @printIntLine, { 3, 2, 1, 0 } uselistorder i64 10, { 1, 0, 3, 2, 5, 4, 7, 6 } uselistorder i64 ()* @globalReturnsTrue, { 5, 4, 3, 2, 1, 0 } uselistorder label LBL_3, { 1, 0 } uselistorder label LBL_1, { 1, 0 } }
0
juliet-test-suite-c
CWE369_Divide_by_Zero__int_listen_socket_modulo_16-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0479.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 -1, i32* %sv_0.0479.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 -1, 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 -1, i32* %sv_0.0479.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, 0 store i32 %sv_0.0.ph.reload, i32* %sv_0.0479.reg2mem br i1 %25, label LBL_9, label LBL_8 LBL_8: %sv_0.0479.reload = load i32, i32* %sv_0.0479.reg2mem %26 = urem i32 100, %sv_0.0479.reload %27 = zext i32 %26 to i64 %28 = call i64 @FUNC(i64 %27) br label LBL_10 LBL_9: %29 = call i64 @FUNC(i64 ptrtoint ([38 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.0479.reg2mem, { 0, 3, 2, 1 } uselistorder i32 (i32)* @close, { 2, 1, 0, 3 } uselistorder i32 -1, { 1, 2, 3, 4, 5, 0, 6 } uselistorder label LBL_8, { 2, 1, 0 } uselistorder label LBL_7, { 1, 0 } }
0
juliet-test-suite-c
CWE404_Improper_Resource_Shutdown__open_fclose_02-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.in.reg2mem = alloca i64 %0 = call i32 (i8*, i32, ...) @open(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @gv_0, i64 0, i64 0), i32 66) %1 = icmp eq i32 %0, -1 store i64 -1, i64* %rax.0.in.reg2mem br i1 %1, label LBL_2, label LBL_1 LBL_1: %2 = call i32 @close(i32 %0) %phitmp = sext i32 %2 to i64 store i64 %phitmp, i64* %rax.0.in.reg2mem br label LBL_2 LBL_2: %rax.0.in.reload = load i64, i64* %rax.0.in.reg2mem ret i64 %rax.0.in.reload }
0
juliet-test-suite-c
CWE191_Integer_Underflow__int_listen_socket_multiply_14-bad
CWE191_Integer_Underflow__int_listen_socket_multiply_14_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %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* inttoptr (i64 16404 to i32*), align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false br i1 %3, label LBL_10, 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_10, label LBL_2 LBL_2: %6 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16) store i64 2, i64* %sv_2, align 8 %7 = call i16 @htons(i16 27015) %8 = bitcast i64* %sv_2 to %sockaddr* %9 = call i32 @bind(i32 %4, %sockaddr* nonnull %8, i32 16) %10 = icmp eq i32 %9, -1 br i1 %10, label LBL_7, label LBL_3 LBL_3: %11 = call i32 @listen(i32 %4, i32 5) %12 = icmp eq i32 %11, -1 br i1 %12, label LBL_7, label LBL_4 LBL_4: %13 = call i32 @accept(i32 %4, %sockaddr* null, i32* null) %14 = icmp eq i32 %13, -1 br i1 %14, label LBL_7, label LBL_5 LBL_5: %15 = call i32 @recv(i32 %13, i64* nonnull %sv_1, i32 13, i32 0) %16 = add i32 %15, 1 %17 = icmp ult i32 %16, 2 store i32 0, i32* %sv_0.0.ph.reg2mem br i1 %17, label LBL_8, label LBL_6 LBL_6: %18 = ptrtoint i64* %sv_3 to i64 %19 = sext i32 %15 to i64 %20 = add i64 %18, -22 %21 = add i64 %20, %19 %22 = inttoptr i64 %21 to i8* store i8 0, i8* %22, align 1 %23 = bitcast i64* %sv_1 to i8* %24 = call i32 @atoi(i8* nonnull %23) store i32 %24, i32* %sv_0.0.ph.reg2mem br label LBL_8 LBL_7: %25 = call i32 @close(i32 %4) br label LBL_10 LBL_8: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %26 = call i32 @close(i32 %4) %27 = call i32 @close(i32 %13) %28 = load i32, i32* @gv_0, align 4 %29 = icmp eq i32 %28, 5 %30 = icmp slt i32 %sv_0.0.ph.reload, 0 %31 = icmp eq i1 %30, %29 br i1 %31, label LBL_9, label LBL_10 LBL_9: %32 = mul i32 %sv_0.0.ph.reload, 2 %33 = zext i32 %32 to i64 %34 = call i64 @FUNC(i64 %33) br label LBL_10 LBL_10: %35 = call i64 @FUNC(i64 40) %36 = icmp eq i64 %0, %35 store i64 0, i64* %rax.0.reg2mem br i1 %36, 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 %sv_0.0.ph.reload, { 1, 0 } uselistorder i32 %15, { 1, 0 } uselistorder i32 %4, { 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 (i32)* @close, { 2, 1, 0, 3 } uselistorder i32 5, { 0, 2, 1, 3 } uselistorder label LBL_10, { 4, 0, 2, 1, 3 } uselistorder label LBL_8, { 1, 0 } }
1
juliet-test-suite-c
CWE401_Memory_Leak__int64_t_malloc_11-bad
CWE401_Memory_Leak__int64_t_malloc_11_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 br i1 %2, label LBL_4, label LBL_1 LBL_1: %3 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32)) %4 = icmp eq i64* %3, null %5 = icmp eq i1 %4, false br i1 %5, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: store i64 5, i64* %3, align 8 %6 = call i64 @FUNC(i64 5) br label LBL_4 LBL_4: %7 = call i64 @FUNC() ret i64 %7 uselistorder i64 ()* @globalReturnsTrue, { 1, 0 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_struct_memmove_08-good
goodG2B2
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 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i64 0, i64* %sv_0.0.reg2mem br i1 %3, label LBL_3, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32)) %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 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i64 (i64)* @printStructLine, { 1, 0 } uselistorder i32 ptrtoint (i32* @gv_0 to i32), { 0, 1, 3, 2 } }
0
juliet-test-suite-c
CWE415_Double_Free__malloc_free_int_05-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_5, label LBL_1 LBL_1: %2 = call i64* @malloc(i32 400) %3 = icmp eq i64* %2, null %4 = icmp eq i1 %3, false br i1 %4, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %.pr = load i32, i32* @gv_0, align 4 %5 = icmp eq i32 %.pr, 0 store i64 0, i64* %rax.0.reg2mem br i1 %5, label LBL_5, label LBL_4 LBL_4: call void @free(i64* %2) 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* %rax.0.reg2mem, { 0, 2, 3, 1 } uselistorder void (i64*)* @free, { 3, 2, 1, 0, 4 } uselistorder void (i32)* @exit, { 3, 2, 1, 0, 4 } uselistorder i64* (i32)* @malloc, { 3, 2, 1, 0, 4 } uselistorder i32* @gv_0, { 0, 4, 3, 2, 1 } uselistorder label LBL_5, { 1, 2, 0 } }
0
juliet-test-suite-c
CWE563_Unused_Variable__unused_init_variable_struct_07-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 = load i32, i32* @gv_0, 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_1 to i64)) br label LBL_3 LBL_2: %4 = call i64 @FUNC(i64* nonnull %sv_0) br label LBL_3 LBL_3: %5 = call i64 @FUNC(i64 40) %6 = icmp eq i64 %0, %5 store i64 0, i64* %rax.0.reg2mem br i1 %6, 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
CWE369_Divide_by_Zero__int_connect_socket_modulo_17-bad
CWE369_Divide_by_Zero__int_connect_socket_modulo_17_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.04.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 -1, i32* %sv_0.04.reg2mem br i1 %2, label LBL_5, label LBL_1 LBL_1: %3 = bitcast i64* %sv_2 to %sockaddr* %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 = call i32 @connect(i32 %1, %sockaddr* nonnull %3, i32 16) %8 = icmp eq i32 %7, -1 store i32 -1, i32* %sv_0.0.ph.reg2mem br i1 %8, label LBL_4, label LBL_2 LBL_2: %9 = call i32 @recv(i32 %1, i64* nonnull %sv_1, i32 13, i32 0) %10 = add i32 %9, 1 %11 = icmp ult i32 %10, 2 store i32 -1, i32* %sv_0.0.ph.reg2mem br i1 %11, label LBL_4, label LBL_3 LBL_3: %12 = ptrtoint i64* %sv_3 to i64 %13 = add i64 %12, -22 %14 = bitcast i64* %sv_1 to i8* %15 = sext i32 %9 to i64 %16 = add i64 %13, %15 %17 = inttoptr i64 %16 to i8* store i8 0, i8* %17, align 1 %18 = call i32 @atoi(i8* nonnull %14) store i32 %18, 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 %19 = call i32 @close(i32 %1) store i32 %sv_0.0.ph.reload, i32* %sv_0.04.reg2mem br label LBL_5 LBL_5: %sv_0.04.reload = load i32, i32* %sv_0.04.reg2mem %20 = urem i32 100, %sv_0.04.reload %21 = zext i32 %20 to i64 %22 = call i64 @FUNC(i64 %21) %23 = call i64 @FUNC(i64 40) %24 = icmp eq i64 %0, %23 store i64 0, i64* %rax.0.reg2mem br i1 %24, 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 %9, { 1, 0 } uselistorder i32 %1, { 2, 0, 1, 3 } uselistorder i64* %sv_2, { 2, 1, 0 } uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 3, 2, 1 } uselistorder i32* %sv_0.04.reg2mem, { 0, 2, 1 } uselistorder i32 -1, { 2, 1, 3, 0, 4 } uselistorder label LBL_5, { 1, 0 } uselistorder label LBL_4, { 1, 2, 0 } }
1
juliet-test-suite-c
CWE680_Integer_Overflow_to_Buffer_Overflow__malloc_fixed_12-bad
CWE680_Integer_Overflow_to_Buffer_Overflow__malloc_fixed_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %storemerge2.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 %. = select i1 %2, i32 20, i32 1073741825 %3 = mul i32 %., 4 %4 = call i64* @malloc(i32 %3) %5 = icmp eq i64* %4, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_1, label LBL_2 LBL_1: %7 = ptrtoint i64* %4 to i64 %8 = zext i32 %. to i64 store i64 0, i64* %storemerge2.reg2mem br label LBL_3 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %storemerge2.reload = load i64, i64* %storemerge2.reg2mem %9 = mul i64 %storemerge2.reload, 4 %10 = add i64 %9, %7 %11 = inttoptr i64 %10 to i32* store i32 0, i32* %11, align 4 %12 = add nuw nsw i64 %storemerge2.reload, 1 %13 = icmp ult i64 %12, %8 store i64 %12, i64* %storemerge2.reg2mem br i1 %13, label LBL_3, label LBL_4 LBL_4: %14 = bitcast i64* %4 to i32* %15 = load i32, i32* %14, align 4 %16 = zext i32 %15 to i64 %17 = call i64 @FUNC(i64 %16) call void @free(i64* %4) ret i64 ptrtoint (i32* @1 to i64) uselistorder i64* %4, { 0, 1, 3, 2 } uselistorder i32 %., { 1, 0 } uselistorder i64* %storemerge2.reg2mem, { 1, 0, 2 } uselistorder label LBL_3, { 1, 0 } }
1
juliet-test-suite-c
CWE369_Divide_by_Zero__int_zero_divide_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 %5 = icmp eq i1 %4, false br i1 %5, label LBL_4, label LBL_3 LBL_3: %6 = call i64 @FUNC(i64 0) store i64 %6, i64* %rax.0.reg2mem br label LBL_5 LBL_4: %7 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_3 to i64)) store i64 %7, 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
CWE191_Integer_Underflow__int_rand_multiply_06-good
goodB2G1
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 = 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 %storemerge.in = xor i32 %9, %10 %11 = icmp slt i32 %storemerge.in, 0 %12 = icmp eq i1 %11, false store i64 5, i64* %rax.0.reg2mem br i1 %12, label LBL_4, label LBL_1 LBL_1: %13 = icmp slt i32 %storemerge.in, -1073741823 br i1 %13, label LBL_3, label LBL_2 LBL_2: %14 = mul i32 %storemerge.in, 2 %15 = zext i32 %14 to i64 %16 = call i64 @FUNC(i64 %15) store i64 %16, i64* %rax.0.reg2mem br label LBL_4 LBL_3: %17 = call i64 @FUNC(i64 ptrtoint ([51 x i8]* @gv_0 to i64)) store i64 %17, 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* %rax.0.reg2mem, { 0, 2, 1, 3 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_int_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 = 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)) 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: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %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 %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 }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_ncpy_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_5 LBL_2: %4 = call i64* @malloc(i32 100) %5 = icmp eq i64* %4, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_4, label LBL_3 LBL_3: call void @exit(i32 -1) unreachable LBL_4: %7 = bitcast i64* %4 to i8* store i8 0, i8* %7, align 1 store i8* %7, i8** %sv_0.0.reg2mem br label LBL_5 LBL_5: %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* @strncpy(i8* %sv_0.0.reload, i8* nonnull %9, i32 99) %11 = ptrtoint i8* %sv_0.0.reload to i64 %12 = add i64 %11, 99 %13 = inttoptr i64 %12 to i8* store i8 0, i8* %13, align 1 %14 = call i64 @FUNC(i64 %11) %15 = bitcast i8* %sv_0.0.reload to i64* call void @free(i64* %15) %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 i8* %sv_0.0.reload, { 2, 0, 1 } uselistorder i64* %4, { 1, 0 } uselistorder i8** %sv_0.0.reg2mem, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__int_fscanf_sub_10-bad
CWE191_Integer_Underflow__int_fscanf_sub_10_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 = 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), i64* nonnull %sv_0) %.pr = load i32, i32* @gv_0, align 4 %5 = icmp eq i32 %.pr, 0 br i1 %5, label LBL_3, label LBL_2 LBL_2: %6 = load i64, i64* %sv_0, align 8 %7 = add i64 %6, 4294967295 %8 = and i64 %7, 4294967295 %9 = call i64 @FUNC(i64 %8) 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 i64* %sv_0, { 1, 0, 2 } uselistorder label LBL_3, { 1, 2, 0 } }
1
juliet-test-suite-c
CWE134_Uncontrolled_Format_String__char_listen_socket_snprintf_11-bad
CWE134_Uncontrolled_Format_String__char_listen_socket_snprintf_11_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) store i64 0, i64* %sv_2, align 8 %1 = bitcast i64* %sv_2 to i8* %2 = call i64 @FUNC() %3 = trunc i64 %2 to i32 %4 = icmp eq i32 %3, 0 br i1 %4, label LBL_12, label LBL_1 LBL_1: %5 = call i32 @strlen(i8* nonnull %1) %6 = call i32 @socket(i32 2, i32 1, i32 6) %7 = icmp eq i32 %6, -1 br i1 %7, label LBL_12, label LBL_2 LBL_2: %8 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16) store i64 2, i64* %sv_1, align 8 %9 = call i16 @htons(i16 27015) %10 = bitcast i64* %sv_1 to %sockaddr* %11 = call i32 @bind(i32 %6, %sockaddr* nonnull %10, i32 16) %12 = icmp eq i32 %11, -1 br i1 %12, label LBL_10, label LBL_3 LBL_3: %13 = call i32 @listen(i32 %6, i32 5) %14 = icmp eq i32 %13, -1 br i1 %14, label LBL_10, 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_10, label LBL_5 LBL_5: %17 = sext i32 %5 to i64 %18 = ptrtoint i64* %sv_2 to i64 %19 = add i64 %17, %18 %20 = inttoptr i64 %19 to i64* %21 = sub i32 99, %5 %22 = call i32 @recv(i32 %15, i64* %20, i32 %21, i32 0) %23 = add i32 %22, 1 %24 = icmp ult i32 %23, 2 br i1 %24, label LBL_11, label LBL_6 LBL_6: %25 = sext i32 %22 to i64 %26 = add i64 %19, %25 %27 = inttoptr i64 %26 to i8* store i8 0, i8* %27, align 1 %28 = call i8* @strchr(i8* nonnull %1, i32 13) %29 = icmp eq i8* %28, null br i1 %29, label LBL_8, label LBL_7 LBL_7: store i8 0, i8* %28, align 1 br label LBL_8 LBL_8: %30 = call i8* @strchr(i8* nonnull %1, i32 10) %31 = icmp eq i8* %30, null br i1 %31, label LBL_11, label LBL_9 LBL_9: store i8 0, i8* %30, align 1 br label LBL_11 LBL_10: %32 = call i32 @close(i32 %6) br label LBL_12 LBL_11: %33 = call i32 @close(i32 %6) %34 = call i32 @close(i32 %15) br label LBL_12 LBL_12: %35 = call i64 @FUNC() %36 = trunc i64 %35 to i32 %37 = icmp eq i32 %36, 0 br i1 %37, label LBL_14, label LBL_13 LBL_13: store i64 0, i64* %sv_0, align 8 %38 = bitcast i64* %sv_0 to i8* %39 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %38, i32 99, i8* nonnull %1) %40 = call i64 @FUNC(i64* nonnull %sv_0) br label LBL_14 LBL_14: %41 = call i64 @FUNC(i64 40) %42 = icmp eq i64 %0, %41 store i64 0, i64* %rax.0.reg2mem br i1 %42, 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 %22, { 1, 0 } uselistorder i32 %6, { 4, 0, 1, 2, 3, 5 } uselistorder i8* %1, { 3, 0, 1, 2 } uselistorder i64* %sv_1, { 0, 2, 1 } uselistorder i32 (i32)* @close, { 2, 1, 0, 3 } uselistorder i8* (i8*, i32)* @strchr, { 1, 0, 2 } uselistorder i32 99, { 1, 0 } uselistorder i64 ()* @globalReturnsTrue, { 1, 0 } uselistorder label LBL_12, { 2, 1, 0, 3 } }
1
juliet-test-suite-c
CWE400_Resource_Exhaustion__fgets_fwrite_03-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge5.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 = bitcast i64* %sv_0 to i8* %3 = call i8* @fgets(i8* nonnull %2, i32 14, %_IO_FILE* %1) %4 = icmp eq i8* %3, null br i1 %4, label LBL_1, label LBL_2 LBL_1: %5 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64)) br label LBL_10 LBL_2: %6 = call i32 @atoi(i8* nonnull %2) %sv_1.0.off = add i32 %6, -1 %7 = icmp ugt i32 %sv_1.0.off, 19 br i1 %7, label LBL_10, label LBL_3 LBL_3: %8 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @gv_2, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_3, i64 0, i64 0)) %9 = icmp eq %_IO_FILE* %8, null %10 = icmp eq i1 %9, false br i1 %10, label LBL_4, label LBL_5 LBL_4: %11 = sext i32 %6 to i64 store i64 0, i64* %storemerge5.reg2mem br label LBL_6 LBL_5: call void @exit(i32 1) unreachable LBL_6: %12 = call i32 @fwrite(i64* bitcast ([51 x i8]* @gv_4 to i64*), i32 1, i32 50, %_IO_FILE* %8) %13 = icmp eq i32 %12, 50 br i1 %13, label LBL_8, label LBL_7 LBL_7: call void @exit(i32 1) unreachable LBL_8: %storemerge5.reload = load i64, i64* %storemerge5.reg2mem %14 = add nuw i64 %storemerge5.reload, 1 %15 = icmp ult i64 %14, %11 store i64 %14, i64* %storemerge5.reg2mem br i1 %15, label LBL_6, label LBL_9 LBL_9: %16 = call i32 @fclose(%_IO_FILE* nonnull %8) br label LBL_10 LBL_10: %17 = call i64 @FUNC(i64 40) %18 = icmp eq i64 %0, %17 store i64 0, i64* %rax.0.reg2mem br i1 %18, 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 %_IO_FILE* %8, { 1, 0, 2 } uselistorder i32 %6, { 1, 0 } uselistorder i64* %storemerge5.reg2mem, { 1, 0, 2 } uselistorder i8* (i8*, i32, %_IO_FILE*)* @fgets, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_0, { 1, 0 } uselistorder label LBL_10, { 1, 2, 0 } uselistorder label LBL_6, { 1, 0 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__int_rand_sub_08-good
goodB2G1
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 0, i32* %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 = 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* %sv_0.0.reg2mem br label LBL_2 LBL_2: %14 = call i64 @FUNC() %15 = trunc i64 %14 to i32 %16 = icmp eq i32 %15, 0 br i1 %16, label LBL_4, label LBL_3 LBL_3: %17 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) store i64 %17, i64* %rax.0.reg2mem br label LBL_7 LBL_4: %sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem %18 = icmp eq i32 %sv_0.0.reload, -2147483648 br i1 %18, label LBL_6, label LBL_5 LBL_5: %19 = add i32 %sv_0.0.reload, -1 %20 = zext i32 %19 to i64 %21 = call i64 @FUNC(i64 %20) store i64 %21, i64* %rax.0.reg2mem br label LBL_7 LBL_6: %22 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_1 to i64)) store i64 %22, 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* %rax.0.reg2mem, { 0, 3, 2, 1 } }
0
juliet-test-suite-c
CWE126_Buffer_Overread__malloc_char_memcpy_04-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 = 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 = bitcast i64* %sv_0 to i8* %10 = call i32 @strlen(i8* nonnull %9) %11 = call i64* @memcpy(i64* nonnull %sv_0, i64* %1, i32 %10) %12 = ptrtoint i64* %sv_0 to i64 %13 = call i64 @FUNC(i64 %12) call void @free(i64* %1) %14 = call i64 @FUNC(i64 40) %15 = icmp eq i64 %0, %14 store i64 0, i64* %rax.0.reg2mem br i1 %15, 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, 4, 3 } uselistorder i64* %sv_0, { 3, 0, 1, 2 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i64* (i64*, i64*, i32)* @memcpy, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 3, 2, 1, 0, 4 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE124_Buffer_Underwrite__char_declare_memmove_32-good
goodG2B
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 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99) %2 = ptrtoint i64* %sv_1 to i64 %3 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %4 = call i64* @memmove(i64* nonnull %sv_1, i64* nonnull %sv_0, i32 100) %5 = add i64 %2, 99 %6 = inttoptr i64 %5 to i8* store i8 0, i8* %6, align 1 %7 = call i64 @FUNC(i64 %2) %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 i64 %2, { 1, 0 } uselistorder i64* %sv_1, { 0, 2, 1 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE606_Unchecked_Loop_Condition__char_connect_socket_03-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.lcssa.reg2mem = alloca i64 %storemerge5.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) store i64 0, i64* %sv_3, align 8 %1 = bitcast i64* %sv_3 to i8* %2 = call i32 @strlen(i8* nonnull %1) %3 = call i32 @socket(i32 2, i32 1, i32 6) %cond = icmp eq i32 %3, -1 br i1 %cond, label LBL_8, label LBL_1 LBL_1: %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 %3, %sockaddr* nonnull %7, i32 16) %9 = icmp eq i32 %8, -1 br i1 %9, label LBL_7, label LBL_2 LBL_2: %10 = sext i32 %2 to i64 %11 = ptrtoint i64* %sv_3 to i64 %12 = add i64 %10, %11 %13 = inttoptr i64 %12 to i64* %14 = sub i32 99, %2 %15 = call i32 @recv(i32 %3, i64* %13, i32 %14, i32 0) %16 = add i32 %15, 1 %17 = icmp ult i32 %16, 2 br i1 %17, label LBL_7, label LBL_3 LBL_3: %18 = sext i32 %15 to i64 %19 = add i64 %12, %18 %20 = inttoptr i64 %19 to i8* store i8 0, i8* %20, align 1 %21 = call i8* @strchr(i8* nonnull %1, i32 13) %22 = icmp eq i8* %21, null br i1 %22, label LBL_5, label LBL_4 LBL_4: store i8 0, i8* %21, align 1 br label LBL_5 LBL_5: %23 = call i8* @strchr(i8* nonnull %1, i32 10) %24 = icmp eq i8* %23, null br i1 %24, label LBL_7, label LBL_6 LBL_6: store i8 0, i8* %23, align 1 br label LBL_7 LBL_7: %25 = call i32 @close(i32 %3) br label LBL_8 LBL_8: %26 = call i32 (i8*, i8*, ...) @sscanf(i8* nonnull %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_1) %27 = icmp eq i32 %26, 1 %28 = icmp eq i1 %27, false br i1 %28, label LBL_14, label LBL_9 LBL_9: %29 = load i64, i64* %sv_1, align 8 %30 = trunc i64 %29 to i32 %31 = icmp sgt i32 %30, 9999 br i1 %31, label LBL_14, label LBL_10 LBL_10: %32 = and i64 %29, 4294967295 %33 = icmp eq i64 %32, 0 store i32 0, i32* %storemerge5.reg2mem store i64 0, i64* %sv_0.0.lcssa.reg2mem br i1 %33, label LBL_13, label LBL_11 LBL_11: %storemerge5.reload = load i32, i32* %storemerge5.reg2mem %34 = add i32 %storemerge5.reload, 1 %35 = sext i32 %34 to i64 %36 = icmp sgt i64 %32, %35 store i32 %34, i32* %storemerge5.reg2mem br i1 %36, label LBL_11, label LBL_12 LBL_12: %phitmp = zext i32 %34 to i64 store i64 %phitmp, i64* %sv_0.0.lcssa.reg2mem br label LBL_13 LBL_13: %sv_0.0.lcssa.reload = load i64, i64* %sv_0.0.lcssa.reg2mem %37 = call i64 @FUNC(i64 %sv_0.0.lcssa.reload) br label LBL_14 LBL_14: %38 = call i64 @FUNC(i64 40) %39 = icmp eq i64 %0, %38 store i64 0, i64* %rax.0.reg2mem br i1 %39, 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 %34, { 1, 0, 2 } uselistorder i32 %15, { 1, 0 } uselistorder i32 %3, { 3, 1, 2, 0 } uselistorder i8* %1, { 2, 0, 1, 3 } uselistorder i64* %sv_2, { 0, 2, 1 } uselistorder i64* %sv_1, { 1, 0 } uselistorder i32* %storemerge5.reg2mem, { 2, 0, 1 } uselistorder i64* %sv_0.0.lcssa.reg2mem, { 0, 2, 1 } uselistorder i32 (i32)* @close, { 1, 0, 2 } uselistorder i8* (i8*, i32)* @strchr, { 3, 2, 1, 0, 4 } uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 } uselistorder i32 (i32, %sockaddr*, i32)* @connect, { 1, 0, 2 } uselistorder i16 (i16)* @htons, { 1, 0, 2 } uselistorder i32 (i8*)* @inet_addr, { 1, 0, 2 } uselistorder i32 -1, { 2, 0, 3, 1 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder label LBL_13, { 1, 0 } uselistorder label LBL_11, { 1, 0 } uselistorder label LBL_8, { 1, 0 } uselistorder label LBL_7, { 2, 1, 0, 3 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__short_fscanf_multiply_11-good
goodB2G1
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_4, label LBL_3 LBL_3: %9 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64)) br label LBL_8 LBL_4: %10 = load i16, i16* %sv_0, align 2 %11 = icmp slt i16 %10, 1 br i1 %11, label LBL_8, label LBL_5 LBL_5: %12 = icmp sgt i16 %10, 16382 br i1 %12, label LBL_7, label LBL_6 LBL_6: %13 = mul i16 %10, 2 %14 = sext i16 %13 to i64 %15 = and i64 %14, 4294967294 %16 = call i64 @FUNC(i64 %15) br label LBL_8 LBL_7: %17 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_3 to i64)) br label LBL_8 LBL_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_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 i16* %sv_0, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE457_Use_of_Uninitialized_Variable__double_array_malloc_partial_init_05-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.2.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %xmm0.24.reg2mem = alloca i128 %indvars.iv9.reg2mem = alloca i64 %xmm0.1.reg2mem = alloca i128 %xmm0.06.reg2mem = alloca i128 %indvars.iv12.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, 0 store i64 0, i64* %indvars.iv12.reg2mem br i1 %5, label LBL_4, label LBL_3 LBL_3: %xmm0.06.reload = load i128, i128* %xmm0.06.reg2mem %indvars.iv12.reload = load i64, i64* %indvars.iv12.reg2mem %6 = mul i64 %indvars.iv12.reload, 8 %7 = add i64 %6, %3 %8 = call i128 @FUNC(i128 %xmm0.06.reload, i128 %xmm0.06.reload) %9 = trunc i64 %indvars.iv12.reload to i32 %10 = call i128 @FUNC(i32 %9) %11 = call i64 @FUNC(i128 %10) %12 = inttoptr i64 %7 to i64* store i64 %11, i64* %12, align 8 %indvars.iv.next13 = add nuw nsw i64 %indvars.iv12.reload, 1 %exitcond14 = icmp eq i64 %indvars.iv.next13, 5 store i64 %indvars.iv.next13, i64* %indvars.iv12.reg2mem store i128 %10, i128* %xmm0.06.reg2mem store i128 %10, i128* %xmm0.1.reg2mem br i1 %exitcond14, label LBL_4, label LBL_3 LBL_4: %xmm0.1.reload = load i128, i128* %xmm0.1.reg2mem %13 = load i32, i32* @gv_1, align 4 %14 = icmp eq i32 %13, 0 store i64 0, i64* %indvars.iv9.reg2mem store i128 %xmm0.1.reload, i128* %xmm0.24.reg2mem br i1 %14, label LBL_6, label LBL_5 LBL_5: %15 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64)) store i64 %15, i64* %rax.2.reg2mem br label LBL_8 LBL_6: %xmm0.24.reload = load i128, i128* %xmm0.24.reg2mem %indvars.iv9.reload = load i64, i64* %indvars.iv9.reg2mem %16 = mul i64 %indvars.iv9.reload, 8 %17 = add i64 %16, %3 %18 = call i128 @FUNC(i128 %xmm0.24.reload, i128 %xmm0.24.reload) %19 = trunc i64 %indvars.iv9.reload to i32 %20 = call i128 @FUNC(i32 %19) %21 = call i64 @FUNC(i128 %20) %22 = inttoptr i64 %17 to i64* store i64 %21, i64* %22, align 8 %indvars.iv.next10 = add nuw nsw i64 %indvars.iv9.reload, 1 %exitcond11 = icmp eq i64 %indvars.iv.next10, 10 store i64 %indvars.iv.next10, i64* %indvars.iv9.reg2mem store i128 %20, i128* %xmm0.24.reg2mem store i64 0, i64* %indvars.iv.reg2mem br i1 %exitcond11, label LBL_7, label LBL_6 LBL_7: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %23 = mul i64 %indvars.iv.reload, 8 %24 = add i64 %23, %3 %25 = inttoptr i64 %24 to i64* %26 = load i64, i64* %25, align 8 %27 = call i128 @FUNC(i64 %26) %28 = call i64 @FUNC() %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 %28, i64* %rax.2.reg2mem br i1 %exitcond, label LBL_8, label LBL_7 LBL_8: %rax.2.reload = load i64, i64* %rax.2.reg2mem ret i64 %rax.2.reload uselistorder i128 %xmm0.24.reload, { 1, 0 } uselistorder i128 %xmm0.06.reload, { 1, 0 } uselistorder i64* %0, { 1, 0 } uselistorder i64* %indvars.iv12.reg2mem, { 2, 0, 1 } uselistorder i128* %xmm0.06.reg2mem, { 1, 0 } uselistorder i64* %indvars.iv9.reg2mem, { 2, 0, 1 } uselistorder i128* %xmm0.24.reg2mem, { 2, 0, 1 } uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 } uselistorder label LBL_7, { 1, 0 } uselistorder label LBL_6, { 1, 0 } uselistorder label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE401_Memory_Leak__int_calloc_08-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i32*, align 8 %0 = call i64 @FUNC(i64 40) store i32* null, i32** %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_1, label LBL_2 LBL_1: %4 = ptrtoint i32** %sv_0 to i64 %5 = add i64 %4, -401 %6 = and i64 %5, -16 %7 = inttoptr i64 %6 to i32* store i32* %7, i32** %sv_0, align 8 store i32 5, i32* %7, align 16 %8 = load i32*, i32** %sv_0, align 8 %9 = load i32, i32* %8, align 4 %10 = zext i32 %9 to i64 %11 = call i64 @FUNC(i64 %10) br label LBL_3 LBL_2: %12 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) br label LBL_3 LBL_3: %13 = call i64 @FUNC() %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 i32** %sv_0, { 3, 2, 0, 1 } uselistorder i64 ()* @staticReturnsFalse, { 1, 0 } uselistorder label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE369_Divide_by_Zero__int_listen_socket_modulo_06-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0479.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 -1, i32* %sv_0.0479.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 -1, 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 -1, i32* %sv_0.0479.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, 0 store i32 %sv_0.0.ph.reload, i32* %sv_0.0479.reg2mem br i1 %25, label LBL_9, label LBL_8 LBL_8: %sv_0.0479.reload = load i32, i32* %sv_0.0479.reg2mem %26 = urem i32 100, %sv_0.0479.reload %27 = zext i32 %26 to i64 %28 = call i64 @FUNC(i64 %27) br label LBL_10 LBL_9: %29 = call i64 @FUNC(i64 ptrtoint ([38 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.0479.reg2mem, { 0, 3, 2, 1 } uselistorder i32 (i32)* @close, { 5, 4, 0, 3, 2, 1, 6 } uselistorder i32 (i8*)* @atoi, { 1, 0, 2 } uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 } uselistorder i32 (i32, %sockaddr*, i32*)* @accept, { 1, 0, 2 } uselistorder i32 (i32, %sockaddr*, i32)* @bind, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } uselistorder i32 -1, { 1, 2, 6, 7, 8, 0, 9, 4, 5, 10, 11, 12, 3, 13 } uselistorder i32 (i32, i32, i32)* @socket, { 1, 0, 2 } uselistorder label LBL_8, { 2, 1, 0 } uselistorder label LBL_7, { 1, 0 } }
0
juliet-test-suite-c
CWE570_Expression_Always_False__global_five_01-bad
CWE570_Expression_Always_False__global_five_01_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 = icmp eq i32 %0, 5 store i64 5, i64* %rax.0.reg2mem br i1 %1, label LBL_2, label LBL_1 LBL_1: %2 = call i64 @FUNC(i64 ptrtoint ([13 x i8]* @gv_0 to i64)) 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 }
1
juliet-test-suite-c
CWE126_Buffer_Overread__char_alloca_loop_04-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.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, -49 %3 = and i64 %2, -16 %4 = add i64 %0, -161 %5 = and i64 %4, -16 %6 = inttoptr i64 %3 to i64* %7 = call i64* @memset(i64* %6, i32 65, i32 49) %8 = add i64 %3, 49 %9 = inttoptr i64 %8 to i8* store i8 0, i8* %9, align 1 %10 = inttoptr i64 %5 to i64* %11 = call i64* @memset(i64* %10, i32 65, i32 99) %12 = add i64 %5, 99 %13 = inttoptr i64 %12 to i8* store i8 0, i8* %13, align 1 %14 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %15 = bitcast i64* %sv_0 to i8* %16 = call i32 @strlen(i8* nonnull %15) %17 = sext i32 %16 to i64 %18 = icmp eq i32 %16, 0 %.pre = ptrtoint i64* %sv_0 to i64 store i64 0, i64* %storemerge1.reg2mem br i1 %18, label LBL_2, label LBL_1 LBL_1: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %19 = add i64 %storemerge1.reload, %5 %20 = inttoptr i64 %19 to i8* %21 = load i8, i8* %20, align 1 %22 = add i64 %storemerge1.reload, %.pre %23 = inttoptr i64 %22 to i8* store i8 %21, i8* %23, align 1 %24 = add nuw i64 %storemerge1.reload, 1 %25 = icmp ult i64 %24, %17 store i64 %24, i64* %storemerge1.reg2mem br i1 %25, label LBL_1, label LBL_2 LBL_2: %26 = call i64 @FUNC(i64 %.pre) %27 = call i64 @FUNC(i64 40) %28 = icmp eq i64 %1, %27 store i64 0, i64* %rax.0.reg2mem br i1 %28, 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 %storemerge1.reload, { 0, 2, 1 } uselistorder i64 %.pre, { 1, 0 } uselistorder i64 %5, { 0, 2, 1 } uselistorder i64 %3, { 1, 0 } uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 5, 4, 3, 2, 1, 0, 6 } uselistorder label LBL_1, { 1, 0 } }
0
juliet-test-suite-c
CWE401_Memory_Leak__int_calloc_07-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i32*, align 8 %0 = call i64 @FUNC(i64 40) store i32* null, i32** %sv_0, align 8 %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 br i1 %2, label LBL_1, label LBL_2 LBL_1: %3 = ptrtoint i32** %sv_0 to i64 %4 = add i64 %3, -401 %5 = and i64 %4, -16 %6 = inttoptr i64 %5 to i32* store i32* %6, i32** %sv_0, align 8 store i32 5, i32* %6, align 16 %7 = load i32*, i32** %sv_0, align 8 %8 = load i32, i32* %7, align 4 %9 = zext i32 %8 to i64 %10 = call i64 @FUNC(i64 %9) br label LBL_3 LBL_2: %11 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64)) br label LBL_3 LBL_3: %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 i32** %sv_0, { 3, 2, 0, 1 } uselistorder label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE590_Free_Memory_Not_on_Heap__free_int_alloca_34-bad
CWE590_Free_Memory_Not_on_Heap__free_int_alloca_34_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.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, -401 %3 = and i64 %2, -16 store i64 0, i64* %storemerge1.reg2mem br label LBL_1 LBL_1: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %4 = mul i64 %storemerge1.reload, 4 %5 = add i64 %4, %3 %6 = inttoptr i64 %5 to i32* store i32 5, i32* %6, align 4 %7 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %7, 100 store i64 %7, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_2, label LBL_1 LBL_2: store i64 %3, i64* %sv_0, align 8 %8 = inttoptr i64 %3 to i32* %9 = load i32, i32* %8, align 16 %10 = zext i32 %9 to i64 %11 = call i64 @FUNC(i64 %10) %12 = inttoptr i64 %3 to i64* call void @free(i64* %12) %13 = call i64 @FUNC(i64 40) %14 = icmp eq i64 %1, %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 %3, { 2, 3, 1, 0 } uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE129_connect_socket_08-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %indvars.iv5.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_9, label LBL_1 LBL_1: %4 = trunc i64 %0 to i32 %5 = icmp eq i32 %4, 0 %spec.select = select i1 %5, i64 -4, i64 28 %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_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %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_4, label LBL_3 LBL_4: br i1 %5, label LBL_7, label LBL_5 LBL_5: %13 = add i64 %spec.select, %7 %14 = inttoptr i64 %13 to i32* store i32 1, i32* %14, align 4 store i64 0, i64* %indvars.iv.reg2mem br label LBL_6 LBL_6: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %15 = mul i64 %indvars.iv.reload, 4 %16 = add i64 %15, %7 %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_8, label LBL_6 LBL_7: %21 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_0 to i64)) br label LBL_8 LBL_8: call void @free(i64* %6) 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 i64 %7, { 1, 0, 2 } uselistorder i1 %5, { 1, 0 } uselistorder i64* %indvars.iv5.reg2mem, { 2, 0, 1 } uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 } uselistorder void (i64*)* @free, { 3, 2, 1, 0, 4 } uselistorder i64 (i64)* @printIntLine, { 3, 2, 1, 0 } uselistorder i64 10, { 1, 0, 3, 2, 5, 4, 7, 6 } uselistorder void (i32)* @exit, { 3, 2, 1, 0, 4 } uselistorder i32 -1, { 9, 10, 0, 13, 4, 3, 11, 1, 12, 2, 16, 8, 7, 14, 5, 15, 6 } uselistorder i64* (i32)* @malloc, { 3, 2, 1, 0, 4 } uselistorder i64 ()* @staticReturnsTrue, { 5, 4, 3, 2, 1, 0 } uselistorder label LBL_8, { 1, 0 } uselistorder label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__int_listen_socket_multiply_12-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.2.reg2mem = alloca i32 %sv_0.1.ph.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 = ptrtoint i64* %sv_3 to i64 %1 = call i64 @FUNC(i64 40) %2 = call i64 @FUNC() %3 = trunc i64 %2 to i32 %4 = icmp eq i32 %3, 0 %5 = call i32 @socket(i32 2, i32 1, i32 6) %6 = icmp eq i32 %5, -1 br i1 %4, label LBL_9, label LBL_1 LBL_1: store i32 0, i32* %sv_0.2.reg2mem br i1 %6, label LBL_17, label LBL_2 LBL_2: %7 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16) store i64 2, i64* %sv_2, align 8 %8 = call i16 @htons(i16 27015) %9 = bitcast i64* %sv_2 to %sockaddr* %10 = call i32 @bind(i32 %5, %sockaddr* nonnull %9, i32 16) %11 = icmp eq i32 %10, -1 br i1 %11, label LBL_7, label LBL_3 LBL_3: %12 = call i32 @listen(i32 %5, i32 5) %13 = icmp eq i32 %12, -1 br i1 %13, label LBL_7, label LBL_4 LBL_4: %14 = call i32 @accept(i32 %5, %sockaddr* null, i32* null) %15 = icmp eq i32 %14, -1 br i1 %15, label LBL_7, label LBL_5 LBL_5: %16 = call i32 @recv(i32 %14, i64* nonnull %sv_1, i32 13, i32 0) %17 = add i32 %16, 1 %18 = icmp ult i32 %17, 2 store i32 0, i32* %sv_0.0.ph.reg2mem br i1 %18, label LBL_8, label LBL_6 LBL_6: %19 = sext i32 %16 to i64 %20 = add i64 %0, -22 %21 = add i64 %20, %19 %22 = inttoptr i64 %21 to i8* store i8 0, i8* %22, align 1 %23 = bitcast i64* %sv_1 to i8* %24 = call i32 @atoi(i8* nonnull %23) store i32 %24, i32* %sv_0.0.ph.reg2mem br label LBL_8 LBL_7: %25 = call i32 @close(i32 %5) store i32 0, i32* %sv_0.2.reg2mem br label LBL_17 LBL_8: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %26 = call i32 @close(i32 %5) %27 = call i32 @close(i32 %14) store i32 %sv_0.0.ph.reload, i32* %sv_0.2.reg2mem br label LBL_17 LBL_9: store i32 0, i32* %sv_0.2.reg2mem br i1 %6, label LBL_17, label LBL_10 LBL_10: %28 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16) store i64 2, i64* %sv_2, align 8 %29 = call i16 @htons(i16 27015) %30 = bitcast i64* %sv_2 to %sockaddr* %31 = call i32 @bind(i32 %5, %sockaddr* nonnull %30, i32 16) %32 = icmp eq i32 %31, -1 br i1 %32, label LBL_15, label LBL_11 LBL_11: %33 = call i32 @listen(i32 %5, i32 5) %34 = icmp eq i32 %33, -1 br i1 %34, label LBL_15, label LBL_12 LBL_12: %35 = call i32 @accept(i32 %5, %sockaddr* null, i32* null) %36 = icmp eq i32 %35, -1 br i1 %36, label LBL_15, label LBL_13 LBL_13: %37 = call i32 @recv(i32 %35, i64* nonnull %sv_1, i32 13, i32 0) %38 = add i32 %37, 1 %39 = icmp ult i32 %38, 2 store i32 0, i32* %sv_0.1.ph.reg2mem br i1 %39, label LBL_16, label LBL_14 LBL_14: %40 = sext i32 %37 to i64 %41 = add i64 %0, -22 %42 = add i64 %41, %40 %43 = inttoptr i64 %42 to i8* store i8 0, i8* %43, align 1 %44 = bitcast i64* %sv_1 to i8* %45 = call i32 @atoi(i8* nonnull %44) store i32 %45, i32* %sv_0.1.ph.reg2mem br label LBL_16 LBL_15: %46 = call i32 @close(i32 %5) store i32 0, i32* %sv_0.2.reg2mem br label LBL_17 LBL_16: %sv_0.1.ph.reload = load i32, i32* %sv_0.1.ph.reg2mem %47 = call i32 @close(i32 %5) %48 = call i32 @close(i32 %35) store i32 %sv_0.1.ph.reload, i32* %sv_0.2.reg2mem br label LBL_17 LBL_17: %sv_0.2.reload = load i32, i32* %sv_0.2.reg2mem %49 = call i64 @FUNC() %50 = trunc i64 %49 to i32 %51 = icmp eq i32 %50, 0 %52 = icmp slt i32 %sv_0.2.reload, 1 br i1 %51, label LBL_22, label LBL_18 LBL_18: br i1 %52, label LBL_26, label LBL_19 LBL_19: %53 = icmp sgt i32 %sv_0.2.reload, 1073741822 br i1 %53, label LBL_21, label LBL_20 LBL_20: %54 = mul i32 %sv_0.2.reload, 2 %55 = zext i32 %54 to i64 %56 = call i64 @FUNC(i64 %55) br label LBL_26 LBL_21: %57 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_0 to i64)) br label LBL_26 LBL_22: br i1 %52, label LBL_26, label LBL_23 LBL_23: %58 = icmp sgt i32 %sv_0.2.reload, 1073741822 br i1 %58, label LBL_25, label LBL_24 LBL_24: %59 = mul i32 %sv_0.2.reload, 2 %60 = zext i32 %59 to i64 %61 = call i64 @FUNC(i64 %60) br label LBL_26 LBL_25: %62 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_0 to i64)) br label LBL_26 LBL_26: %63 = call i64 @FUNC(i64 40) %64 = icmp eq i64 %1, %63 store i64 0, i64* %rax.0.reg2mem br i1 %64, label LBL_28, label LBL_27 LBL_27: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_28 LBL_28: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i1 %52, { 1, 0 } uselistorder i32 %sv_0.2.reload, { 4, 1, 3, 0, 2 } uselistorder i32 %37, { 1, 0 } uselistorder i32 %16, { 1, 0 } uselistorder i1 %6, { 1, 0 } uselistorder i32 %5, { 9, 0, 6, 7, 8, 2, 1, 5, 4, 3, 10 } uselistorder i64 %0, { 1, 0 } uselistorder i64* %sv_2, { 0, 4, 1, 2, 5, 3 } uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 1 } uselistorder i32* %sv_0.1.ph.reg2mem, { 0, 2, 1 } uselistorder i32* %sv_0.2.reg2mem, { 0, 6, 3, 1, 5, 4, 2 } uselistorder i32 (i32)* @close, { 5, 4, 0, 3, 2, 1, 6 } uselistorder i32 (i8*)* @atoi, { 1, 0, 2 } uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 } uselistorder i32 (i32, %sockaddr*, i32*)* @accept, { 1, 0, 2 } uselistorder i32 (i32, i32)* @listen, { 1, 0, 2 } uselistorder i32 (i32, %sockaddr*, i32)* @bind, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } uselistorder i32 -1, { 0, 1, 2, 4, 5, 6, 3 } uselistorder label LBL_17, { 4, 2, 0, 5, 3, 1 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__unsigned_int_fscanf_sub_06-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 0, 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 = add i32 %3, -1 %6 = zext i32 %5 to i64 %7 = call i64 @FUNC(i64 %6) br label LBL_3 LBL_2: %8 = call i64 @FUNC(i64 ptrtoint ([48 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, 2, 0 } uselistorder i32 (%_IO_FILE*, i8*, ...)* @fscanf, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE761_Free_Pointer_Not_at_Start_of_Buffer__char_listen_socket_14-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge7.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* store i8 0, i8* %4, align 1 %5 = call i32 @strlen(i8* %4) %6 = call i32 @socket(i32 2, i32 1, i32 6) %7 = icmp eq i32 %6, -1 br i1 %7, label LBL_13, label LBL_3 LBL_3: %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_11, label LBL_4 LBL_4: %13 = call i32 @listen(i32 %6, i32 5) %14 = icmp eq i32 %13, -1 br i1 %14, label LBL_11, label LBL_5 LBL_5: %15 = call i32 @accept(i32 %6, %sockaddr* null, i32* null) %16 = icmp eq i32 %15, -1 br i1 %16, label LBL_11, label LBL_6 LBL_6: %17 = sext i32 %5 to i64 %18 = ptrtoint i64* %1 to i64 %19 = add i64 %17, %18 %20 = inttoptr i64 %19 to i64* %21 = sub i32 99, %5 %22 = call i32 @recv(i32 %15, i64* %20, i32 %21, i32 0) %23 = add i32 %22, 1 %24 = icmp ult i32 %23, 2 br i1 %24, label LBL_12, label LBL_7 LBL_7: %25 = sext i32 %22 to i64 %26 = add i64 %19, %25 %27 = inttoptr i64 %26 to i8* store i8 0, i8* %27, align 1 %28 = call i8* @strchr(i8* nonnull %4, i32 13) %29 = icmp eq i8* %28, null br i1 %29, label LBL_9, label LBL_8 LBL_8: store i8 0, i8* %28, align 1 br label LBL_9 LBL_9: %30 = call i8* @strchr(i8* nonnull %4, i32 10) %31 = icmp eq i8* %30, null br i1 %31, label LBL_12, label LBL_10 LBL_10: store i8 0, i8* %30, align 1 br label LBL_12 LBL_11: %32 = call i32 @close(i32 %6) br label LBL_13 LBL_12: %33 = call i32 @close(i32 %6) %34 = call i32 @close(i32 %15) br label LBL_13 LBL_13: %35 = load i32, i32* @gv_0, align 4 %36 = icmp eq i32 %35, 5 %37 = icmp eq i1 %36, false br i1 %37, label LBL_20, label LBL_14 LBL_14: %38 = call i32 @strlen(i8* nonnull %4) %39 = icmp eq i32 %38, 0 br i1 %39, label LBL_19, label LBL_15 LBL_15: %40 = ptrtoint i64* %1 to i64 store i64 0, i64* %storemerge7.reg2mem br label LBL_16 LBL_16: %storemerge7.reload = load i64, i64* %storemerge7.reg2mem %41 = add i64 %storemerge7.reload, %40 %42 = inttoptr i64 %41 to i8* %43 = load i8, i8* %42, align 1 %44 = icmp eq i8 %43, 83 %45 = icmp eq i1 %44, false br i1 %45, label LBL_18, label LBL_17 LBL_17: %46 = call i64 @FUNC(i64 ptrtoint ([17 x i8]* @gv_1 to i64)) br label LBL_19 LBL_18: %47 = add nuw i64 %storemerge7.reload, 1 %48 = call i32 @strlen(i8* %4) %49 = sext i32 %48 to i64 %50 = icmp ult i64 %47, %49 store i64 %47, i64* %storemerge7.reg2mem br i1 %50, label LBL_16, label LBL_19 LBL_19: call void @free(i64* %1) br label LBL_20 LBL_20: %51 = call i64 @FUNC(i64 40) %52 = icmp eq i64 %0, %51 store i64 0, i64* %rax.0.reg2mem br i1 %52, label LBL_22, label LBL_21 LBL_21: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_22 LBL_22: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %22, { 1, 0 } uselistorder i32 %6, { 4, 0, 1, 2, 3, 5 } uselistorder i8* %4, { 3, 0, 1, 2, 5, 4 } uselistorder i64* %1, { 1, 0, 2, 4, 3 } uselistorder i64* %sv_0, { 0, 2, 1 } uselistorder i64* %storemerge7.reg2mem, { 1, 0, 2 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i32 (i32)* @close, { 5, 4, 0, 3, 2, 1, 6 } uselistorder i8* (i8*, i32)* @strchr, { 3, 2, 1, 0, 4 } uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 } uselistorder i32 (i32, %sockaddr*, i32*)* @accept, { 1, 0, 2 } uselistorder i32 (i32, i32)* @listen, { 1, 0, 2 } uselistorder i32 (i32, %sockaddr*, i32)* @bind, { 1, 0, 2 } uselistorder i16 (i16)* @htons, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 5, 0, 4, 3, 1, 2, 6 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } uselistorder label LBL_19, { 0, 2, 1 } uselistorder label LBL_16, { 1, 0 } uselistorder label LBL_13, { 2, 1, 0 } }
0
juliet-test-suite-c
CWE416_Use_After_Free__malloc_free_long_04-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %storemerge1.reg2mem = alloca i64 %0 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32)) %1 = ptrtoint i64* %0 to i64 %2 = icmp eq i64* %0, null %3 = icmp eq i1 %2, false store i64 0, i64* %storemerge1.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %4 = mul i64 %storemerge1.reload, 8 %5 = add i64 %4, %1 %6 = inttoptr i64 %5 to i64* store i64 5, i64* %6, align 8 %7 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %7, 100 store i64 %7, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_3, label LBL_2 LBL_3: %8 = load i64, i64* %0, align 8 %9 = call i64 @FUNC(i64 %8) ret i64 %9 uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 } uselistorder i64 (i64)* @printLongLine, { 1, 0 } uselistorder void (i32)* @exit, { 0, 3, 2, 1, 4 } uselistorder i64* (i32)* @malloc, { 1, 0, 3, 2, 4 } uselistorder label LBL_2, { 1, 0 } }
0
juliet-test-suite-c
CWE510_Trapdoor__ip_based_logic_13-bad
CWE510_Trapdoor__ip_based_logic_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i32 %rax.0.reg2mem = alloca i64 %1 = load i32, i32* %0 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %sv_2 = alloca i32, align 4 %2 = call i64 @FUNC(i64 40) %3 = load i32, i32* inttoptr (i64 8392 to i32*), align 8 %4 = icmp eq i32 %3, 5 %5 = icmp eq i1 %4, false br i1 %5, label LBL_12, label LBL_1 LBL_1: store i32 16, i32* %sv_2, align 4 %6 = call i32 @socket(i32 2, i32 1, i32 6) %7 = icmp eq i32 %6, -1 br i1 %7, label LBL_12, label LBL_2 LBL_2: %8 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16) store i64 2, i64* %sv_1, align 8 %9 = call i16 @htons(i16 20000) %10 = bitcast i64* %sv_1 to %sockaddr* %11 = call i32 @bind(i32 %6, %sockaddr* nonnull %10, i32 16) %12 = icmp eq i32 %11, -1 br i1 %12, label LBL_10, label LBL_3 LBL_3: %13 = call i32 @listen(i32 %6, i32 5) %14 = icmp eq i32 %13, -1 br i1 %14, label LBL_10, 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_10, label LBL_5 LBL_5: %17 = bitcast i64* %sv_0 to %sockaddr* %18 = call i32 @getsockname(i32 %15, %sockaddr* nonnull %17, i32* nonnull %sv_2) %19 = icmp eq i32 %18, -1 br i1 %19, label LBL_11, label LBL_6 LBL_6: %20 = insertvalue %in_addr undef, i32 %1, 0 %21 = call i8* @inet_ntoa(%in_addr %20) %22 = call i32 @strcmp(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @gv_0, i64 0, i64 0), i8* %21) %23 = icmp eq i32 %22, 0 %24 = icmp eq i1 %23, false br i1 %24, label LBL_8, label LBL_7 LBL_7: %25 = call i32 @send(i32 %15, i64* bitcast ([16 x i8]* @gv_1 to i64*), i32 15, i32 0) br label LBL_11 LBL_8: %26 = call i32 @send(i32 %15, i64* bitcast ([9 x i8]* @gv_2 to i64*), i32 8, i32 0) %27 = icmp eq i32 %26, -1 %28 = icmp eq i1 %27, false br i1 %28, label LBL_11, label LBL_9 LBL_9: %29 = call i64 @FUNC(i64 ptrtoint ([13 x i8]* @gv_3 to i64)) br label LBL_11 LBL_10: %30 = call i32 @close(i32 %6) br label LBL_12 LBL_11: %31 = call i32 @close(i32 %6) %32 = call i32 @close(i32 %15) br label LBL_12 LBL_12: %33 = call i64 @FUNC(i64 40) %34 = icmp eq i64 %2, %33 store i64 0, i64* %rax.0.reg2mem br i1 %34, label LBL_14, label LBL_13 LBL_13: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_14 LBL_14: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %6, { 0, 4, 1, 2, 3, 5 } uselistorder i64* %sv_1, { 0, 2, 1 } uselistorder i32 (i32)* @close, { 2, 0, 1, 3 } uselistorder i32 (i32, i64*, i32, i32)* @send, { 1, 0, 2 } uselistorder i32 5, { 1, 0 } uselistorder label LBL_12, { 2, 1, 0, 3 } uselistorder label LBL_11, { 1, 2, 0, 3 } uselistorder label LBL_10, { 2, 1, 0 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__char_type_overrun_memmove_08-bad
CWE122_Heap_Based_Buffer_Overflow__char_type_overrun_memmove_08_bad
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 store i64 %0, i64* %rax.0.reg2mem br i1 %2, label LBL_4, label LBL_1 LBL_1: %3 = call i64* @malloc(i32 32) %4 = icmp eq i64* %3, null %5 = icmp eq i1 %4, false br i1 %5, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %6 = ptrtoint i64* %3 to i64 %7 = add i64 %6, 16 %8 = inttoptr i64 %7 to i64* store i64 ptrtoint ([32 x i8]* @gv_0 to i64), i64* %8, align 8 %9 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_0 to i64)) store i64 3978425819141910832, i64* %3, align 8 %10 = add i64 %6, 8 %11 = inttoptr i64 %10 to i64* store i64 7378413942531504440, i64* %11, align 8 store i64 3978425819141910832, i64* %8, align 8 %12 = add i64 %6, 24 %13 = inttoptr i64 %12 to i64* store i64 28539350662854968, i64* %13, align 8 %14 = add i64 %6, 15 %15 = inttoptr i64 %14 to i8* store i8 0, i8* %15, align 1 %16 = call i64 @FUNC(i64 %6) %17 = load i64, i64* %8, align 8 %18 = call i64 @FUNC(i64 %17) store i64 %18, 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, { 0, 1, 3, 2, 4 } uselistorder i64* %3, { 0, 2, 1 } }
1
juliet-test-suite-c
CWE253_Incorrect_Check_of_Function_Return_Value__char_fputc_17-bad
CWE253_Incorrect_Check_of_Function_Return_Value__char_fputc_17_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %1 = call i32 @fputc(i32 65, %_IO_FILE* %0) %2 = sext i32 %1 to i64 %3 = icmp eq i32 %1, 0 %4 = icmp eq i1 %3, false store i64 %2, i64* %rax.0.reg2mem br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = call i64 @FUNC(i64 ptrtoint ([14 x i8]* @gv_1 to i64)) store i64 %5, 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 %_IO_FILE** @gv_0, { 1, 0 } uselistorder label LBL_2, { 1, 0 } }
1
juliet-test-suite-c
CWE127_Buffer_Underread__malloc_char_memmove_13-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 = 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 = call i64* @memmove(i64* nonnull %sv_0, i64* %1, i32 100) %10 = ptrtoint i64* %sv_0 to i64 %11 = call i64 @FUNC(i64 %10) %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, 3, 2 } uselistorder i64* %sv_0, { 2, 0, 1 } uselistorder i64* (i64*, i64*, i32)* @memmove, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 2, 3, 0, 4 } uselistorder i32 99, { 0, 1, 3, 2 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i64* null, { 1, 2, 0 } uselistorder i32 100, { 0, 1, 3, 2 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__int64_t_max_multiply_13-bad
CWE190_Integer_Overflow__int64_t_max_multiply_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load i32, i32* inttoptr (i64 8336 to i32*), align 16 %1 = icmp eq i32 %0, 5 %2 = icmp eq i1 %1, false store i64 5, i64* %rax.0.reg2mem br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64 @FUNC(i64 -2) store i64 %3, i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE190_Integer_Overflow__char_fscanf_add_13-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %.reg2mem = alloca i8 %sv_0 = alloca i8, align 1 %0 = call i64 @FUNC(i64 40) store i8 32, i8* %sv_0, align 1 %1 = load i32, i32* inttoptr (i64 8420 to i32*), align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i8 32, i8* %.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 ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i8* nonnull %sv_0) %.pr = load i8, i8* %sv_0, align 1 %6 = icmp eq i8 %.pr, 127 store i8 %.pr, i8* %.reg2mem br i1 %6, label LBL_3, label LBL_2 LBL_2: %.reload = load i8, i8* %.reg2mem %7 = add i8 %.reload, 1 %8 = sext i8 %7 to i64 %9 = and i64 %8, 4294967295 %10 = call i64 @FUNC(i64 %9) br label LBL_4 LBL_3: %11 = call i64 @FUNC(i64 ptrtoint ([54 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 i8* %.reg2mem, { 0, 2, 1 } uselistorder label LBL_2, { 1, 0 } }
0
juliet-test-suite-c
CWE195_Signed_to_Unsigned_Conversion_Error__fscanf_malloc_07-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = load i32, i32* @gv_0, align 4 %1 = icmp eq i32 %0, 5 %2 = icmp eq i1 %1, false %spec.select = select i1 %2, i32 -1, i32 99 %3 = call i64* @malloc(i32 %spec.select) %4 = icmp eq i64* %3, null %5 = icmp eq i1 %4, false br i1 %5, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %6 = ptrtoint i64* %3 to i64 %7 = add nsw i32 %spec.select, -1 %8 = call i64* @memset(i64* %3, i32 65, i32 %7) %9 = sext i32 %7 to i64 %10 = add i64 %9, %6 %11 = inttoptr i64 %10 to i8* store i8 0, i8* %11, align 1 %12 = call i64 @FUNC(i64 %6) call void @free(i64* %3) ret i64 ptrtoint (i32* @1 to i64) uselistorder i64 %6, { 1, 0 } uselistorder i64* %3, { 0, 1, 3, 2 } uselistorder i32 %spec.select, { 1, 0 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } uselistorder i32 99, { 1, 0 } uselistorder i32 -1, { 2, 3, 1, 4, 5, 0 } uselistorder i32* @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__int_fgets_multiply_05-bad
CWE191_Integer_Underflow__int_fgets_multiply_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_5, label LBL_1 LBL_1: store i64 0, i64* %sv_0, align 8 %3 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %4 = bitcast i64* %sv_0 to i8* %5 = call i8* @fgets(i8* nonnull %4, i32 14, %_IO_FILE* %3) %6 = icmp eq i8* %5, null br i1 %6, label LBL_2, label LBL_3 LBL_2: %7 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_2 to i64)) br label LBL_5 LBL_3: %8 = call i32 @atoi(i8* nonnull %4) %9 = load i32, i32* @gv_0, align 4 %10 = icmp eq i32 %9, 0 %11 = icmp slt i32 %8, 0 %12 = icmp eq i1 %11, false %or.cond = or i1 %10, %12 br i1 %or.cond, label LBL_5, label LBL_4 LBL_4: %13 = mul i32 %8, 2 %14 = zext i32 %13 to i64 %15 = call i64 @FUNC(i64 %14) br label LBL_5 LBL_5: %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 %_IO_FILE** @gv_1, { 1, 0 } uselistorder i32* @gv_0, { 1, 0 } uselistorder label LBL_5, { 2, 3, 0, 1 } }
1
juliet-test-suite-c
CWE369_Divide_by_Zero__float_fgets_17-bad
CWE369_Divide_by_Zero__float_fgets_17_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i128 %rax.0.reg2mem = alloca i64 %sv_0.0.in.reg2mem = alloca i64 %1 = load i128, i128* %0 %2 = load i128, i128* %0 %sv_1 = alloca i64, align 8 %3 = call i64 @FUNC(i64 40) %4 = call i128 @FUNC(i128 %2, i128 %2) %5 = call i64 @FUNC(i128 %4) %6 = bitcast i64* %sv_1 to i8* %7 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %8 = call i8* @fgets(i8* nonnull %6, i32 20, %_IO_FILE* %7) %9 = icmp eq i8* %8, null br i1 %9, label LBL_2, label LBL_1 LBL_1: %10 = call double @atof(i8* nonnull %6) %11 = fptrunc double %10 to float %12 = bitcast float %11 to i32 %13 = sext i32 %12 to i128 %14 = call i128 @FUNC(i128 %13) %15 = call i64 @FUNC(i128 %14) store i64 %15, i64* %sv_0.0.in.reg2mem br label LBL_3 LBL_2: %16 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64)) store i64 %5, i64* %sv_0.0.in.reg2mem br label LBL_3 LBL_3: %sv_0.0.in.reload = load i64, i64* %sv_0.0.in.reg2mem %sv_0.0 = trunc i64 %sv_0.0.in.reload to i32 %17 = call i128 @FUNC(i128 %1, i128 %1) %18 = call i128 @FUNC(i32 %sv_0.0) %19 = call i128 @FUNC(i64 4636737291354636288) %20 = call i128 @FUNC(i128 %19, i128 %18) %21 = call i32 @FUNC(i128 %20) %22 = zext i32 %21 to i64 %23 = call i64 @FUNC(i64 %22) %24 = call i64 @FUNC(i64 40) %25 = icmp eq i64 %3, %24 store i64 0, i64* %rax.0.reg2mem br i1 %25, 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.0.in.reg2mem, { 0, 2, 1 } uselistorder i128* %0, { 1, 0 } }
1
juliet-test-suite-c
CWE758_Undefined_Behavior__char_pointer_alloca_use_14-bad
CWE758_Undefined_Behavior__char_pointer_alloca_use_14_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 16404 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, -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
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_alloca_memmove_08-bad
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_alloca_memmove_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 %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_1 to i64 %5 = add i64 %4, -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_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* @memmove(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 } }
1
juliet-test-suite-c
CWE190_Integer_Overflow__char_fscanf_postinc_08-good
goodG2B2
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 = trunc i64 %0 to i32 %5 = icmp eq i32 %4, 0 %spec.select = select i1 %5, i64 33, i64 3 %6 = call i64 @FUNC(i64 %spec.select) 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)* @printHexCharLine, { 3, 2, 1, 0 } uselistorder i64 3, { 1, 0 } uselistorder i64 33, { 1, 0 } uselistorder i64 ()* @staticReturnsTrue, { 5, 4, 3, 2, 1, 0 } }
0
juliet-test-suite-c
CWE126_Buffer_Overread__CWE129_connect_socket_02-bad
CWE126_Buffer_Overread__CWE129_connect_socket_02_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 = call i32 @socket(i32 2, i32 1, i32 6) %2 = icmp eq i32 %1, -1 br i1 %2, label LBL_1, label LBL_2 LBL_1: store i64 0, i64* %sv_1, align 8 br label LBL_7 LBL_2: %3 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16) store i64 2, i64* %sv_1, align 8 %4 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0)) %5 = call i16 @htons(i16 27015) %6 = bitcast i64* %sv_1 to %sockaddr* %7 = call i32 @connect(i32 %1, %sockaddr* nonnull %6, i32 16) %8 = icmp eq i32 %7, -1 br i1 %8, label LBL_14, label LBL_3 LBL_3: %9 = call i32 @recv(i32 %1, i64* nonnull %sv_0, i32 13, i32 0) %10 = add i32 %9, 1 %11 = icmp ult i32 %10, 2 br i1 %11, label LBL_14, label LBL_5 LBL_4: %12 = call i32 @close(i32 %1) store i64 0, i64* %sv_1, align 8 br label LBL_7 LBL_5: %13 = ptrtoint i64* %sv_2 to i64 %14 = sext i32 %9 to i64 %15 = add i64 %13, -22 %16 = add i64 %15, %14 %17 = inttoptr i64 %16 to i8* store i8 0, i8* %17, align 1 %18 = bitcast i64* %sv_0 to i8* %19 = call i32 @atoi(i8* nonnull %18) %20 = call i32 @close(i32 %1) store i64 0, i64* %sv_1, align 8 %21 = icmp slt i32 %19, 0 br i1 %21, label LBL_7, label LBL_6 LBL_6: %22 = sext i32 %19 to i64 %23 = mul i64 %22, 4 %24 = add i64 %13, -64 %25 = add i64 %24, %23 %26 = inttoptr i64 %25 to i32* %27 = load i32, i32* %26, align 4 %28 = zext i32 %27 to i64 %29 = call i64 @FUNC(i64 %28) br label LBL_8 LBL_7: %30 = call i64 @FUNC(i64 ptrtoint ([31 x i8]* @gv_1 to i64)) br label LBL_8 LBL_8: %31 = call i64 @FUNC(i64 40) %32 = icmp eq i64 %0, %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 %19, { 1, 0 } uselistorder i64 %13, { 1, 0 } uselistorder i32 %9, { 1, 0 } uselistorder i32 %1, { 3, 0, 1, 2, 4 } uselistorder i64* %sv_1, { 4, 0, 2, 5, 3, 1 } uselistorder i32 (i32)* @close, { 1, 0, 2 } uselistorder label LBL_7, { 2, 0, 1 } }
1
juliet-test-suite-c
CWE194_Unexpected_Sign_Extension__listen_socket_memcpy_17-bad
CWE194_Unexpected_Sign_Extension__listen_socket_memcpy_17_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0811.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 = add i64 %0, -112 %3 = call i32 @socket(i32 2, i32 1, i32 6) %4 = icmp eq i32 %3, -1 store i32 0, i32* %sv_0.0811.reg2mem br i1 %4, label LBL_9, label LBL_1 LBL_1: %5 = bitcast i64* %sv_3 to %sockaddr* %6 = call i64* @memset(i64* nonnull %sv_3, i32 0, i32 16) store i64 2, i64* %sv_3, align 8 %7 = call i16 @htons(i16 27015) %8 = call i32 @bind(i32 %3, %sockaddr* nonnull %5, i32 16) %9 = icmp eq i32 %8, -1 br i1 %9, label LBL_7, label LBL_2 LBL_2: %10 = call i32 @listen(i32 %3, i32 5) %11 = icmp eq i32 %10, -1 br i1 %11, label LBL_7, label LBL_3 LBL_3: %12 = call i32 @accept(i32 %3, %sockaddr* null, i32* null) %13 = icmp eq i32 %12, -1 br i1 %13, label LBL_7, label LBL_4 LBL_4: %14 = call i32 @recv(i32 %12, i64* nonnull %sv_2, i32 7, i32 0) %15 = add i32 %14, 1 %16 = icmp ult i32 %15, 2 store i32 0, i32* %sv_0.0.ph.reg2mem br i1 %16, label LBL_8, label LBL_5 LBL_5: %17 = bitcast i64* %sv_2 to i8* %18 = sext i32 %14 to i64 %19 = add i64 %2, %18 %20 = inttoptr i64 %19 to i8* store i8 0, i8* %20, align 1 %21 = call i32 @atoi(i8* nonnull %17) %.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_6, label LBL_8 LBL_6: %sext3 = mul i32 %21, 65536 %23 = ashr exact i32 %sext3, 16 store i32 %23, i32* %sv_0.0.ph.reg2mem br label LBL_8 LBL_7: %24 = call i32 @close(i32 %3) store i32 0, i32* %sv_0.0811.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.0811.reg2mem br label LBL_9 LBL_9: %sv_0.0811.reload = load i32, i32* %sv_0.0811.reg2mem store i64 0, i64* %sv_2, align 8 %27 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99) %28 = trunc i32 %sv_0.0811.reload to i16 %29 = icmp sgt i16 %28, 99 br i1 %29, label LBL_11, label LBL_10 LBL_10: %30 = call i64* @memcpy(i64* nonnull %sv_2, i64* nonnull %sv_1, i32 %sv_0.0811.reload) %31 = sext i32 %sv_0.0811.reload to i64 %32 = add i64 %2, %31 %33 = inttoptr i64 %32 to i8* store i8 0, i8* %33, align 1 br label LBL_11 LBL_11: %34 = call i64 @FUNC(i64* nonnull %sv_2) %35 = call i64 @FUNC(i64 40) %36 = icmp eq i64 %1, %35 store i64 0, i64* %rax.0.reg2mem br i1 %36, label LBL_13, label LBL_12 LBL_12: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_13 LBL_13: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %sv_0.0811.reload, { 1, 2, 0 } uselistorder i32 %14, { 1, 0 } uselistorder i32 %3, { 4, 0, 1, 2, 3, 5 } uselistorder i64* %sv_3, { 2, 1, 0 } uselistorder i64* %sv_2, { 0, 1, 4, 2, 3 } uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 3, 1 } uselistorder i32* %sv_0.0811.reg2mem, { 0, 3, 2, 1 } uselistorder i32 (i32)* @close, { 2, 1, 0, 3 } uselistorder i8 0, { 1, 0, 2 } uselistorder label LBL_8, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE190_Integer_Overflow__int_fgets_multiply_17-bad
CWE190_Integer_Overflow__int_fgets_multiply_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) %1 = bitcast i64* %sv_0 to i8* store i64 0, i64* %sv_0, align 8 %2 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %3 = call i8* @fgets(i8* nonnull %1, i32 14, %_IO_FILE* %2) %4 = icmp eq i8* %3, null br i1 %4, label LBL_1, label LBL_2 LBL_1: %5 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64)) br label LBL_4 LBL_2: %6 = call i32 @atoi(i8* nonnull %1) %7 = icmp slt i32 %6, 1 br i1 %7, label LBL_4, label LBL_3 LBL_3: %8 = mul i32 %6, 2 %9 = zext i32 %8 to i64 %10 = call i64 @FUNC(i64 %9) br label LBL_4 LBL_4: %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %0, %11 store i64 0, i64* %rax.0.reg2mem br i1 %12, 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* %sv_0, { 1, 0 } uselistorder label LBL_4, { 2, 1, 0 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_int_alloca_memmove_14-bad
CWE121_Stack_Based_Buffer_Overflow__CWE805_int_alloca_memmove_14_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i64 %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %1 = load i64, i64* %0 %sv_1 = alloca i64, align 8 %2 = ptrtoint i64* %sv_1 to i64 %3 = call i64 @FUNC(i64 40) %4 = add i64 %2, -193 %5 = and i64 %4, -16 %6 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %7 = icmp eq i32 %6, 5 %8 = icmp eq i1 %7, false %spec.select = select i1 %8, i64 %1, i64 %5 %9 = bitcast i64* %sv_0 to i8* call void @FUNC(i8* nonnull %9, i64 0, i64 50) %10 = inttoptr i64 %spec.select to i64* %11 = call i64* @memmove(i64* %10, i64* nonnull %sv_0, i32 400) %12 = inttoptr i64 %spec.select to i32* %13 = load i32, i32* %12, align 4 %14 = zext i32 %13 to i64 %15 = call i64 @FUNC(i64 %14) %16 = call i64 @FUNC(i64 40) %17 = icmp eq i64 %3, %16 store i64 0, i64* %rax.0.reg2mem br i1 %17, 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 }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_ncat_14-bad
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_ncat_14_bad
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 %6 = icmp eq i1 %5, false br i1 %6, label LBL_2.LBL_5_crit_edge, label LBL_4 LBL_3: %.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 99) %8 = ptrtoint i64* %1 to i64 %9 = add i64 %8, 99 %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 = bitcast i64* %sv_0 to i8* %14 = call i8* @strncat(i8* nonnull %13, i8* %11, i32 %12) %15 = call i64 @FUNC(i64 %.pre-phi.reload) call void @free(i64* %1) %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 i8* %11, { 1, 0 } uselistorder i64* %1, { 1, 5, 2, 3, 0, 4 } uselistorder label LBL_5, { 1, 0 } }
1
juliet-test-suite-c
CWE253_Incorrect_Check_of_Function_Return_Value__char_puts_17-bad
CWE253_Incorrect_Check_of_Function_Return_Value__char_puts_17_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i32 @puts(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @gv_0, i64 0, i64 0)) %1 = sext i32 %0 to i64 %2 = icmp eq i32 %0, 0 %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 ptrtoint ([13 x i8]* @gv_1 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 uselistorder label LBL_2, { 1, 0 } }
1
juliet-test-suite-c
CWE194_Unexpected_Sign_Extension__connect_socket_strncpy_31-bad
CWE194_Unexpected_Sign_Extension__connect_socket_strncpy_31_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.010.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 i32 @socket(i32 2, i32 1, i32 6) %3 = icmp eq i32 %2, -1 store i32 0, i32* %sv_0.010.reg2mem br i1 %3, label LBL_6, label LBL_1 LBL_1: %4 = call i64* @memset(i64* nonnull %sv_3, i32 0, i32 16) store i64 2, i64* %sv_3, 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_3 to %sockaddr* %8 = call i32 @connect(i32 %2, %sockaddr* nonnull %7, i32 16) %9 = icmp eq i32 %8, -1 store i32 0, i32* %sv_0.0.ph.reg2mem br i1 %9, label LBL_5, label LBL_2 LBL_2: %10 = call i32 @recv(i32 %2, i64* nonnull %sv_2, i32 7, i32 0) %11 = add i32 %10, 1 %12 = icmp ult i32 %11, 2 store i32 0, i32* %sv_0.0.ph.reg2mem br i1 %12, label LBL_5, label LBL_3 LBL_3: %13 = sext i32 %10 to i64 %14 = add i64 %0, -112 %15 = add i64 %14, %13 %16 = inttoptr i64 %15 to i8* store i8 0, i8* %16, align 1 %17 = bitcast i64* %sv_2 to i8* %18 = call i32 @atoi(i8* nonnull %17) %.off = add i32 %18, 32768 %19 = icmp ult i32 %.off, 65536 store i32 -1, i32* %sv_0.0.ph.reg2mem br i1 %19, label LBL_4, label LBL_5 LBL_4: %sext5 = mul i32 %18, 65536 %20 = ashr exact i32 %sext5, 16 store i32 %20, i32* %sv_0.0.ph.reg2mem br label LBL_5 LBL_5: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %21 = call i32 @close(i32 %2) store i32 %sv_0.0.ph.reload, i32* %sv_0.010.reg2mem br label LBL_6 LBL_6: %sv_0.010.reload = load i32, i32* %sv_0.010.reg2mem %22 = trunc i32 %sv_0.010.reload to i16 store i64 0, i64* %sv_2, align 8 %23 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99) %24 = icmp sgt i16 %22, 99 br i1 %24, label LBL_8, label LBL_7 LBL_7: %25 = bitcast i64* %sv_2 to i8* %26 = bitcast i64* %sv_1 to i8* %27 = call i8* @strncpy(i8* nonnull %25, i8* nonnull %26, i32 %sv_0.010.reload) %28 = sext i32 %sv_0.010.reload to i64 %29 = add i64 %0, -112 %30 = add i64 %29, %28 %31 = inttoptr i64 %30 to i8* store i8 0, i8* %31, align 1 br label LBL_8 LBL_8: %32 = call i64 @FUNC(i64* nonnull %sv_2) %33 = call i64 @FUNC(i64 40) %34 = icmp eq i64 %1, %33 store i64 0, i64* %rax.0.reg2mem br i1 %34, 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.010.reload, { 1, 2, 0 } uselistorder i32 %10, { 1, 0 } uselistorder i32 %2, { 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.010.reg2mem, { 0, 2, 1 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } uselistorder label LBL_6, { 1, 0 } uselistorder label LBL_5, { 2, 0, 3, 1 } }
1
juliet-test-suite-c
CWE789_Uncontrolled_Mem_Alloc__malloc_char_listen_socket_02-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %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 br i1 %2, label LBL_11, 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 25, 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, -48 %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 @strtoul(i8* nonnull %20, i8** null, i32 0) store i32 %21, i32* %sv_0.0.ph.reg2mem br label LBL_7 LBL_6: %22 = call i32 @close(i32 %1) br label LBL_11 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) %sv_0.0.off = add i32 %sv_0.0.ph.reload, -6 %25 = icmp ult i32 %sv_0.0.off, 94 br i1 %25, label LBL_8, label LBL_11 LBL_8: %26 = call i64* @malloc(i32 %sv_0.0.ph.reload) %27 = icmp eq i64* %26, null %28 = icmp eq i1 %27, false br i1 %28, label LBL_10, label LBL_9 LBL_9: call void @exit(i32 -1) unreachable LBL_10: %29 = ptrtoint i64* %26 to i64 %30 = bitcast i64* %26 to i32* store i32 1819043176, i32* %30, align 4 %31 = add i64 %29, 4 %32 = inttoptr i64 %31 to i16* store i16 111, i16* %32, align 2 %33 = call i64 @FUNC(i64 %29) call void @free(i64* %26) br label LBL_12 LBL_11: %34 = call i64 @FUNC(i64 ptrtoint ([64 x i8]* @gv_0 to i64)) br label LBL_12 LBL_12: %35 = call i64 @FUNC(i64 40) %36 = icmp eq i64 %0, %35 store i64 0, i64* %rax.0.reg2mem br i1 %36, label LBL_14, label LBL_13 LBL_13: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_14 LBL_14: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %26, { 0, 1, 3, 2 } 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 label LBL_11, { 2, 1, 0 } uselistorder label LBL_7, { 1, 0 } }
0
juliet-test-suite-c
CWE369_Divide_by_Zero__int_connect_socket_divide_17-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.048.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 -1, i32* %sv_0.048.reg2mem br i1 %2, label LBL_5, label LBL_1 LBL_1: %3 = bitcast i64* %sv_2 to %sockaddr* %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 = call i32 @connect(i32 %1, %sockaddr* nonnull %3, i32 16) %8 = icmp eq i32 %7, -1 br i1 %8, label LBL_3, label LBL_2 LBL_2: %9 = call i32 @recv(i32 %1, i64* nonnull %sv_1, i32 13, i32 0) %10 = add i32 %9, 1 %11 = icmp ult i32 %10, 2 br i1 %11, label LBL_3, label LBL_4 LBL_3: %12 = call i32 @close(i32 %1) store i32 -1, i32* %sv_0.048.reg2mem br label LBL_5 LBL_4: %13 = ptrtoint i64* %sv_3 to i64 %14 = add i64 %13, -22 %15 = bitcast i64* %sv_1 to i8* %16 = sext i32 %9 to i64 %17 = add i64 %14, %16 %18 = inttoptr i64 %17 to i8* store i8 0, i8* %18, align 1 %19 = call i32 @atoi(i8* nonnull %15) %20 = call i32 @close(i32 %1) %21 = icmp eq i32 %19, 0 store i32 %19, i32* %sv_0.048.reg2mem br i1 %21, label LBL_6, label LBL_5 LBL_5: %sv_0.048.reload = load i32, i32* %sv_0.048.reg2mem %22 = udiv i32 100, %sv_0.048.reload %23 = zext i32 %22 to i64 %24 = call i64 @FUNC(i64 %23) br label LBL_7 LBL_6: %25 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_1 to i64)) br label LBL_7 LBL_7: %26 = call i64 @FUNC(i64 40) %27 = icmp eq i64 %0, %26 store i64 0, i64* %rax.0.reg2mem br i1 %27, 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 %9, { 1, 0 } uselistorder i32 %1, { 3, 0, 1, 2, 4 } uselistorder i64* %sv_2, { 2, 1, 0 } uselistorder i32* %sv_0.048.reg2mem, { 0, 3, 2, 1 } uselistorder i32 (i32)* @close, { 1, 0, 2 } uselistorder i32 -1, { 1, 2, 0, 3 } uselistorder label LBL_7, { 1, 0 } uselistorder label LBL_5, { 2, 1, 0 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__src_char_declare_cpy_17-bad
CWE121_Stack_Based_Buffer_Overflow__src_char_declare_cpy_17_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 = ptrtoint i64* %sv_1 to i64 %2 = add i64 %1, 99 %3 = inttoptr i64 %2 to i8* %4 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99) store i8 0, i8* %3, align 1 %5 = bitcast i64* %sv_1 to i8* store i64 0, i64* %sv_0, align 8 %6 = bitcast i64* %sv_0 to i8* %7 = call i8* @strcpy(i8* nonnull %6, i8* nonnull %5) %8 = call i64 @FUNC(i64 %1) %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %0, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, 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* %sv_1, { 2, 1, 0 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_declare_ncat_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 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 49) %3 = add i64 %1, 49 %4 = inttoptr i64 %3 to i8* store i8 0, i8* %4, align 1 store i64 0, i64* %sv_0, align 8 %5 = bitcast i64* %sv_1 to i8* %6 = call i32 @strlen(i8* nonnull %5) %7 = bitcast i64* %sv_0 to i8* %8 = call i8* @strncat(i8* nonnull %7, i8* nonnull %5, i32 %6) %9 = call i64 @FUNC(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_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* (i8*, i8*, i32)* @strncat, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__int_fscanf_add_10-bad
CWE190_Integer_Overflow__int_fscanf_add_10_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 = 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), i64* nonnull %sv_0) %.pr = load i32, i32* @gv_0, align 4 %5 = icmp eq i32 %.pr, 0 br i1 %5, label LBL_3, label LBL_2 LBL_2: %6 = load i64, i64* %sv_0, align 8 %7 = add i64 %6, 1 %8 = and i64 %7, 4294967295 %9 = call i64 @FUNC(i64 %8) 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 i64* %sv_0, { 1, 0, 2 } uselistorder label LBL_3, { 1, 2, 0 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_cpy_14-bad
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_cpy_14_bad
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 %3 = icmp eq i1 %2, false store i8* null, i8** %sv_0.0.reg2mem br i1 %3, label LBL_3, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 10) %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_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %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_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
CWE124_Buffer_Underwrite__CWE839_connect_socket_04-bad
CWE124_Buffer_Underwrite__CWE839_connect_socket_04_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %sv_0.045.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.045.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_16, 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_16, 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.045.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.045.reg2mem br i1 %21, label LBL_8, label LBL_6 LBL_6: %sv_0.045.reload = load i32, i32* %sv_0.045.reg2mem %22 = sext i32 %sv_0.045.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.045.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
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_alloca_memmove_32-bad
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_alloca_memmove_32_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 = add i64 %0, -17 %3 = and i64 %2, -16 %4 = inttoptr i64 %3 to i8* store i8 0, i8* %4, align 16 store i64 %3, i64* %sv_1, align 8 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 = inttoptr i64 %3 to i64* %9 = call i64* @memmove(i64* %8, i64* nonnull %sv_0, i32 %7) %10 = call i64 @FUNC(i64 %3) %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %1, %11 store i64 0, i64* %rax.0.reg2mem br i1 %12, 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, 2, 3 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_loop_14-good
goodG2B2
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 %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_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 = ptrtoint i64* %4 to i64 %8 = bitcast i64* %4 to i8* store i8 0, i8* %8, align 1 store i64 %7, i64* %sv_0.0.reg2mem br label LBL_4 LBL_4: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %9 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99) %10 = ptrtoint i64* %sv_1 to i64 store i64 0, i64* %storemerge1.reg2mem br label LBL_5 LBL_5: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %11 = add i64 %storemerge1.reload, %sv_0.0.reload %12 = add i64 %storemerge1.reload, %10 %13 = inttoptr i64 %12 to i8* %14 = load i8, i8* %13, align 1 %15 = inttoptr i64 %11 to i8* store i8 %14, i8* %15, align 1 %16 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %16, 100 store i64 %16, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_6, label LBL_5 LBL_6: %17 = add i64 %sv_0.0.reload, 99 %18 = inttoptr i64 %17 to i8* store i8 0, i8* %18, align 1 %19 = call i64 @FUNC(i64 %sv_0.0.reload) %20 = inttoptr i64 %sv_0.0.reload to i64* call void @free(i64* %20) %21 = call i64 @FUNC(i64 40) %22 = icmp eq i64 %0, %21 store i64 0, i64* %rax.0.reg2mem br i1 %22, 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 %storemerge1.reload, { 0, 2, 1 } uselistorder i64 %sv_0.0.reload, { 1, 2, 0, 3 } uselistorder i64* %4, { 0, 2, 1 } uselistorder i64* %sv_1, { 1, 0 } uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder void (i32)* @exit, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE681_Incorrect_Conversion_Between_Numeric_Types__doubleNaN2int_05-bad
CWE681_Incorrect_Conversion_Between_Numeric_Types__doubleNaN2int_05_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i128 %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %1 = load i128, i128* %0 %sv_1 = alloca i64, align 8 %2 = call i64 @FUNC(i64 40) %3 = load i32, i32* @gv_0, align 4 %4 = icmp eq i32 %3, 0 br i1 %4, label LBL_5, label LBL_1 LBL_1: %5 = call i128 @FUNC(i128 %1, i128 %1) %6 = call i64 @FUNC(i128 %5) %7 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %8 = bitcast i64* %sv_1 to i8* %9 = call i8* @fgets(i8* nonnull %8, i32 256, %_IO_FILE* %7) %10 = icmp eq i8* %9, null br i1 %10, label LBL_3, label LBL_2 LBL_2: %11 = call double @atof(i8* nonnull %8) %12 = fptrunc double %11 to float %13 = bitcast float %12 to i32 %14 = sext i32 %13 to i128 %15 = call i64 @FUNC(i128 %14) store i64 %15, i64* %sv_0.0.reg2mem br label LBL_4 LBL_3: %16 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_2 to i64)) store i64 %6, i64* %sv_0.0.reg2mem br label LBL_4 LBL_4: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %17 = call i128 @__asm_movq.1(i64 %sv_0.0.reload) %18 = trunc i128 %17 to i64 %19 = bitcast i64 %18 to double %20 = call double @sqrt(double %19) %21 = fptrunc double %20 to float %22 = bitcast float %21 to i32 %23 = sext i32 %22 to i128 %24 = call i32 @FUNC(i128 %23) %25 = zext i32 %24 to i64 %26 = call i64 @FUNC(i64 %25) br label LBL_5 LBL_5: %27 = call i64 @FUNC(i64 40) %28 = icmp eq i64 %2, %27 store i64 0, i64* %rax.0.reg2mem br i1 %28, 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* %sv_0.0.reg2mem, { 0, 2, 1 } uselistorder %_IO_FILE** @gv_1, { 1, 0 } }
1
juliet-test-suite-c
CWE457_Use_of_Uninitialized_Variable__int_pointer_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 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_5 LBL_2: %4 = call i64* @malloc(i32 4) %5 = icmp eq i64* %4, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_4, label LBL_3 LBL_3: call void @exit(i32 -1) unreachable LBL_4: %7 = bitcast i64* %4 to i32* store i32 5, i32* %7, align 4 store i32* %7, i32** %sv_0.0.reg2mem br label LBL_5 LBL_5: %8 = call i64 @FUNC() %9 = trunc i64 %8 to i32 %10 = icmp eq i32 %9, 0 store i64 %8, i64* %rax.0.reg2mem br i1 %10, label LBL_7, label LBL_6 LBL_6: %sv_0.0.reload = load i32*, i32** %sv_0.0.reg2mem %11 = load i32, i32* %sv_0.0.reload, align 4 %12 = zext i32 %11 to i64 %13 = call i64 @FUNC(i64 %12) store i64 %13, 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* %4, { 1, 0 } uselistorder i64 ()* @globalReturnsFalse, { 1, 0 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__int_fscanf_postinc_14-bad
CWE190_Integer_Overflow__int_fscanf_postinc_14_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 = load i32, i32* inttoptr (i64 16404 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 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_0) br label LBL_2 LBL_2: %6 = load i32, i32* @gv_2, align 4 %7 = icmp eq i32 %6, 5 %8 = icmp eq i1 %7, false br i1 %8, label LBL_4, label LBL_3 LBL_3: %9 = load i64, i64* %sv_0, align 8 %10 = mul i64 %9, 4294967296 %sext = add i64 %10, 4294967296 %11 = ashr exact i64 %sext, 32 store i64 %11, i64* %sv_0, align 8 %12 = and i64 %11, 4294967295 %13 = call i64 @FUNC(i64 %12) br label LBL_4 LBL_4: %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* %sv_0, { 1, 2, 0, 3 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_int64_t_loop_07-good
goodG2B2
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* @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 ptrtoint (i32* @gv_1 to i32)) %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 %9 = bitcast i64* %sv_1 to i8* call void @FUNC(i8* nonnull %9, i64 0, i64 100) %10 = add i64 %8, -816 store i64 0, i64* %storemerge1.reg2mem br label LBL_4 LBL_4: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %11 = mul i64 %storemerge1.reload, 8 %12 = add i64 %11, %sv_0.0.reload %13 = add i64 %10, %11 %14 = inttoptr i64 %13 to i64* %15 = load i64, i64* %14, align 8 %16 = inttoptr i64 %12 to i64* store i64 %15, i64* %16, align 8 %17 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %17, 100 store i64 %17, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_5, label LBL_4 LBL_5: %18 = inttoptr i64 %sv_0.0.reload to i64* %19 = load i64, i64* %18, align 8 %20 = call i64 @FUNC(i64 %19) call void @free(i64* %18) %21 = call i64 @FUNC(i64 40) %22 = icmp eq i64 %0, %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* %storemerge1.reg2mem, { 1, 0, 2 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i64 (i64)* @printLongLongLine, { 1, 0 } uselistorder i64 100, { 0, 2, 1, 3 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } uselistorder i32* @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE194_Unexpected_Sign_Extension__rand_strncpy_14-bad
CWE194_Unexpected_Sign_Extension__rand_strncpy_14_bad
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 %sv_2 = alloca i64, align 8 %sv_3 = 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 i32 0, i32* %sv_0.0.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = call i32 @rand() %5 = urem i32 %4, 2 %6 = icmp eq i32 %5, 0 %7 = call i32 @rand() %8 = call i32 @rand() %9 = mul i32 %8, 32768 %10 = call i32 @rand() %11 = xor i32 %10, %9 %12 = sext i1 %6 to i32 %storemerge.in = xor i32 %11, %12 %sext = mul i32 %storemerge.in, 65536 %13 = ashr exact i32 %sext, 16 store i32 %13, i32* %sv_0.0.reg2mem br label LBL_2 LBL_2: %sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem store i64 0, i64* %sv_2, align 8 %14 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99) %15 = trunc i32 %sv_0.0.reload to i16 %16 = icmp sgt i16 %15, 99 br i1 %16, label LBL_4, label LBL_3 LBL_3: %17 = ptrtoint i64* %sv_3 to i64 %18 = bitcast i64* %sv_2 to i8* %19 = bitcast i64* %sv_1 to i8* %20 = call i8* @strncpy(i8* nonnull %18, i8* nonnull %19, i32 %sv_0.0.reload) %21 = sext i32 %sv_0.0.reload to i64 %22 = add i64 %17, -128 %23 = add i64 %22, %21 %24 = inttoptr i64 %23 to i8* store i8 0, i8* %24, align 1 br label LBL_4 LBL_4: %25 = call i64 @FUNC(i64* nonnull %sv_2) %26 = call i64 @FUNC(i64 40) %27 = icmp eq i64 %0, %26 store i64 0, i64* %rax.0.reg2mem br i1 %27, 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 i32 %sv_0.0.reload, { 1, 2, 0 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__CWE135_09-bad
CWE122_Heap_Based_Buffer_Overflow__CWE135_09_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %sv_0 = alloca i32*, align 8 %0 = call i64* @malloc(i32 200) %1 = bitcast i64* %0 to i32* store i32* %1, i32** %sv_0, align 8 %2 = icmp eq i64* %0, 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 = call i32* @wmemset(i32* %1, i32 65, i32 49) %5 = ptrtoint i64* %0 to i64 %6 = add i64 %5, 196 %7 = inttoptr i64 %6 to i32* store i32 0, i32* %7, align 4 %8 = load i32*, i32** %sv_0, align 8 %9 = bitcast i32* %8 to i8* %10 = call i32 @strlen(i8* %9) %11 = add i32 %10, 1 %12 = call i64* @calloc(i32 %11, i32 4) %13 = icmp eq i64* %12, null %14 = icmp eq i1 %13, false br i1 %14, label LBL_4, label LBL_3 LBL_3: call void @exit(i32 -1) unreachable LBL_4: %15 = bitcast i64* %12 to i32* %16 = call i32* @wcscpy(i32* %15, i32* %8) %17 = ptrtoint i64* %12 to i64 %18 = call i64 @FUNC(i64 %17) call void @free(i64* %12) ret i64 ptrtoint (i32* @1 to i64) uselistorder i64* %12, { 1, 0, 3, 2 } }
1
juliet-test-suite-c
CWE190_Integer_Overflow__int_max_add_13-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load i32, i32* inttoptr (i64 8420 to i32*), align 4 %1 = icmp eq i32 %0, 5 %2 = icmp eq i1 %1, false br i1 %2, label LBL_1, label LBL_2 LBL_1: %3 = call i64 @FUNC(i64 1) store i64 %3, i64* %rax.0.reg2mem br label LBL_3 LBL_2: %4 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_0 to i64)) store i64 %4, 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 i64* %rax.0.reg2mem, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE401_Memory_Leak__struct_twoIntsStruct_calloc_07-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64* %.reg2mem = alloca i32 %0 = load i32, i32* @gv_0, align 4 %1 = icmp eq i32 %0, 5 %2 = icmp eq i1 %1, false store i32 %0, i32* %.reg2mem store i64* null, i64** %sv_0.0.reg2mem br i1 %2, label LBL_4, label LBL_1 LBL_1: %3 = call i64* @calloc(i32 100, i32 8) %4 = icmp eq i64* %3, null %5 = icmp eq i1 %4, false br i1 %5, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %6 = ptrtoint i64* %3 to i64 %7 = bitcast i64* %3 to i32* store i32 0, i32* %7, align 4 %8 = add i64 %6, 4 %9 = inttoptr i64 %8 to i32* store i32 0, i32* %9, align 4 %10 = call i64 @FUNC(i64 %6) %.pre = load i32, i32* @gv_0, align 4 store i32 %.pre, i32* %.reg2mem store i64* %3, i64** %sv_0.0.reg2mem br label LBL_4 LBL_4: %.reload = load i32, i32* %.reg2mem %11 = zext i32 %.reload to i64 %12 = icmp eq i32 %.reload, 5 %13 = icmp eq i1 %12, false store i64 %11, i64* %rax.0.reg2mem br i1 %13, label LBL_6, label LBL_5 LBL_5: %sv_0.0.reload = load i64*, i64** %sv_0.0.reg2mem call void @free(i64* %sv_0.0.reload) 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* %3, { 0, 1, 3, 2 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i64* (i32, i32)* @calloc, { 1, 0, 2 } uselistorder i64* null, { 2, 0, 3, 1 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__src_char_declare_cpy_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 = bitcast i64* %sv_0 to i8* %7 = call i8* @strcpy(i8* nonnull %6, i8* nonnull %1) %8 = call i64 @FUNC(i64 %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_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 }
0
juliet-test-suite-c
CWE400_Resource_Exhaustion__connect_socket_fwrite_31-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge11.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 = call i32 @socket(i32 2, i32 1, i32 6) %2 = icmp eq i32 %1, -1 br i1 %2, label LBL_12, label LBL_1 LBL_1: %3 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16) store i64 2, i64* %sv_1, align 8 %4 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0)) %5 = call i16 @htons(i16 27015) %6 = bitcast i64* %sv_1 to %sockaddr* %7 = call i32 @connect(i32 %1, %sockaddr* nonnull %6, i32 16) %8 = icmp eq i32 %7, -1 br i1 %8, label LBL_3, label LBL_2 LBL_2: %9 = call i32 @recv(i32 %1, i64* nonnull %sv_0, i32 13, i32 0) %10 = add i32 %9, 1 %11 = icmp ult i32 %10, 2 br i1 %11, label LBL_3, label LBL_4 LBL_3: %12 = call i32 @close(i32 %1) br label LBL_12 LBL_4: %13 = ptrtoint i64* %sv_2 to i64 %14 = sext i32 %9 to i64 %15 = add i64 %13, -22 %16 = add i64 %15, %14 %17 = inttoptr i64 %16 to i8* store i8 0, i8* %17, align 1 %18 = bitcast i64* %sv_0 to i8* %19 = call i32 @atoi(i8* nonnull %18) %20 = call i32 @close(i32 %1) %sv_3.0.off = add i32 %19, -1 %21 = icmp ugt i32 %sv_3.0.off, 19 br i1 %21, label LBL_12, label LBL_5 LBL_5: %22 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @gv_1, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0)) %23 = icmp eq %_IO_FILE* %22, null %24 = icmp eq i1 %23, false br i1 %24, label LBL_6, label LBL_7 LBL_6: %25 = sext i32 %19 to i64 store i64 0, i64* %storemerge11.reg2mem br label LBL_8 LBL_7: call void @exit(i32 1) unreachable LBL_8: %26 = call i32 @fwrite(i64* bitcast ([51 x i8]* @gv_3 to i64*), i32 1, i32 50, %_IO_FILE* %22) %27 = icmp eq i32 %26, 50 br i1 %27, label LBL_10, label LBL_9 LBL_9: call void @exit(i32 1) unreachable LBL_10: %storemerge11.reload = load i64, i64* %storemerge11.reg2mem %28 = add nuw i64 %storemerge11.reload, 1 %29 = icmp ult i64 %28, %25 store i64 %28, i64* %storemerge11.reg2mem br i1 %29, label LBL_8, label LBL_11 LBL_11: %30 = call i32 @fclose(%_IO_FILE* nonnull %22) br label LBL_12 LBL_12: %31 = call i64 @FUNC(i64 40) %32 = icmp eq i64 %0, %31 store i64 0, i64* %rax.0.reg2mem br i1 %32, label LBL_14, label LBL_13 LBL_13: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_14 LBL_14: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder %_IO_FILE* %22, { 1, 0, 2 } uselistorder i32 %19, { 1, 0 } uselistorder i32 %9, { 1, 0 } uselistorder i32 %1, { 3, 0, 1, 2, 4 } uselistorder i64* %sv_1, { 0, 2, 1 } uselistorder i64* %storemerge11.reg2mem, { 1, 0, 2 } uselistorder i32 (%_IO_FILE*)* @fclose, { 1, 0, 2 } uselistorder i32 (i64*, i32, i32, %_IO_FILE*)* @fwrite, { 1, 0, 2 } uselistorder void (i32)* @exit, { 0, 3, 1, 2, 4 } uselistorder i32 (i32)* @close, { 1, 0, 2 } uselistorder label LBL_12, { 2, 3, 1, 0 } uselistorder label LBL_8, { 1, 0 } }
0
juliet-test-suite-c
CWE134_Uncontrolled_Format_String__char_connect_socket_fprintf_14-good
goodB2G2
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 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false br i1 %3, label LBL_9, label LBL_1 LBL_1: %4 = bitcast i64* %sv_1 to i8* %5 = call i32 @strlen(i8* nonnull %4) %6 = call i32 @socket(i32 2, i32 1, i32 6) %cond = icmp eq i32 %6, -1 br i1 %cond, label LBL_9, 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_1, 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_8, label LBL_3 LBL_3: %13 = sext i32 %5 to i64 %14 = ptrtoint i64* %sv_1 to i64 %15 = add i64 %13, %14 %16 = inttoptr i64 %15 to i64* %17 = sub i32 99, %5 %18 = call i32 @recv(i32 %6, i64* %16, i32 %17, i32 0) %19 = add i32 %18, 1 %20 = icmp ult i32 %19, 2 br i1 %20, label LBL_8, label LBL_4 LBL_4: %21 = sext i32 %18 to i64 %22 = add i64 %15, %21 %23 = inttoptr i64 %22 to i8* store i8 0, i8* %23, align 1 %24 = call i8* @strchr(i8* nonnull %4, i32 13) %25 = icmp eq i8* %24, null br i1 %25, label LBL_6, label LBL_5 LBL_5: store i8 0, i8* %24, align 1 br label LBL_6 LBL_6: %26 = call i8* @strchr(i8* nonnull %4, i32 10) %27 = icmp eq i8* %26, null br i1 %27, label LBL_8, label LBL_7 LBL_7: store i8 0, i8* %26, align 1 br label LBL_8 LBL_8: %28 = call i32 @close(i32 %6) br label LBL_9 LBL_9: %29 = load i32, i32* @gv_0, align 4 %30 = icmp eq i32 %29, 5 %31 = icmp eq i1 %30, false br i1 %31, label LBL_11, label LBL_10 LBL_10: %32 = load %_IO_FILE*, %_IO_FILE** @gv_2, align 8 %33 = call i32 (%_IO_FILE*, i8*, ...) @fprintf(%_IO_FILE* %32, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_3, i64 0, i64 0), i64* nonnull %sv_1) br label LBL_11 LBL_11: %34 = call i64 @FUNC(i64 40) %35 = icmp eq i64 %0, %34 store i64 0, i64* %rax.0.reg2mem br i1 %35, label LBL_13, label LBL_12 LBL_12: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_13 LBL_13: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %18, { 1, 0 } uselistorder i32 %6, { 3, 1, 2, 0 } uselistorder i64* %sv_0, { 0, 2, 1 } uselistorder i32 (i32)* @close, { 1, 0, 2 } uselistorder i8* (i8*, i32)* @strchr, { 3, 2, 1, 0, 4 } uselistorder i8 0, { 1, 2, 3, 4, 5, 6, 7, 0 } uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 } uselistorder i32 (i32, %sockaddr*, i32)* @connect, { 1, 0, 2 } uselistorder i16 (i16)* @htons, { 1, 0, 2 } uselistorder i32 (i8*)* @inet_addr, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } uselistorder i32 -1, { 2, 0, 3, 1 } uselistorder i32 (i32, i32, i32)* @socket, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder label LBL_9, { 1, 0, 2 } uselistorder label LBL_8, { 2, 1, 0, 3 } }
0
juliet-test-suite-c
CWE369_Divide_by_Zero__int_zero_modulo_07-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 2) 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)* @printIntLine, { 1, 0 } uselistorder i32* @gv_0, { 4, 0, 3, 2, 1 } }
0
juliet-test-suite-c
CWE134_Uncontrolled_Format_String__char_console_printf_07-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 = bitcast i64* %sv_0 to i8* %2 = load i32, i32* @gv_0, align 4 %3 = icmp eq i32 %2, 5 %4 = icmp eq i1 %3, false br i1 %4, label LBL_7, 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_7, label LBL_2 LBL_2: %9 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %10 = sub i32 100, %5 %11 = ptrtoint i64* %sv_0 to i64 %12 = add i64 %6, %11 %13 = inttoptr i64 %12 to i8* %14 = call i8* @fgets(i8* %13, i32 %10, %_IO_FILE* %9) %15 = icmp eq i8* %14, null br i1 %15, label LBL_6, label LBL_3 LBL_3: %16 = call i32 @strlen(i8* nonnull %1) %17 = icmp eq i32 %16, 0 br i1 %17, label LBL_7, label LBL_4 LBL_4: %18 = sext i32 %16 to i64 %19 = add i64 %11, -1 %20 = add i64 %19, %18 %21 = inttoptr i64 %20 to i8* %22 = load i8, i8* %21, align 1 %23 = icmp eq i8 %22, 10 %24 = icmp eq i1 %23, false br i1 %24, label LBL_7, label LBL_5 LBL_5: store i8 0, i8* %21, align 1 br label LBL_7 LBL_6: %25 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 to i64)) store i8 0, i8* %13, align 1 br label LBL_7 LBL_7: %26 = load i32, i32* @gv_0, align 4 %27 = icmp eq i32 %26, 5 %28 = icmp eq i1 %27, false br i1 %28, label LBL_9, label LBL_8 LBL_8: %29 = call i32 @puts(i8* nonnull %1) br label LBL_9 LBL_9: %30 = call i64 @FUNC(i64 40) %31 = icmp eq i64 %0, %30 store i64 0, i64* %rax.0.reg2mem br i1 %31, 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 i64 %11, { 1, 0 } uselistorder i8* %1, { 1, 0, 2 } uselistorder i8 0, { 1, 2, 3, 4, 5, 0 } uselistorder i8* (i8*, i32, %_IO_FILE*)* @fgets, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_1, { 2, 1, 0 } uselistorder i32 (i8*)* @strlen, { 2, 0, 3, 1, 4 } }
0
juliet-test-suite-c
CWE369_Divide_by_Zero__int_zero_modulo_12-good
goodG2B
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = call i64 @FUNC() %1 = call i64 @FUNC() %2 = call i64 @FUNC(i64 2) ret i64 %2 uselistorder i64 ()* @globalReturnsTrueOrFalse, { 3, 2, 1, 0 } }
0