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
|
CWE126_Buffer_Overread__CWE129_large_05-bad
|
CWE126_Buffer_Overread__CWE129_large_05_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = ptrtoint i64* %sv_0 to i64
%4 = add i64 %3, -8
%5 = inttoptr i64 %4 to i32*
%6 = load i32, i32* %5, align 8
%7 = zext i32 %6 to i64
%8 = call i64 @FUNC(i64 %7)
br label LBL_2
LBL_2:
%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
}
|
1
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int_connect_socket_postdec_13-bad
|
CWE191_Integer_Underflow__int_connect_socket_postdec_13_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.1.reg2mem = alloca i32
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 8348 to i32*), align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 0, i32* %sv_0.1.reg2mem
br i1 %3, label LBL_6, label LBL_1
LBL_1:
%4 = call i32 @socket(i32 2, i32 1, i32 6)
%5 = icmp eq i32 %4, -1
store i32 0, i32* %sv_0.1.reg2mem
br i1 %5, label LBL_6, 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 i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%8 = call i16 @htons(i16 27015)
%9 = bitcast i64* %sv_2 to %sockaddr*
%10 = call i32 @connect(i32 %4, %sockaddr* nonnull %9, i32 16)
%11 = icmp eq i32 %10, -1
store i32 0, i32* %sv_0.0.ph.reg2mem
br i1 %11, label LBL_5, label LBL_3
LBL_3:
%12 = call i32 @recv(i32 %4, i64* nonnull %sv_1, i32 13, i32 0)
%13 = add i32 %12, 1
%14 = icmp ult i32 %13, 2
store i32 0, i32* %sv_0.0.ph.reg2mem
br i1 %14, label LBL_5, label LBL_4
LBL_4:
%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_5
LBL_5:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%22 = call i32 @close(i32 %4)
store i32 %sv_0.0.ph.reload, i32* %sv_0.1.reg2mem
br label LBL_6
LBL_6:
%sv_0.1.reload = load i32, i32* %sv_0.1.reg2mem
%23 = add i32 %sv_0.1.reload, -1
%24 = zext i32 %23 to i64
%25 = call i64 @FUNC(i64 %24)
%26 = call i64 @FUNC(i64 40)
%27 = icmp eq i64 %0, %26
store i64 0, i64* %rax.0.reg2mem
br i1 %27, label LBL_8, label LBL_7
LBL_7:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_8
LBL_8:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %12, { 1, 0 }
uselistorder i32 %4, { 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.1.reg2mem, { 0, 2, 1, 3 }
uselistorder label LBL_6, { 2, 0, 1 }
uselistorder label LBL_5, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__dest_char_alloca_cpy_12-bad
|
CWE121_Stack_Based_Buffer_Overflow__dest_char_alloca_cpy_12_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
%sv_2 = alloca i64, align 8
%0 = ptrtoint i64* %sv_2 to i64
%1 = call i64 @FUNC(i64 40)
%2 = call i64 @FUNC()
%3 = trunc i64 %2 to i32
%4 = icmp eq i32 %3, 0
br i1 %4, label LBL_2, label LBL_1
LBL_1:
%5 = add i64 %0, -49
%6 = and i64 %5, -16
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 16
store i8* %7, i8** %sv_0.0.reg2mem
br label LBL_3
LBL_2:
%8 = add i64 %0, -161
%9 = and i64 %8, -16
%10 = inttoptr i64 %9 to i8*
store i8 0, i8* %10, align 16
store i8* %10, i8** %sv_0.0.reg2mem
br label LBL_3
LBL_3:
%sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem
%11 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%12 = bitcast i64* %sv_1 to i8*
%13 = call i8* @strcpy(i8* nonnull %sv_0.0.reload, i8* nonnull %12)
%14 = ptrtoint i8* %sv_0.0.reload 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_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 i8** %sv_0.0.reg2mem, { 0, 2, 1 }
}
|
1
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__int_array_declare_partial_init_12-bad
|
CWE457_Use_of_Uninitialized_Variable__int_array_declare_partial_init_12_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%indvars.iv.reg2mem = alloca i64
%indvars.iv12.reg2mem = alloca i64
%indvars.iv15.reg2mem = alloca i64
%indvars.iv18.reg2mem = alloca i64
%indvars.iv21.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = ptrtoint i64* %sv_0 to i64
%2 = call i64 @FUNC()
%3 = trunc i64 %2 to i32
%4 = icmp eq i32 %3, 0
store i64 0, i64* %indvars.iv21.reg2mem
store i64 0, i64* %indvars.iv18.reg2mem
br i1 %4, label LBL_2, label LBL_1
LBL_1:
%indvars.iv21.reload = load i64, i64* %indvars.iv21.reg2mem
%5 = mul i64 %indvars.iv21.reload, 4
%6 = add i64 %5, %1
%7 = inttoptr i64 %6 to i32*
%8 = trunc i64 %indvars.iv21.reload to i32
store i32 %8, i32* %7, align 4
%indvars.iv.next22 = add nuw nsw i64 %indvars.iv21.reload, 1
%exitcond23 = icmp eq i64 %indvars.iv.next22, 5
store i64 %indvars.iv.next22, i64* %indvars.iv21.reg2mem
br i1 %exitcond23, label LBL_3, label LBL_1
LBL_2:
%indvars.iv18.reload = load i64, i64* %indvars.iv18.reg2mem
%9 = mul i64 %indvars.iv18.reload, 4
%10 = add i64 %9, %1
%11 = inttoptr i64 %10 to i32*
%12 = trunc i64 %indvars.iv18.reload to i32
store i32 %12, i32* %11, align 4
%indvars.iv.next19 = add nuw nsw i64 %indvars.iv18.reload, 1
%exitcond20 = icmp eq i64 %indvars.iv.next19, 10
store i64 %indvars.iv.next19, i64* %indvars.iv18.reg2mem
br i1 %exitcond20, label LBL_3, label LBL_2
LBL_3:
%13 = call i64 @FUNC()
%14 = trunc i64 %13 to i32
%15 = icmp eq i32 %14, 0
store i64 0, i64* %indvars.iv15.reg2mem
store i64 0, i64* %indvars.iv12.reg2mem
br i1 %15, label LBL_5, label LBL_4
LBL_4:
%indvars.iv15.reload = load i64, i64* %indvars.iv15.reg2mem
%16 = mul i64 %indvars.iv15.reload, 4
%17 = add i64 %16, %1
%18 = inttoptr i64 %17 to i32*
%19 = load i32, i32* %18, align 4
%20 = zext i32 %19 to i64
%21 = call i64 @FUNC(i64 %20)
%indvars.iv.next16 = add nuw nsw i64 %indvars.iv15.reload, 1
%exitcond17 = icmp eq i64 %indvars.iv.next16, 10
store i64 %indvars.iv.next16, i64* %indvars.iv15.reg2mem
br i1 %exitcond17, label LBL_7, label LBL_4
LBL_5:
%indvars.iv12.reload = load i64, i64* %indvars.iv12.reg2mem
%22 = mul i64 %indvars.iv12.reload, 4
%23 = add i64 %22, %1
%24 = inttoptr i64 %23 to i32*
%25 = trunc i64 %indvars.iv12.reload to i32
store i32 %25, i32* %24, align 4
%indvars.iv.next13 = add nuw nsw i64 %indvars.iv12.reload, 1
%exitcond14 = icmp eq i64 %indvars.iv.next13, 10
store i64 %indvars.iv.next13, i64* %indvars.iv12.reg2mem
store i64 0, i64* %indvars.iv.reg2mem
br i1 %exitcond14, label LBL_6, label LBL_5
LBL_6:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%26 = mul i64 %indvars.iv.reload, 4
%27 = add i64 %26, %1
%28 = inttoptr i64 %27 to i32*
%29 = load i32, i32* %28, align 4
%30 = zext i32 %29 to i64
%31 = call i64 @FUNC(i64 %30)
%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_7, label LBL_6
LBL_7:
%32 = call i64 @FUNC(i64 40)
%33 = icmp eq i64 %0, %32
store i64 0, i64* %rax.0.reg2mem
br i1 %33, 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 i64* %indvars.iv21.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv18.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv15.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv12.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
uselistorder i64 10, { 3, 2, 1, 0 }
uselistorder i64 ()* @globalReturnsTrueOrFalse, { 1, 0 }
uselistorder label LBL_7, { 1, 0 }
uselistorder label LBL_6, { 1, 0 }
uselistorder label LBL_5, { 1, 0 }
uselistorder label LBL_4, { 1, 0 }
uselistorder label LBL_3, { 1, 0 }
uselistorder label LBL_2, { 1, 0 }
uselistorder label LBL_1, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE758_Undefined_Behavior__struct_malloc_use_08-bad
|
CWE758_Undefined_Behavior__struct_malloc_use_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i32
%rax.0.reg2mem = alloca i64
%1 = load i32, i32* %0
%2 = call i64 @FUNC()
%3 = trunc i64 %2 to i32
%4 = icmp eq i32 %3, 0
store i64 %2, i64* %rax.0.reg2mem
br i1 %4, label LBL_4, label LBL_1
LBL_1:
%5 = call i64* @malloc(i32 8)
%6 = icmp eq i64* %5, null
%7 = icmp eq i1 %6, false
br i1 %7, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%8 = load i64, i64* %5, align 8
call void @free(i64* %5)
%9 = and i64 %8, 4294967295
%10 = call i64 @FUNC(i64 %9)
%11 = zext i32 %1 to i64
%12 = call i64 @FUNC(i64 %11)
store i64 %12, 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 (i64)* @printIntLine, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE367_TOC_TOU__access_04-bad
|
CWE367_TOC_TOU__access_04_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i8, align 1
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i8 0, i8* %sv_0, align 1
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = call i8* @fgets(i8* nonnull %sv_0, i32 100, %_IO_FILE* %1)
%3 = icmp eq i8* %2, null
%4 = icmp eq i1 %3, false
br i1 %4, label LBL_2, label LBL_1
LBL_1:
%5 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_1 to i64))
store i8 0, i8* %sv_0, align 1
br label LBL_4
LBL_2:
%.pr = load i8, i8* %sv_0, align 1
%6 = icmp eq i8 %.pr, 0
br i1 %6, label LBL_4, label LBL_3
LBL_3:
%7 = ptrtoint i64* %sv_1 to i64
%8 = call i32 @strlen(i8* nonnull %sv_0)
%9 = sext i32 %8 to i64
%10 = add i64 %7, -113
%11 = add i64 %10, %9
%12 = inttoptr i64 %11 to i8*
store i8 0, i8* %12, align 1
br label LBL_4
LBL_4:
%13 = call i32 @access(i8* nonnull %sv_0, i32 2)
%14 = icmp eq i32 %13, -1
%15 = icmp eq i1 %14, false
br i1 %15, label LBL_6, label LBL_5
LBL_5:
call void @exit(i32 1)
unreachable
LBL_6:
%16 = call i32 (i8*, i32, ...) @open(i8* nonnull %sv_0, i32 2)
%17 = icmp eq i32 %16, -1
%18 = icmp eq i1 %17, false
br i1 %18, label LBL_8, label LBL_7
LBL_7:
call void @exit(i32 1)
unreachable
LBL_8:
%19 = call i32 @write(i32 %16, i64* bitcast ([12 x i8]* @gv_2 to i64*), i32 11)
%20 = icmp eq i32 %19, -1
%21 = icmp eq i1 %20, false
br i1 %21, label LBL_10, label LBL_9
LBL_9:
call void @exit(i32 1)
unreachable
LBL_10:
%22 = call i32 @close(i32 %16)
%23 = call i64 @FUNC(i64 40)
%24 = icmp eq i64 %0, %23
store i64 0, i64* %rax.0.reg2mem
br i1 %24, 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 i8* %sv_0, { 6, 5, 4, 0, 2, 3, 1 }
uselistorder void (i32)* @exit, { 2, 1, 0, 3 }
uselistorder i8 0, { 3, 4, 0, 1, 5, 2 }
uselistorder label LBL_4, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE590_Free_Memory_Not_on_Heap__free_struct_static_32-bad
|
CWE590_Free_Memory_Not_on_Heap__free_struct_static_32_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %storemerge1.reg2mem
br label LBL_1
LBL_1:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%1 = mul i64 %storemerge1.reload, 8
%2 = add i64 %1, ptrtoint (i64* @gv_0 to i64)
%3 = inttoptr i64 %2 to i32*
store i32 1, i32* %3, align 8
%4 = add i64 %1, ptrtoint (i64* @gv_1 to i64)
%5 = inttoptr i64 %4 to i32*
store i32 1, i32* %5, align 8
%6 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %6, 100
store i64 %6, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_2, label LBL_1
LBL_2:
%7 = call i64 @FUNC(i64 ptrtoint (i64* @gv_0 to i64))
call void @free(i64* nonnull @gv_0)
%8 = call i64 @FUNC(i64 40)
%9 = icmp eq i64 %0, %8
store i64 0, i64* %rax.0.reg2mem
br i1 %9, label LBL_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, { 1, 0 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__CWE131_memmove_07-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i64 0, i64* %sv_0.0.reg2mem
br i1 %3, label LBL_3, label LBL_1
LBL_1:
%4 = call i64* @malloc(i32 40)
%5 = ptrtoint i64* %4 to i64
%6 = icmp eq i64* %4, null
%7 = icmp eq i1 %6, false
store i64 %5, i64* %sv_0.0.reg2mem
br i1 %7, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
store i64 0, i64* %sv_1, align 8
%8 = inttoptr i64 %sv_0.0.reload to i64*
%9 = call i64* @memmove(i64* %8, i64* nonnull %sv_1, i32 40)
%10 = inttoptr i64 %sv_0.0.reload to i32*
%11 = load i32, i32* %10, align 4
%12 = zext i32 %11 to i64
%13 = call i64 @FUNC(i64 %12)
call void @free(i64* %8)
%14 = call i64 @FUNC(i64 40)
%15 = icmp eq i64 %0, %14
store i64 0, i64* %rax.0.reg2mem
br i1 %15, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
uselistorder i64* (i64*, i64*, i32)* @memmove, { 1, 0, 2 }
uselistorder i32 40, { 0, 1, 3, 2 }
uselistorder i32* @gv_0, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE188_Reliance_on_Data_Memory_Layout__modify_local_13-bad
|
CWE188_Reliance_on_Data_Memory_Layout__modify_local_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 i32, align 4
%2 = call i64 @FUNC(i64 40)
%3 = load i32, i32* inttoptr (i64 8336 to i32*), align 16
%4 = icmp eq i32 %3, 5
%5 = icmp eq i1 %4, false
br i1 %5, label LBL_2, label LBL_1
LBL_1:
store i32 1, i32* %sv_0, align 4
%6 = ptrtoint i32* %sv_0 to i64
%7 = add i64 %6, 4
%8 = inttoptr i64 %7 to i32*
store i32 5, i32* %8, align 4
%9 = load i32, i32* %sv_0, align 4
%sext = mul i32 %9, 16777216
%10 = ashr exact i32 %sext, 24
%11 = zext i32 %10 to i64
%12 = call i64 @FUNC(i64 %11)
%13 = zext i32 %1 to i64
%14 = call i64 @FUNC(i64 %13)
br label LBL_2
LBL_2:
%15 = call i64 @FUNC(i64 40)
%16 = icmp eq i64 %2, %15
store i64 0, i64* %rax.0.reg2mem
br i1 %16, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %sv_0, { 2, 1, 0 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
uselistorder i32 5, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__char_fscanf_multiply_09-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i8, align 1
%0 = call i64 @FUNC(i64 40)
store i8 32, i8* %sv_0, align 1
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i8* nonnull %sv_0)
%3 = load i8, i8* %sv_0, align 1
%4 = icmp slt i8 %3, 1
br i1 %4, label LBL_4, label LBL_1
LBL_1:
%5 = icmp sgt i8 %3, 62
br i1 %5, label LBL_3, label LBL_2
LBL_2:
%6 = mul i8 %3, 2
%7 = sext i8 %6 to i64
%8 = and i64 %7, 4294967294
%9 = call i64 @FUNC(i64 %8)
br label LBL_4
LBL_3:
%10 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64))
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 i8* %sv_0, { 1, 0, 2 }
uselistorder i32 (%_IO_FILE*, i8*, ...)* @fscanf, { 1, 0, 2 }
uselistorder %_IO_FILE** @gv_0, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int64_t_rand_sub_14-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%0 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%1 = icmp eq i32 %0, 5
%2 = icmp eq i1 %1, false
store i64 0, i64* %sv_0.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i32 @rand()
%4 = urem i32 %3, 2
%5 = icmp eq i32 %4, 0
%6 = call i32 @rand()
%7 = zext i32 %6 to i64
%8 = mul i64 %7, 1152921504606846976
%9 = call i32 @rand()
%10 = zext i32 %9 to i64
%11 = mul i64 %10, 35184372088832
%12 = call i32 @rand()
%13 = sext i32 %12 to i64
%14 = mul i64 %13, 1073741824
%15 = call i32 @rand()
%16 = sext i32 %15 to i64
%17 = mul i64 %16, 32768
%18 = call i32 @rand()
%19 = sext i32 %18 to i64
%20 = sext i1 %5 to i64
%21 = xor i64 %8, %20
%22 = xor i64 %21, %11
%23 = xor i64 %22, %14
%24 = xor i64 %23, %17
%storemerge = xor i64 %24, %19
store i64 %storemerge, i64* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%25 = load i32, i32* @gv_0, align 4
%26 = icmp eq i32 %25, 5
br i1 %26, label LBL_4, label LBL_3
LBL_3:
%27 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
store i64 %27, i64* %rax.0.reg2mem
br label LBL_7
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%28 = icmp eq i64 %sv_0.0.reload, -9223372036854775808
br i1 %28, label LBL_6, label LBL_5
LBL_5:
%29 = add i64 %sv_0.0.reload, -1
%30 = call i64 @FUNC(i64 %29)
store i64 %30, i64* %rax.0.reg2mem
br label LBL_7
LBL_6:
%31 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_2 to i64))
store i64 %31, 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
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_alloca_snprintf_13-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
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 8364 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
%5 = add i64 %4, -161
%6 = and i64 %5, -16
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 16
store i8* %7, i8** %sv_0.0.reg2mem
br label LBL_3
LBL_3:
%sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem
%8 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%9 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* %sv_0.0.reload, i32 100, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_1)
%10 = ptrtoint i8* %sv_0.0.reload 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
|
CWE127_Buffer_Underread__char_declare_loop_13-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 = 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 = ptrtoint i64* %sv_0 to i64
store i64 0, i64* %storemerge1.reg2mem
br label LBL_1
LBL_1:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%5 = add i64 %storemerge1.reload, %2
%6 = inttoptr i64 %5 to i8*
%7 = load i8, i8* %6, align 1
%8 = add i64 %storemerge1.reload, %4
%9 = inttoptr i64 %8 to i8*
store i8 %7, i8* %9, align 1
%10 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %10, 100
store i64 %10, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_2, label LBL_1
LBL_2:
%11 = call i64 @FUNC(i64 %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_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 %4, { 1, 0 }
uselistorder i64* %sv_1, { 1, 0 }
uselistorder i64* %sv_0, { 1, 0 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 0, 2, 3, 1, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__double_array_declare_no_init_05-bad
|
CWE457_Use_of_Uninitialized_Variable__double_array_declare_no_init_05_bad
|
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 = call i64 @FUNC(i64 40)
%1 = ptrtoint i64* %sv_0 to i64
%2 = load i32, i32* @gv_0, align 4
%3 = icmp eq i32 %2, 0
store i64 0, i64* %indvars.iv.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%4 = mul i64 %indvars.iv.reload, 8
%5 = add i64 %4, %1
%6 = inttoptr i64 %5 to i64*
%7 = load i64, i64* %6, align 8
%8 = call i128 @FUNC(i64 %7)
%9 = 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
br i1 %exitcond, label LBL_2, label LBL_1
LBL_2:
%10 = call i64 @FUNC(i64 40)
%11 = icmp eq i64 %0, %10
store i64 0, i64* %rax.0.reg2mem
br i1 %11, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 }
uselistorder label LBL_1, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE401_Memory_Leak__int64_t_realloc_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* @realloc(i64* null, i32 ptrtoint (i32* @gv_1 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)
%.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
%7 = zext i32 %.reload to i64
%8 = icmp eq i32 %.reload, 5
%9 = icmp eq i1 %8, false
store i64 %7, i64* %rax.0.reg2mem
br i1 %9, 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 void (i64*)* @free, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* (i64*, i32)* @realloc, { 1, 0, 2 }
uselistorder i64* null, { 4, 2, 0, 5, 3, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE127_Buffer_Underread__char_declare_loop_04-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%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 = ptrtoint i64* %sv_0 to i64
store i64 0, i64* %storemerge1.reg2mem
br label LBL_1
LBL_1:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%5 = add i64 %storemerge1.reload, %2
%6 = inttoptr i64 %5 to i8*
%7 = load i8, i8* %6, align 1
%8 = add i64 %storemerge1.reload, %4
%9 = inttoptr i64 %8 to i8*
store i8 %7, i8* %9, align 1
%10 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %10, 100
store i64 %10, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_2, label LBL_1
LBL_2:
%11 = call i64 @FUNC(i64 %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_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 %4, { 1, 0 }
uselistorder i64* %sv_1, { 1, 0 }
uselistorder i64* %sv_0, { 1, 0 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__char_malloc_03-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64* @malloc(i32 20)
%1 = ptrtoint i64* %0 to i64
%2 = icmp eq i64* %0, null
store i64 %1, i64* %rax.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
store i64 7596553777019711049, i64* %0, align 8
%3 = add i64 %1, 8
%4 = inttoptr i64 %3 to i16*
store i16 25978, i16* %4, align 2
%5 = add i64 %1, 10
%6 = inttoptr i64 %5 to i8*
store i8 0, i8* %6, align 1
%7 = call i64 @FUNC(i64 %1)
call void @free(i64* nonnull %0)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %1, { 1, 2, 3, 0 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__char_fscanf_sub_14-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i8, align 1
%0 = call i64 @FUNC(i64 40)
store i8 32, i8* %sv_0, align 1
%1 = load 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), i8* nonnull %sv_0)
br label LBL_2
LBL_2:
%6 = load i32, i32* @gv_2, align 4
%7 = icmp eq i32 %6, 5
br i1 %7, label LBL_4, label LBL_3
LBL_3:
%8 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_3 to i64))
br label LBL_7
LBL_4:
%9 = load i8, i8* %sv_0, align 1
%10 = icmp eq i8 %9, -128
br i1 %10, label LBL_6, label LBL_5
LBL_5:
%11 = add i8 %9, -1
%12 = sext i8 %11 to i64
%13 = and i64 %12, 4294967295
%14 = call i64 @FUNC(i64 %13)
br label LBL_7
LBL_6:
%15 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_4 to i64))
br label LBL_7
LBL_7:
%16 = call i64 @FUNC(i64 40)
%17 = icmp eq i64 %0, %16
store i64 0, i64* %rax.0.reg2mem
br i1 %17, 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 i8* %sv_0, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_declare_ncpy_05-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
%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, 0
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
br label LBL_3
LBL_2:
%4 = bitcast i64* %sv_2 to i8*
store i8 0, i8* %4, align 8
store i8* %4, i8** %sv_0.0.reg2mem
br label LBL_3
LBL_3:
%sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem
%5 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%6 = bitcast i64* %sv_1 to i8*
%7 = call i8* @strncpy(i8* %sv_0.0.reload, i8* nonnull %6, i32 99)
%8 = ptrtoint i8* %sv_0.0.reload to i64
%9 = add i64 %8, 99
%10 = inttoptr i64 %9 to i8*
store i8 0, i8* %10, align 1
%11 = call i64 @FUNC(i64 %8)
%12 = call i64 @FUNC(i64 40)
%13 = icmp eq i64 %0, %12
store i64 0, i64* %rax.0.reg2mem
br i1 %13, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_listen_socket_add_04-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0368.reg2mem = alloca i32
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i32 @socket(i32 2, i32 1, i32 6)
%2 = icmp eq i32 %1, -1
store i32 0, i32* %sv_0.0368.reg2mem
br i1 %2, label LBL_8, label LBL_1
LBL_1:
%3 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%4 = call i16 @htons(i16 27015)
%5 = bitcast i64* %sv_2 to %sockaddr*
%6 = call i32 @bind(i32 %1, %sockaddr* nonnull %5, i32 16)
%7 = icmp eq i32 %6, -1
br i1 %7, label LBL_6, label LBL_2
LBL_2:
%8 = call i32 @listen(i32 %1, i32 5)
%9 = icmp eq i32 %8, -1
br i1 %9, label LBL_6, label LBL_3
LBL_3:
%10 = call i32 @accept(i32 %1, %sockaddr* null, i32* null)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_6, label LBL_4
LBL_4:
%12 = call i32 @recv(i32 %10, i64* nonnull %sv_1, i32 13, i32 0)
%13 = add i32 %12, 1
%14 = icmp ult i32 %13, 2
store i32 0, i32* %sv_0.0.ph.reg2mem
br i1 %14, label LBL_7, label LBL_5
LBL_5:
%15 = ptrtoint i64* %sv_3 to i64
%16 = sext i32 %12 to i64
%17 = add i64 %15, -22
%18 = add i64 %17, %16
%19 = inttoptr i64 %18 to i8*
store i8 0, i8* %19, align 1
%20 = bitcast i64* %sv_1 to i8*
%21 = call i32 @atoi(i8* nonnull %20)
store i32 %21, i32* %sv_0.0.ph.reg2mem
br label LBL_7
LBL_6:
%22 = call i32 @close(i32 %1)
store i32 0, i32* %sv_0.0368.reg2mem
br label LBL_8
LBL_7:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%23 = call i32 @close(i32 %1)
%24 = call i32 @close(i32 %10)
%25 = icmp eq i32 %sv_0.0.ph.reload, 2147483647
store i32 %sv_0.0.ph.reload, i32* %sv_0.0368.reg2mem
br i1 %25, label LBL_9, label LBL_8
LBL_8:
%sv_0.0368.reload = load i32, i32* %sv_0.0368.reg2mem
%26 = add i32 %sv_0.0368.reload, 1
%27 = zext i32 %26 to i64
%28 = call i64 @FUNC(i64 %27)
br label LBL_10
LBL_9:
%29 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_0 to i64))
br label LBL_10
LBL_10:
%30 = call i64 @FUNC(i64 40)
%31 = icmp eq i64 %0, %30
store i64 0, i64* %rax.0.reg2mem
br i1 %31, label LBL_12, label LBL_11
LBL_11:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_12
LBL_12:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %12, { 1, 0 }
uselistorder i32 %1, { 4, 0, 1, 2, 3, 5 }
uselistorder i64* %sv_2, { 0, 2, 1 }
uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 1 }
uselistorder i32* %sv_0.0368.reg2mem, { 0, 3, 2, 1 }
uselistorder i32 (i32)* @close, { 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 label LBL_8, { 2, 1, 0 }
uselistorder label LBL_7, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE606_Unchecked_Loop_Condition__char_environment_08-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.lcssa.reg2mem = alloca i64
%storemerge4.reg2mem = alloca i32
%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_3, label LBL_1
LBL_1:
%5 = call i32 @strlen(i8* nonnull %1)
%6 = call i8* @getenv(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_0, i64 0, i64 0))
%7 = icmp eq i8* %6, null
br i1 %7, label LBL_3, label LBL_2
LBL_2:
%8 = sext i32 %5 to i64
%9 = ptrtoint i64* %sv_2 to i64
%10 = add i64 %8, %9
%11 = inttoptr i64 %10 to i8*
%12 = sub i32 99, %5
%13 = call i8* @strncat(i8* %11, i8* nonnull %6, i32 %12)
br label LBL_3
LBL_3:
%14 = call i64 @FUNC()
%15 = trunc i64 %14 to i32
%16 = icmp eq i32 %15, 0
br i1 %16, label LBL_10, label LBL_4
LBL_4:
%17 = 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)
%18 = icmp eq i32 %17, 1
%19 = icmp eq i1 %18, false
br i1 %19, label LBL_10, label LBL_5
LBL_5:
%20 = load i64, i64* %sv_1, align 8
%21 = trunc i64 %20 to i32
%22 = icmp sgt i32 %21, ptrtoint (i1* @gv_2 to i32)
br i1 %22, label LBL_10, label LBL_6
LBL_6:
%23 = and i64 %20, 4294967295
%24 = icmp eq i64 %23, 0
store i32 0, i32* %storemerge4.reg2mem
store i64 0, i64* %sv_0.0.lcssa.reg2mem
br i1 %24, label LBL_9, label LBL_7
LBL_7:
%storemerge4.reload = load i32, i32* %storemerge4.reg2mem
%25 = add i32 %storemerge4.reload, 1
%26 = sext i32 %25 to i64
%27 = icmp sgt i64 %23, %26
store i32 %25, i32* %storemerge4.reg2mem
br i1 %27, label LBL_7, label LBL_8
LBL_8:
%phitmp = zext i32 %25 to i64
store i64 %phitmp, i64* %sv_0.0.lcssa.reg2mem
br label LBL_9
LBL_9:
%sv_0.0.lcssa.reload = load i64, i64* %sv_0.0.lcssa.reg2mem
%28 = call i64 @FUNC(i64 %sv_0.0.lcssa.reload)
br label LBL_10
LBL_10:
%29 = call i64 @FUNC(i64 40)
%30 = icmp eq i64 %0, %29
store i64 0, i64* %rax.0.reg2mem
br i1 %30, 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 %25, { 1, 0, 2 }
uselistorder i8* %1, { 1, 0 }
uselistorder i64* %sv_1, { 1, 0 }
uselistorder i32* %storemerge4.reg2mem, { 2, 0, 1 }
uselistorder i64* %sv_0.0.lcssa.reg2mem, { 0, 2, 1 }
uselistorder i32 ptrtoint (i1* @gv_2 to i32), { 1, 0 }
uselistorder i8* (i8*, i8*, i32)* @strncat, { 1, 0, 2 }
uselistorder i8* (i8*)* @getenv, { 1, 0, 2 }
uselistorder label LBL_9, { 1, 0 }
uselistorder label LBL_7, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__int_fscanf_divide_08-bad
|
CWE369_Divide_by_Zero__int_fscanf_divide_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i32, align 4
%0 = call i64 @FUNC(i64 40)
store i32 -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
br i1 %8, label LBL_4, label LBL_3
LBL_3:
%9 = load i32, i32* %sv_0, align 4
%10 = udiv i32 100, %9
%11 = zext i32 %10 to i64
%12 = call i64 @FUNC(i64 %11)
br label LBL_4
LBL_4:
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %sv_0, { 1, 0, 2 }
uselistorder i64 ()* @staticReturnsTrue, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_max_add_03-bad
|
CWE190_Integer_Overflow__int_max_add_03_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64 @FUNC(i64 2147483648)
ret i64 %0
}
|
1
|
juliet-test-suite-c
|
CWE761_Free_Pointer_Not_at_Start_of_Buffer__char_fixed_string_07-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge2.reg2mem = alloca i64
%0 = call i64* @malloc(i32 100)
%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
store i64 8382078947037833542, i64* %0, align 8
%4 = add i64 %3, 8
%5 = inttoptr i64 %4 to i32*
store i32 1735289202, i32* %5, align 4
%6 = add i64 %3, 12
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 1
%8 = load i32, i32* @gv_0, align 4
%9 = zext i32 %8 to i64
%10 = icmp eq i32 %8, 5
%11 = icmp eq i1 %10, false
store i64 %9, i64* %rax.0.reg2mem
br i1 %11, label LBL_8, label LBL_3
LBL_3:
%12 = bitcast i64* %0 to i8*
%13 = call i32 @strlen(i8* nonnull %12)
%14 = icmp eq i32 %13, 0
store i64 0, i64* %storemerge2.reg2mem
br i1 %14, label LBL_7, label LBL_4
LBL_4:
%storemerge2.reload = load i64, i64* %storemerge2.reg2mem
%15 = add i64 %storemerge2.reload, %3
%16 = inttoptr i64 %15 to i8*
%17 = load i8, i8* %16, align 1
%18 = icmp eq i8 %17, 83
%19 = icmp eq i1 %18, false
br i1 %19, label LBL_6, label LBL_5
LBL_5:
%20 = call i64 @FUNC(i64 ptrtoint ([17 x i8]* @gv_1 to i64))
br label LBL_7
LBL_6:
%21 = add nuw i64 %storemerge2.reload, 1
%22 = call i32 @strlen(i8* %12)
%23 = sext i32 %22 to i64
%24 = icmp ult i64 %21, %23
store i64 %21, i64* %storemerge2.reg2mem
br i1 %24, label LBL_4, label LBL_7
LBL_7:
call void @free(i64* %0)
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 i8* %12, { 1, 0 }
uselistorder i64 %3, { 0, 2, 1 }
uselistorder i64* %0, { 0, 4, 2, 1, 3 }
uselistorder i64* %storemerge2.reg2mem, { 2, 0, 1 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 3, 0, 2, 1, 4 }
uselistorder i32* @gv_0, { 1, 0 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
uselistorder label LBL_7, { 0, 2, 1 }
uselistorder label LBL_4, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int64_t_rand_multiply_05-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
store i64 0, i64* %sv_0.0.reg2mem
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = call i32 @rand()
%3 = urem i32 %2, 2
%4 = icmp eq i32 %3, 0
%5 = call i32 @rand()
%6 = zext i32 %5 to i64
%7 = mul i64 %6, 1152921504606846976
%8 = call i32 @rand()
%9 = zext i32 %8 to i64
%10 = mul i64 %9, 35184372088832
%11 = call i32 @rand()
%12 = sext i32 %11 to i64
%13 = mul i64 %12, 1073741824
%14 = call i32 @rand()
%15 = sext i32 %14 to i64
%16 = mul i64 %15, 32768
%17 = call i32 @rand()
%18 = sext i32 %17 to i64
%19 = sext i1 %4 to i64
%20 = xor i64 %7, %19
%21 = xor i64 %20, %10
%22 = xor i64 %21, %13
%23 = xor i64 %22, %16
%storemerge = xor i64 %23, %18
store i64 %storemerge, i64* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%24 = load i32, i32* @gv_1, align 4
%25 = icmp eq i32 %24, 0
br i1 %25, label LBL_4, label LBL_3
LBL_3:
%26 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64))
store i64 %26, i64* %rax.0.reg2mem
br label LBL_8
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%27 = icmp slt i64 %sv_0.0.reload, 1
store i64 0, i64* %rax.0.reg2mem
br i1 %27, label LBL_8, label LBL_5
LBL_5:
%28 = icmp sgt i64 %sv_0.0.reload, 4611686018427387902
br i1 %28, label LBL_7, label LBL_6
LBL_6:
%29 = mul i64 %sv_0.0.reload, 2
%30 = call i64 @FUNC(i64 %29)
store i64 %30, i64* %rax.0.reg2mem
br label LBL_8
LBL_7:
%31 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_3 to i64))
store i64 %31, i64* %rax.0.reg2mem
br label LBL_8
LBL_8:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %sv_0.0.reload, { 2, 0, 1 }
uselistorder i64* %rax.0.reg2mem, { 0, 3, 2, 4, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_dest_char_cat_07-bad
|
CWE122_Heap_Based_Buffer_Overflow__c_dest_char_cat_07_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* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i8* null, i8** %sv_0.0.reg2mem
br i1 %3, label LBL_4, label LBL_1
LBL_1:
%4 = call i64* @malloc(i32 50)
%5 = icmp eq i64* %4, null
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%7 = bitcast i64* %4 to i8*
store i8 0, i8* %7, align 1
store i8* %7, i8** %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem
%8 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%9 = bitcast i64* %sv_1 to i8*
%10 = call i8* @strcat(i8* %sv_0.0.reload, i8* nonnull %9)
%11 = ptrtoint i8* %sv_0.0.reload to i64
%12 = call i64 @FUNC(i64 %11)
%13 = bitcast i8* %sv_0.0.reload to i64*
call void @free(i64* %13)
%14 = call i64 @FUNC(i64 40)
%15 = icmp eq i64 %0, %14
store i64 0, i64* %rax.0.reg2mem
br i1 %15, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %4, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_alloca_loop_34-bad
|
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_alloca_loop_34_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge3.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, -17
%3 = and i64 %2, -16
%4 = inttoptr i64 %3 to i8*
store i8 0, i8* %4, align 16
store i8* %4, i8** %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 = sext i32 %6 to i64
%8 = add nsw i64 %7, 1
%9 = icmp eq i64 %8, 0
br i1 %9, label LBL_3, label LBL_1
LBL_1:
%10 = ptrtoint i64* %sv_0 to i64
store i64 0, i64* %storemerge3.reg2mem
br label LBL_2
LBL_2:
%storemerge3.reload = load i64, i64* %storemerge3.reg2mem
%11 = add i64 %storemerge3.reload, %3
%12 = add i64 %storemerge3.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 i64 %storemerge3.reload, 1
%exitcond = icmp eq i64 %16, %8
store i64 %16, i64* %storemerge3.reg2mem
br i1 %exitcond, label LBL_3, label LBL_2
LBL_3:
%17 = call i64 @FUNC(i64 %3)
%18 = call i64 @FUNC(i64 40)
%19 = icmp eq i64 %1, %18
store i64 0, i64* %rax.0.reg2mem
br i1 %19, 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 %storemerge3.reload, { 0, 2, 1 }
uselistorder i8* %4, { 1, 0 }
uselistorder i64 %3, { 1, 0, 2 }
uselistorder i8** %sv_1, { 1, 0 }
uselistorder i64* %sv_0, { 1, 0, 2 }
uselistorder i64* %storemerge3.reg2mem, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_console_execlp_02-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 2126700, i64* %sv_0, align 8
%1 = ptrtoint i64* %sv_0 to i64
%2 = bitcast i64* %sv_0 to i8*
%3 = call i32 @strlen(i8* nonnull %2)
%4 = sext i32 %3 to i64
%5 = add i64 %4, %1
%6 = inttoptr i64 %5 to i32*
store i32 2764330, i32* %6, align 4
%7 = call i32 (i8*, i8*, ...) @execlp(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0))
%8 = call i64 @FUNC(i64 40)
%9 = icmp eq i64 %0, %8
store i64 0, i64* %rax.0.reg2mem
br i1 %9, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__struct_pointer_12-bad
|
CWE457_Use_of_Uninitialized_Variable__struct_pointer_12_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge.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
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_4, label LBL_1
LBL_1:
%4 = call i64* @malloc(i32 8)
%5 = icmp eq i64* %4, null
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%7 = bitcast i64* %4 to i32*
store i32 5, i32* %7, align 4
%8 = ptrtoint i64* %4 to i64
%9 = add i64 %8, 4
%10 = inttoptr i64 %9 to i32*
store i32 6, i32* %10, align 4
store i32* %7, i32** %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%11 = call i64 @FUNC()
%12 = trunc i64 %11 to i32
%13 = icmp eq i32 %12, 0
br i1 %13, label LBL_6, label LBL_5
LBL_5:
%sv_0.0.reload = load i32*, i32** %sv_0.0.reg2mem
%14 = load i32, i32* %sv_0.0.reload, align 4
%15 = zext i32 %14 to i64
%16 = call i64 @FUNC(i64 %15)
%17 = ptrtoint i32* %sv_0.0.reload to i64
%18 = add i64 %17, 4
%19 = inttoptr i64 %18 to i32*
%20 = load i32, i32* %19, align 4
%21 = zext i32 %20 to i64
%22 = call i64 @FUNC(i64 %21)
store i64 %22, i64* %storemerge.reg2mem
br label LBL_9
LBL_6:
%23 = call i64* @malloc(i32 8)
%24 = icmp eq i64* %23, null
%25 = icmp eq i1 %24, false
br i1 %25, label LBL_8, label LBL_7
LBL_7:
call void @exit(i32 -1)
unreachable
LBL_8:
%26 = bitcast i64* %23 to i32*
store i32 5, i32* %26, align 4
%27 = ptrtoint i64* %23 to i64
%28 = add i64 %27, 4
%29 = inttoptr i64 %28 to i32*
store i32 6, i32* %29, align 4
%30 = load i32, i32* %26, align 4
%31 = zext i32 %30 to i64
%32 = call i64 @FUNC(i64 %31)
%33 = load i32, i32* %29, align 4
%34 = zext i32 %33 to i64
%35 = call i64 @FUNC(i64 %34)
store i64 %35, i64* %storemerge.reg2mem
br label LBL_9
LBL_9:
%storemerge.reload = load i64, i64* %storemerge.reg2mem
ret i64 %storemerge.reload
uselistorder i64* %23, { 0, 2, 1 }
uselistorder i64* %4, { 0, 2, 1 }
uselistorder i64* %storemerge.reg2mem, { 0, 2, 1 }
uselistorder i64 (i64)* @printIntLine, { 3, 2, 1, 0 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
uselistorder i64 ()* @globalReturnsTrueOrFalse, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_fscanf_square_14-bad
|
CWE190_Integer_Overflow__int_fscanf_square_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
%sext = mul i64 %9, 4294967296
%10 = ashr exact i64 %sext, 32
%11 = mul nsw i64 %10, %10
%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, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_connect_socket_multiply_12-bad
|
CWE190_Integer_Overflow__int_connect_socket_multiply_12_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.1.reg2mem = alloca i32
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
store i32 2, i32* %sv_0.1.reg2mem
br i1 %3, label LBL_6, label LBL_1
LBL_1:
%4 = call i32 @socket(i32 2, i32 1, i32 6)
%5 = icmp eq i32 %4, -1
store i32 0, i32* %sv_0.1.reg2mem
br i1 %5, label LBL_6, 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 i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%8 = call i16 @htons(i16 27015)
%9 = bitcast i64* %sv_2 to %sockaddr*
%10 = call i32 @connect(i32 %4, %sockaddr* nonnull %9, i32 16)
%11 = icmp eq i32 %10, -1
store i32 0, i32* %sv_0.0.ph.reg2mem
br i1 %11, label LBL_5, label LBL_3
LBL_3:
%12 = call i32 @recv(i32 %4, i64* nonnull %sv_1, i32 13, i32 0)
%13 = add i32 %12, 1
%14 = icmp ult i32 %13, 2
store i32 0, i32* %sv_0.0.ph.reg2mem
br i1 %14, label LBL_5, label LBL_4
LBL_4:
%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_5
LBL_5:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%22 = call i32 @close(i32 %4)
store i32 %sv_0.0.ph.reload, i32* %sv_0.1.reg2mem
br label LBL_6
LBL_6:
%sv_0.1.reload = load i32, i32* %sv_0.1.reg2mem
%23 = call i64 @FUNC()
%24 = trunc i64 %23 to i32
%25 = icmp eq i32 %24, 0
%26 = icmp slt i32 %sv_0.1.reload, 1
br i1 %25, label LBL_9, label LBL_7
LBL_7:
br i1 %26, label LBL_13, label LBL_8
LBL_8:
%27 = mul i32 %sv_0.1.reload, 2
%28 = zext i32 %27 to i64
%29 = call i64 @FUNC(i64 %28)
br label LBL_13
LBL_9:
br i1 %26, label LBL_13, label LBL_10
LBL_10:
%30 = icmp sgt i32 %sv_0.1.reload, 1073741822
br i1 %30, label LBL_12, label LBL_11
LBL_11:
%31 = mul i32 %sv_0.1.reload, 2
%32 = zext i32 %31 to i64
%33 = call i64 @FUNC(i64 %32)
br label LBL_13
LBL_12:
%34 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_1 to i64))
br label LBL_13
LBL_13:
%35 = call i64 @FUNC(i64 40)
%36 = icmp eq i64 %0, %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 i1 %26, { 1, 0 }
uselistorder i32 %sv_0.1.reload, { 3, 0, 2, 1 }
uselistorder i32 %12, { 1, 0 }
uselistorder i32 %4, { 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.1.reg2mem, { 0, 3, 1, 2 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
uselistorder i64 ()* @globalReturnsTrueOrFalse, { 1, 0 }
uselistorder label LBL_6, { 2, 0, 1 }
uselistorder label LBL_5, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__sizeof_int64_t_04-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64* @malloc(i32 8)
%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:
store i64 2147483643, i64* %0, align 8
%3 = call i64 @FUNC(i64 2147483643)
call void @free(i64* %0)
ret i64 ptrtoint (i32* @1 to i64)
}
|
0
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__float_rand_02-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i128
%storemerge.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i128
%1 = load i128, i128* %0
%2 = call i128 @FUNC(i128 %1, i128 %1)
%3 = call i64 @FUNC(i128 %2)
%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
br i1 %6, label LBL_2, label LBL_1
LBL_1:
%14 = call i128 @FUNC(i128 %2, i128 %2)
%15 = call i128 @FUNC(i32 %13)
store i128 %15, i128* %storemerge1.reg2mem
br label LBL_3
LBL_2:
%16 = sub i32 0, %13
%17 = sub i32 %16, 1
%18 = call i128 @FUNC(i128 %2, i128 %2)
%19 = call i128 @FUNC(i32 %17)
store i128 %19, i128* %storemerge1.reg2mem
br label LBL_3
LBL_3:
%20 = icmp eq i32 %13, 0
%storemerge1.reload = load i128, i128* %storemerge1.reg2mem
%21 = call i64 @FUNC(i128 %storemerge1.reload)
%22 = trunc i64 %21 to i32
%23 = call i128 @__asm_movss.1(i32 %22)
%24 = call i128 @__asm_movss.1(i32 2147483647)
%25 = call i128 @FUNC(i128 %23, i128 %24)
%26 = call i128 @FUNC(i128 %25)
%27 = load i128, i128* @gv_0, align 8
call void @FUNC(i128 %26, i128 %27)
br i1 %20, label LBL_5, label LBL_4
LBL_4:
%28 = call i128 @FUNC(i128 %24, i128 %24)
%29 = call i128 @__asm_cvtss2sd.2(i32 %22)
%30 = call i128 @FUNC(i64 4636737291354636288)
%31 = call i128 @FUNC(i128 %30, i128 %29)
%32 = call i32 @FUNC(i128 %31)
%33 = zext i32 %32 to i64
%34 = call i64 @FUNC(i64 %33)
store i64 %34, i64* %storemerge.reg2mem
br label LBL_6
LBL_5:
%35 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_1 to i64))
store i64 %35, i64* %storemerge.reg2mem
br label LBL_6
LBL_6:
%storemerge.reload = load i64, i64* %storemerge.reg2mem
ret i64 %storemerge.reload
uselistorder i128 %24, { 1, 0, 2 }
uselistorder i32 %13, { 2, 0, 1 }
uselistorder i128 %2, { 3, 2, 1, 0, 4 }
uselistorder i128* %storemerge1.reg2mem, { 0, 2, 1 }
uselistorder i64* %storemerge.reg2mem, { 0, 2, 1 }
uselistorder i128* @gv_0, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_alloca_ncpy_13-bad
|
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_alloca_ncpy_13_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, -97
%3 = and i64 %2, -16
store i64 %3, i64* %sv_1, align 8
%4 = load i32, i32* inttoptr (i64 8336 to i32*), align 16
%5 = icmp eq i32 %4, 5
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_2, label LBL_1
LBL_1:
%7 = inttoptr i64 %3 to i64*
%8 = call i64* @memset(i64* %7, i32 65, i32 99)
%9 = add i64 %3, 99
%10 = inttoptr i64 %9 to i8*
store i8 0, i8* %10, align 1
br label LBL_2
LBL_2:
%11 = inttoptr i64 %3 to i8*
store i64 0, i64* %sv_0, align 8
%12 = call i32 @strlen(i8* %11)
%13 = bitcast i64* %sv_0 to i8*
%14 = call i8* @strncpy(i8* nonnull %13, i8* %11, i32 %12)
%15 = call i64 @FUNC(i64 %3)
%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 i8* %11, { 1, 0 }
uselistorder i64 %3, { 0, 3, 2, 1, 4 }
}
|
1
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__char_alloca_memmove_07-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i64
%rax.0.reg2mem = alloca i64
%.pre-phi.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, -49
%5 = and i64 %4, -16
%6 = add i64 %2, -161
%7 = and i64 %6, -16
%8 = inttoptr i64 %5 to i64*
%9 = call i64* @memset(i64* %8, i32 65, i32 49)
%10 = add i64 %5, 49
%11 = inttoptr i64 %10 to i8*
store i8 0, i8* %11, align 1
%12 = inttoptr i64 %7 to i64*
%13 = call i64* @memset(i64* %12, i32 65, i32 99)
%14 = add i64 %7, 99
%15 = inttoptr i64 %14 to i8*
store i8 0, i8* %15, align 1
%16 = load i32, i32* @gv_0, align 4
%17 = icmp eq i32 %16, 5
store i64* %12, i64** %.pre-phi.reg2mem
br i1 %17, label LBL_2, label LBL_1
LBL_1:
%18 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
%.pre = inttoptr i64 %1 to i64*
store i64* %.pre, i64** %.pre-phi.reg2mem
br label LBL_2
LBL_2:
%.pre-phi.reload = load i64*, i64** %.pre-phi.reg2mem
%19 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%20 = bitcast i64* %sv_0 to i8*
%21 = call i32 @strlen(i8* nonnull %20)
%22 = call i64* @memmove(i64* nonnull %sv_0, i64* %.pre-phi.reload, i32 %21)
%23 = ptrtoint i64* %sv_0 to i64
%24 = call i64 @FUNC(i64 %23)
%25 = call i64 @FUNC(i64 40)
%26 = icmp eq i64 %3, %25
store i64 0, i64* %rax.0.reg2mem
br i1 %26, 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 %7, { 1, 0 }
uselistorder i64 %5, { 1, 0 }
uselistorder i64* %sv_0, { 3, 0, 1, 2 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_int_declare_memmove_08-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
br label LBL_3
LBL_2:
%5 = ptrtoint i64* %sv_2 to i64
store i64 %5, i64* %sv_0.0.reg2mem
br label LBL_3
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%6 = bitcast i64* %sv_1 to i8*
call void @FUNC(i8* nonnull %6, i64 0, i64 50)
%7 = inttoptr i64 %sv_0.0.reload to i64*
%8 = call i64* @memmove(i64* %7, i64* nonnull %sv_1, i32 400)
%9 = inttoptr i64 %sv_0.0.reload to i32*
%10 = load i32, i32* %9, align 4
%11 = zext i32 %10 to i64
%12 = call i64 @FUNC(i64 %11)
%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
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int_rand_multiply_11-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_8
LBL_4:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%18 = icmp slt i32 %sv_0.0.reload, 0
%19 = icmp eq i1 %18, false
store i64 %14, i64* %rax.0.reg2mem
br i1 %19, label LBL_8, label LBL_5
LBL_5:
%20 = icmp slt i32 %sv_0.0.reload, -1073741823
br i1 %20, label LBL_7, label LBL_6
LBL_6:
%21 = mul i32 %sv_0.0.reload, 2
%22 = zext i32 %21 to i64
%23 = call i64 @FUNC(i64 %22)
store i64 %23, i64* %rax.0.reg2mem
br label LBL_8
LBL_7:
%24 = call i64 @FUNC(i64 ptrtoint ([51 x i8]* @gv_1 to i64))
store i64 %24, 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 i32 %sv_0.0.reload, { 2, 0, 1 }
uselistorder i64* %rax.0.reg2mem, { 0, 3, 2, 4, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE415_Double_Free__malloc_free_char_05-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
store i64 0, i64* %sv_0.0.reg2mem
br label LBL_4
LBL_2:
%3 = call i64* @malloc(i32 100)
%4 = ptrtoint i64* %3 to i64
%5 = icmp eq i64* %3, null
%6 = icmp eq i1 %5, false
store i64 %4, i64* %sv_0.0.reg2mem
br i1 %6, label LBL_4, label LBL_3
LBL_3:
call void @exit(i32 -1)
unreachable
LBL_4:
%7 = load i32, i32* @gv_2, align 4
%8 = icmp eq i32 %7, 0
store i64 0, i64* %rax.0.reg2mem
br i1 %8, label LBL_6, label LBL_5
LBL_5:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%9 = inttoptr i64 %sv_0.0.reload to i64*
call void @free(i64* %9)
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.0.reg2mem, { 0, 2, 1 }
uselistorder i32* @gv_0, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__char_fscanf_multiply_02-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i8, align 1
%0 = call i64 @FUNC(i64 40)
store i8 32, i8* %sv_0, align 1
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i8* nonnull %sv_0)
%3 = load i8, i8* %sv_0, align 1
%4 = icmp slt i8 %3, 0
%5 = icmp eq i1 %4, false
br i1 %5, label LBL_4, label LBL_1
LBL_1:
%6 = icmp slt i8 %3, -63
br i1 %6, label LBL_3, label LBL_2
LBL_2:
%7 = mul i8 %3, 2
%8 = sext i8 %7 to i64
%9 = and i64 %8, 4294967294
%10 = call i64 @FUNC(i64 %9)
br label LBL_4
LBL_3:
%11 = call i64 @FUNC(i64 ptrtoint ([51 x i8]* @gv_2 to i64))
br label LBL_4
LBL_4:
%12 = call i64 @FUNC(i64 40)
%13 = icmp eq i64 %0, %12
store i64 0, i64* %rax.0.reg2mem
br i1 %13, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %sv_0, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_environment_snprintf_14-bad
|
CWE134_Uncontrolled_Format_String__char_environment_snprintf_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_1, align 8
%1 = bitcast i64* %sv_1 to i8*
%2 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%3 = icmp eq i32 %2, 5
%4 = icmp eq i1 %3, false
br i1 %4, label LBL_3, label LBL_1
LBL_1:
%5 = call i32 @strlen(i8* nonnull %1)
%6 = call i8* @getenv(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_0, i64 0, i64 0))
%7 = icmp eq i8* %6, null
br i1 %7, label LBL_3, label LBL_2
LBL_2:
%8 = sext i32 %5 to i64
%9 = ptrtoint i64* %sv_1 to i64
%10 = add i64 %8, %9
%11 = inttoptr i64 %10 to i8*
%12 = sub i32 99, %5
%13 = call i8* @strncat(i8* %11, i8* nonnull %6, i32 %12)
br label LBL_3
LBL_3:
%14 = load i32, i32* @gv_1, align 4
%15 = icmp eq i32 %14, 5
%16 = icmp eq i1 %15, false
br i1 %16, label LBL_5, label LBL_4
LBL_4:
store i64 0, i64* %sv_0, align 8
%17 = bitcast i64* %sv_0 to i8*
%18 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %17, i32 99, i8* nonnull %1)
%19 = call i64 @FUNC(i64* nonnull %sv_0)
br label LBL_5
LBL_5:
%20 = call i64 @FUNC(i64 40)
%21 = icmp eq i64 %0, %20
store i64 0, i64* %rax.0.reg2mem
br i1 %21, 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 99, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_memcpy_05-bad
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_memcpy_05_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
store i64 0, i64* %sv_0.0.reg2mem
br i1 %2, label LBL_3, label LBL_1
LBL_1:
%3 = call i64* @malloc(i32 10)
%4 = ptrtoint i64* %3 to i64
%5 = icmp eq i64* %3, null
%6 = icmp eq i1 %5, false
store i64 %4, i64* %sv_0.0.reg2mem
br i1 %6, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
store i64 4702111234474983745, i64* %sv_1, align 8
%7 = bitcast i64* %sv_1 to i8*
%8 = call i32 @strlen(i8* nonnull %7)
%9 = add i32 %8, 1
%10 = inttoptr i64 %sv_0.0.reload to i64*
%11 = call i64* @memcpy(i64* %10, i64* nonnull %sv_1, i32 %9)
%12 = call i64 @FUNC(i64 %sv_0.0.reload)
call void @free(i64* %10)
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__unsigned_int_fscanf_postinc_07-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.reg2mem = alloca i32
%sv_0 = alloca i32, align 4
%0 = call i64 @FUNC(i64 40)
store i32 0, i32* %sv_0, align 4
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 %1, i32* %.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i32* nonnull %sv_0)
%.pr = load i32, i32* @gv_0, align 4
store i32 %.pr, i32* %.reg2mem
br label LBL_2
LBL_2:
%.reload = load i32, i32* %.reg2mem
%6 = icmp eq i32 %.reload, 5
br i1 %6, label LBL_4, label LBL_3
LBL_3:
%7 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_3 to i64))
br label LBL_7
LBL_4:
%8 = load i32, i32* %sv_0, align 4
%9 = icmp eq i32 %8, -1
br i1 %9, label LBL_6, label LBL_5
LBL_5:
%10 = add i32 %8, 1
store i32 %10, i32* %sv_0, align 4
%11 = zext i32 %10 to i64
%12 = call i64 @FUNC(i64 %11)
br label LBL_7
LBL_6:
%13 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_4 to i64))
br label LBL_7
LBL_7:
%14 = call i64 @FUNC(i64 40)
%15 = icmp eq i64 %0, %14
store i64 0, i64* %rax.0.reg2mem
br i1 %15, 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* %sv_0, { 2, 1, 3, 0 }
uselistorder i32* %.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE761_Free_Pointer_Not_at_Start_of_Buffer__char_listen_socket_12-bad
|
CWE761_Free_Pointer_Not_at_Start_of_Buffer__char_listen_socket_12_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge9.reg2mem = alloca i64
%sv_0.08.reg2mem = alloca i8*
%sv_0.010.reg2mem = alloca i8*
%.reg2mem = alloca i8
%sv_1 = 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_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_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 = call i64 @FUNC()
%36 = trunc i64 %35 to i32
%37 = icmp eq i32 %36, 0
br i1 %37, label LBL_15, label LBL_14
LBL_14:
%38 = load i8, i8* %4, align 1
%39 = icmp eq i8 %38, 0
%40 = icmp eq i1 %39, false
store i8 %38, i8* %.reg2mem
store i8* %4, i8** %sv_0.010.reg2mem
store i8* %4, i8** %sv_0.08.reg2mem
br i1 %40, label LBL_17, label LBL_20
LBL_15:
%41 = call i32 @strlen(i8* nonnull %4)
%42 = icmp eq i32 %41, 0
br i1 %42, label LBL_24, label LBL_16
LBL_16:
%43 = ptrtoint i64* %1 to i64
store i64 0, i64* %storemerge9.reg2mem
br label LBL_21
LBL_17:
%sv_0.010.reload = load i8*, i8** %sv_0.010.reg2mem
%.reload = load i8, i8* %.reg2mem
%44 = icmp eq i8 %.reload, 83
%45 = icmp eq i1 %44, false
br i1 %45, label LBL_19, label LBL_18
LBL_18:
%46 = call i64 @FUNC(i64 ptrtoint ([17 x i8]* @gv_0 to i64))
store i8* %sv_0.010.reload, i8** %sv_0.08.reg2mem
br label LBL_20
LBL_19:
%47 = ptrtoint i8* %sv_0.010.reload to i64
%48 = add i64 %47, 1
%49 = inttoptr i64 %48 to i8*
%50 = load i8, i8* %49, align 1
%51 = icmp eq i8 %50, 0
%52 = icmp eq i1 %51, false
store i8 %50, i8* %.reg2mem
store i8* %49, i8** %sv_0.010.reg2mem
store i8* %49, i8** %sv_0.08.reg2mem
br i1 %52, label LBL_17, label LBL_20
LBL_20:
%sv_0.08.reload = load i8*, i8** %sv_0.08.reg2mem
%53 = bitcast i8* %sv_0.08.reload to i64*
call void @free(i64* %53)
br label LBL_25
LBL_21:
%storemerge9.reload = load i64, i64* %storemerge9.reg2mem
%54 = add i64 %storemerge9.reload, %43
%55 = inttoptr i64 %54 to i8*
%56 = load i8, i8* %55, align 1
%57 = icmp eq i8 %56, 83
%58 = icmp eq i1 %57, false
br i1 %58, label LBL_23, label LBL_22
LBL_22:
%59 = call i64 @FUNC(i64 ptrtoint ([17 x i8]* @gv_0 to i64))
br label LBL_24
LBL_23:
%60 = add nuw i64 %storemerge9.reload, 1
%61 = call i32 @strlen(i8* %4)
%62 = sext i32 %61 to i64
%63 = icmp ult i64 %60, %62
store i64 %60, i64* %storemerge9.reg2mem
br i1 %63, label LBL_21, label LBL_24
LBL_24:
call void @free(i64* %1)
br label LBL_25
LBL_25:
%64 = call i64 @FUNC(i64 40)
%65 = icmp eq i64 %0, %64
store i64 0, i64* %rax.0.reg2mem
br i1 %65, label LBL_27, label LBL_26
LBL_26:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_27
LBL_27:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %sv_0.010.reload, { 1, 0 }
uselistorder i32 %22, { 1, 0 }
uselistorder i32 %6, { 4, 0, 1, 2, 3, 5 }
uselistorder i8* %4, { 6, 3, 0, 1, 2, 4, 5, 8, 7 }
uselistorder i64* %1, { 1, 0, 2, 4, 3 }
uselistorder i64* %sv_1, { 0, 2, 1 }
uselistorder i8* %.reg2mem, { 2, 0, 1 }
uselistorder i8** %sv_0.010.reg2mem, { 2, 0, 1 }
uselistorder i8** %sv_0.08.reg2mem, { 0, 1, 3, 2 }
uselistorder i64* %storemerge9.reg2mem, { 1, 0, 2 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i32 (i32)* @close, { 2, 1, 0, 3 }
uselistorder i8* (i8*, i32)* @strchr, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 2, 0, 1, 3 }
uselistorder i8 0, { 1, 0, 2, 3, 4, 5, 6 }
uselistorder label LBL_24, { 0, 2, 1 }
uselistorder label LBL_21, { 1, 0 }
uselistorder label LBL_20, { 0, 2, 1 }
uselistorder label LBL_17, { 1, 0 }
uselistorder label LBL_13, { 2, 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__int_pointer_14-bad
|
CWE457_Use_of_Uninitialized_Variable__int_pointer_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i32*
%rax.0.reg2mem = alloca i64
%1 = load i32*, i32** %0
%2 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%3 = zext i32 %2 to i64
%4 = icmp eq i32 %2, 5
%5 = icmp eq i1 %4, false
store i64 %3, i64* %rax.0.reg2mem
br i1 %5, label LBL_2, label LBL_1
LBL_1:
%6 = load i32, i32* %1, align 4
%7 = zext i32 %6 to i64
%8 = call i64 @FUNC(i64 %7)
store i64 %8, 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__int64_t_rand_multiply_32-bad
|
CWE190_Integer_Overflow__int64_t_rand_multiply_32_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC(i64 40)
%1 = call i32 @rand()
%2 = urem i32 %1, 2
%3 = icmp eq i32 %2, 0
%4 = call i32 @rand()
%5 = zext i32 %4 to i64
%6 = mul i64 %5, 1152921504606846976
%7 = call i32 @rand()
%8 = zext i32 %7 to i64
%9 = mul i64 %8, 35184372088832
%10 = call i32 @rand()
%11 = sext i32 %10 to i64
%12 = mul i64 %11, 1073741824
%13 = call i32 @rand()
%14 = sext i32 %13 to i64
%15 = mul i64 %14, 32768
%16 = call i32 @rand()
%17 = sext i32 %16 to i64
%18 = sext i1 %3 to i64
%19 = xor i64 %6, %18
%20 = xor i64 %19, %9
%21 = xor i64 %20, %12
%22 = xor i64 %21, %15
%storemerge = xor i64 %22, %17
%23 = icmp slt i64 %storemerge, 1
br i1 %23, label LBL_2, label LBL_1
LBL_1:
%24 = mul i64 %storemerge, 2
%25 = call i64 @FUNC(i64 %24)
br label LBL_2
LBL_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_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_declare_memmove_13-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 8360 to i32*), align 8
%2 = icmp eq i32 %1, 5
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
br label LBL_3
LBL_2:
%4 = ptrtoint i64* %sv_2 to i64
%5 = bitcast i64* %sv_2 to i8*
store i8 0, i8* %5, align 8
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
store i64 4702111234474983745, i64* %sv_1, align 8
%6 = bitcast i64* %sv_1 to i8*
%7 = call i32 @strlen(i8* nonnull %6)
%8 = add i32 %7, 1
%9 = inttoptr i64 %sv_0.0.reload to i64*
%10 = call i64* @memmove(i64* %9, i64* nonnull %sv_1, i32 %8)
%11 = call i64 @FUNC(i64 %sv_0.0.reload)
%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
|
CWE190_Integer_Overflow__int_listen_socket_add_15-bad
|
CWE190_Integer_Overflow__int_listen_socket_add_15_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.047.reg2mem = alloca i64
%sv_0.0.ph.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i32 @socket(i32 2, i32 1, i32 6)
%2 = icmp eq i32 %1, -1
store i64 1, i64* %sv_0.047.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 i64 1, i64* %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)
%phitmp = add i32 %21, 1
%phitmp2 = zext i32 %phitmp to i64
store i64 %phitmp2, i64* %sv_0.0.ph.reg2mem
br label LBL_7
LBL_6:
%22 = call i32 @close(i32 %1)
store i64 1, i64* %sv_0.047.reg2mem
br label LBL_8
LBL_7:
%sv_0.0.ph.reload = load i64, i64* %sv_0.0.ph.reg2mem
%23 = call i32 @close(i32 %1)
%24 = call i32 @close(i32 %10)
store i64 %sv_0.0.ph.reload, i64* %sv_0.047.reg2mem
br label LBL_8
LBL_8:
%sv_0.047.reload = load i64, i64* %sv_0.047.reg2mem
%25 = call i64 @FUNC(i64 %sv_0.047.reload)
%26 = call i64 @FUNC(i64 40)
%27 = icmp eq i64 %0, %26
store i64 0, i64* %rax.0.reg2mem
br i1 %27, 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 %12, { 1, 0 }
uselistorder i32 %1, { 4, 0, 1, 2, 3, 5 }
uselistorder i64* %sv_2, { 0, 2, 1 }
uselistorder i64* %sv_0.0.ph.reg2mem, { 0, 2, 1 }
uselistorder i64* %sv_0.047.reg2mem, { 0, 3, 2, 1 }
uselistorder i32 (i32)* @close, { 2, 1, 0, 3 }
uselistorder label LBL_8, { 2, 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__int_zero_divide_11-bad
|
CWE369_Divide_by_Zero__int_zero_divide_11_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
store i64 %1, i64* %rax.0.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 0)
store i64 %4, i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 ()* @globalReturnsTrue, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_console_printf_14-bad
|
CWE134_Uncontrolled_Format_String__char_console_printf_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 = bitcast i64* %sv_0 to i8*
%2 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%3 = icmp eq i32 %2, 5
%4 = icmp eq i1 %3, false
br i1 %4, label LBL_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_0, 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_1 to i64))
store i8 0, i8* %13, align 1
br label LBL_7
LBL_7:
%26 = load i32, i32* @gv_2, 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 (i8*, ...) @printf(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, 0 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE404_Improper_Resource_Shutdown__open_fclose_02-good
|
goodB2G2
|
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
uselistorder i32 (i32)* @close, { 1, 0, 2 }
uselistorder i32 (i8*, i32, ...)* @open, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_struct_memcpy_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
%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
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* @memcpy(i64* %16, i64* nonnull %sv_1, i32 ptrtoint (i32* @gv_1 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 i64* (i32)* @malloc, { 1, 0, 2 }
uselistorder i32 ptrtoint (i32* @gv_1 to i32), { 0, 1, 3, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE197_Numeric_Truncation_Error__short_fgets_32-bad
|
CWE197_Numeric_Truncation_Error__short_fgets_32_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)
store i64 0, i64* %sv_1, align 8
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = bitcast i64* %sv_1 to i8*
%3 = call i8* @fgets(i8* nonnull %2, i32 8, %_IO_FILE* %1)
%4 = icmp eq i8* %3, null
br i1 %4, label LBL_2, label LBL_1
LBL_1:
%5 = call i32 @atoi(i8* nonnull %2)
%phitmp3 = mul i32 %5, 16777216
%phitmp4 = ashr exact i32 %phitmp3, 24
%phitmp5 = zext i32 %phitmp4 to i64
store i64 %phitmp5, i64* %sv_0.0.reg2mem
br label LBL_3
LBL_2:
%6 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64))
store i64 4294967295, i64* %sv_0.0.reg2mem
br label LBL_3
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%7 = call i64 @FUNC(i64 %sv_0.0.reload)
%8 = call i64 @FUNC(i64 40)
%9 = icmp eq i64 %0, %8
store i64 0, i64* %rax.0.reg2mem
br i1 %9, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_0.0.reg2mem, { 0, 2, 1 }
}
|
1
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__char_declare_memmove_06-bad
|
CWE126_Buffer_Overread__char_declare_memmove_06_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 i64* @memset(i64* nonnull %sv_2, i32 65, i32 49)
%2 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
%3 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%4 = bitcast i64* %sv_0 to i8*
%5 = call i32 @strlen(i8* nonnull %4)
%6 = call i64* @memmove(i64* nonnull %sv_0, i64* nonnull %sv_2, i32 %5)
%7 = call i64 @FUNC(i64* nonnull %sv_0)
%8 = call i64 @FUNC(i64 40)
%9 = icmp eq i64 %0, %8
store i64 0, i64* %rax.0.reg2mem
br i1 %9, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
1
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__int_fgets_divide_12-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
store i64 0, i64* %sv_1, align 8
%4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%5 = bitcast i64* %sv_1 to i8*
%6 = call i8* @fgets(i8* nonnull %5, i32 14, %_IO_FILE* %4)
%7 = icmp eq i8* %6, null
br i1 %3, label LBL_4, label LBL_1
LBL_1:
br i1 %7, label LBL_3, label LBL_2
LBL_2:
%8 = call i32 @atoi(i8* nonnull %5)
store i32 %8, i32* %sv_0.0.reg2mem
br label LBL_7
LBL_3:
%9 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64))
store i32 -1, i32* %sv_0.0.reg2mem
br label LBL_7
LBL_4:
br i1 %7, label LBL_6, label LBL_5
LBL_5:
%10 = call i32 @atoi(i8* nonnull %5)
store i32 %10, i32* %sv_0.0.reg2mem
br label LBL_7
LBL_6:
%11 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64))
store i32 -1, i32* %sv_0.0.reg2mem
br label LBL_7
LBL_7:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%12 = call i64 @FUNC()
%13 = trunc i64 %12 to i32
%14 = icmp eq i32 %13, 0
%15 = icmp eq i32 %sv_0.0.reload, 0
br i1 %14, label LBL_11, label LBL_8
LBL_8:
br i1 %15, label LBL_10, label LBL_9
LBL_9:
%16 = udiv i32 100, %sv_0.0.reload
%17 = zext i32 %16 to i64
%18 = call i64 @FUNC(i64 %17)
br label LBL_14
LBL_10:
%19 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_2 to i64))
br label LBL_14
LBL_11:
br i1 %15, label LBL_13, label LBL_12
LBL_12:
%20 = udiv i32 100, %sv_0.0.reload
%21 = zext i32 %20 to i64
%22 = call i64 @FUNC(i64 %21)
br label LBL_14
LBL_13:
%23 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_2 to i64))
br label LBL_14
LBL_14:
%24 = call i64 @FUNC(i64 40)
%25 = icmp eq i64 %0, %24
store i64 0, i64* %rax.0.reg2mem
br i1 %25, label LBL_16, label LBL_15
LBL_15:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_16
LBL_16:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i1 %15, { 1, 0 }
uselistorder i32 %sv_0.0.reload, { 1, 0, 2 }
uselistorder i1 %7, { 1, 0 }
uselistorder i8* %5, { 1, 0, 2 }
uselistorder i32* %sv_0.0.reg2mem, { 0, 4, 3, 2, 1 }
uselistorder i32 -1, { 1, 0 }
uselistorder i32 (i8*)* @atoi, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__int_malloc_17-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64* @malloc(i32 4)
%1 = ptrtoint i64* %0 to i64
%2 = icmp eq i64* %0, null
store i64 %1, i64* %rax.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = bitcast i64* %0 to i32*
store i32 5, i32* %3, align 4
%4 = call i64 @FUNC(i64 5)
call void @free(i64* nonnull %0)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__CWE129_rand_05-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
store i32 -1, 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 = load i32, i32* @gv_1, align 4
%15 = icmp eq i32 %14, 0
br i1 %15, label LBL_4, label LBL_3
LBL_3:
%16 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64))
br label LBL_7
LBL_4:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%17 = icmp ugt i32 %sv_0.0.reload, 9
br i1 %17, label LBL_6, label LBL_5
LBL_5:
%18 = ptrtoint i64* %sv_1 to i64
%19 = sext i32 %sv_0.0.reload to i64
%20 = mul i64 %19, 4
%21 = add i64 %18, -64
%22 = add i64 %21, %20
%23 = inttoptr i64 %22 to i32*
%24 = load i32, i32* %23, align 4
%25 = zext i32 %24 to i64
%26 = call i64 @FUNC(i64 %25)
br label LBL_7
LBL_6:
%27 = call i64 @FUNC(i64 ptrtoint ([36 x i8]* @gv_3 to i64))
br label LBL_7
LBL_7:
%28 = call i64 @FUNC(i64 40)
%29 = icmp eq i64 %0, %28
store i64 0, i64* %rax.0.reg2mem
br i1 %29, 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
}
|
0
|
juliet-test-suite-c
|
CWE563_Unused_Variable__unused_value_long_14-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.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
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 5)
%.pre = load i32, i32* @gv_0, align 4
store i32 %.pre, i32* %.reg2mem
br label LBL_2
LBL_2:
%.reload = load i32, i32* %.reg2mem
%4 = zext i32 %.reload to i64
%5 = icmp eq i32 %.reload, 5
%6 = icmp eq i1 %5, false
store i64 %4, i64* %rax.0.reg2mem
br i1 %6, label LBL_4, label LBL_3
LBL_3:
%7 = call i64 @FUNC(i64 10)
store i64 %7, i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %.reg2mem, { 0, 2, 1 }
uselistorder i64 (i64)* @printLongLine, { 5, 4, 3, 2, 1, 0 }
uselistorder i64 5, { 2, 3, 0, 1 }
uselistorder i32 5, { 0, 1, 2, 3, 4, 6, 5, 7 }
uselistorder i32* @gv_0, { 0, 5, 4, 3, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__short_fscanf_add_07-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.reg2mem = alloca i32
%sv_0 = alloca i16, align 2
%0 = call i64 @FUNC(i64 40)
store i16 0, i16* %sv_0, align 2
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 %1, i32* %.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_2, i64 0, i64 0), i16* nonnull %sv_0)
%.pr = load i32, i32* @gv_0, align 4
store i32 %.pr, i32* %.reg2mem
br label LBL_2
LBL_2:
%.reload = load i32, i32* %.reg2mem
%6 = icmp eq i32 %.reload, 5
br i1 %6, label LBL_4, label LBL_3
LBL_3:
%7 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_3 to i64))
br label LBL_7
LBL_4:
%8 = load i16, i16* %sv_0, align 2
%9 = icmp eq i16 %8, 32767
br i1 %9, label LBL_6, label LBL_5
LBL_5:
%10 = add i16 %8, 1
%11 = sext i16 %10 to i64
%12 = and i64 %11, 4294967295
%13 = call i64 @FUNC(i64 %12)
br label LBL_7
LBL_6:
%14 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_4 to i64))
br label LBL_7
LBL_7:
%15 = call i64 @FUNC(i64 40)
%16 = icmp eq i64 %0, %15
store i64 0, i64* %rax.0.reg2mem
br i1 %16, label LBL_9, label LBL_8
LBL_8:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_9
LBL_9:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i16* %sv_0, { 1, 0, 2 }
uselistorder i32* %.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int64_t_max_multiply_14-bad
|
CWE190_Integer_Overflow__int64_t_max_multiply_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%1 = icmp eq i32 %0, 5
%2 = load i32, i32* @gv_0, align 4
%3 = zext i32 %2 to i64
%4 = icmp eq i32 %2, 5
%5 = icmp eq i1 %1, %4
store i64 %3, i64* %rax.0.reg2mem
br i1 %5, label LBL_1, label LBL_2
LBL_1:
%6 = call i64 @FUNC(i64 -2)
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 label LBL_2, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__char_calloc_10-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64* @calloc(i32 20, i32 1)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
store i64 %3, i64* %rax.0.reg2mem
br label LBL_4
LBL_2:
%4 = icmp eq i64* %0, null
store i64 0, i64* %rax.0.reg2mem
br i1 %4, label LBL_4, label LBL_3
LBL_3:
%5 = ptrtoint i64* %0 to i64
store i64 7596553777019711049, i64* %0, align 8
%6 = add i64 %5, 8
%7 = inttoptr i64 %6 to i16*
store i16 25978, i16* %7, align 2
%8 = add i64 %5, 10
%9 = inttoptr i64 %8 to i8*
store i8 0, i8* %9, align 1
%10 = call i64 @FUNC(i64 %5)
call void @free(i64* nonnull %0)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %5, { 0, 2, 1 }
uselistorder i64* %0, { 0, 1, 3, 2 }
uselistorder i64* %rax.0.reg2mem, { 0, 2, 3, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE400_Resource_Exhaustion__fscanf_sleep_10-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i32, align 4
%0 = call i64 @FUNC(i64 40)
store i32 -1, i32* %sv_0, align 4
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_5, label LBL_1
LBL_1:
%3 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%4 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %3, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i32* nonnull %sv_0)
%.pr = load i32, i32* @gv_0, align 4
%5 = icmp eq i32 %.pr, 0
br i1 %5, label LBL_5, label LBL_2
LBL_2:
%6 = load i32, i32* %sv_0, align 4
%7 = icmp slt i32 %6, 1
%8 = icmp sgt i32 %6, ptrtoint (i1* @gv_3 to i32)
%or.cond = or i1 %7, %8
br i1 %or.cond, label LBL_4, label LBL_3
LBL_3:
%9 = call i32 @usleep(i32 %6)
%10 = call i64 @FUNC(i64 ptrtoint ([14 x i8]* @gv_4 to i64))
br label LBL_5
LBL_4:
%11 = call i64 @FUNC(i64 ptrtoint ([20 x i8]* @gv_5 to i64))
br label LBL_5
LBL_5:
%12 = call i64 @FUNC(i64 40)
%13 = icmp eq i64 %0, %12
store i64 0, i64* %rax.0.reg2mem
br i1 %13, 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, { 1, 0, 2 }
uselistorder %_IO_FILE** @gv_1, { 1, 0 }
uselistorder label LBL_5, { 1, 2, 3, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_declare_ncpy_03-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 = ptrtoint i64* %sv_1 to i64
%2 = bitcast i64* %sv_1 to i8*
store i8 0, i8* %2, align 8
%3 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%4 = bitcast i64* %sv_0 to i8*
%5 = call i8* @strncpy(i8* nonnull %2, i8* nonnull %4, i32 99)
%6 = add i64 %1, 99
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 1
%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
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int64_t_fscanf_postdec_07-bad
|
CWE191_Integer_Underflow__int64_t_fscanf_postdec_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.reg2mem = alloca i32
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 %1, i32* %.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_2, i64 0, i64 0), i64* nonnull %sv_0)
%.pre = load i32, i32* @gv_0, align 4
store i32 %.pre, i32* %.reg2mem
br label LBL_2
LBL_2:
%.reload = load i32, i32* %.reg2mem
%6 = icmp eq i32 %.reload, 5
%7 = icmp eq i1 %6, false
br i1 %7, label LBL_4, label LBL_3
LBL_3:
%8 = load i64, i64* %sv_0, align 8
%9 = add i64 %8, -1
store i64 %9, i64* %sv_0, align 8
%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, 2, 0, 3 }
uselistorder i32* %.reg2mem, { 0, 2, 1 }
uselistorder %_IO_FILE** @gv_1, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE195_Signed_to_Unsigned_Conversion_Error__connect_socket_memcpy_15-bad
|
CWE195_Signed_to_Unsigned_Conversion_Error__connect_socket_memcpy_15_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.034.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
br i1 %3, label LBL_1, label LBL_2
LBL_1:
store i64 0, i64* %sv_2, align 8
%4 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
store i32 -1, i32* %sv_0.034.reg2mem
br label LBL_6
LBL_2:
%5 = call i64* @memset(i64* nonnull %sv_3, i32 0, i32 16)
store i64 2, i64* %sv_3, align 8
%6 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%7 = call i16 @htons(i16 27015)
%8 = bitcast i64* %sv_3 to %sockaddr*
%9 = call i32 @connect(i32 %2, %sockaddr* nonnull %8, i32 16)
%10 = icmp eq i32 %9, -1
store i32 -1, i32* %sv_0.0.ph.reg2mem
br i1 %10, label LBL_5, label LBL_3
LBL_3:
%11 = call i32 @recv(i32 %2, i64* nonnull %sv_2, i32 13, i32 0)
%12 = add i32 %11, 1
%13 = icmp ult i32 %12, 2
store i32 -1, i32* %sv_0.0.ph.reg2mem
br i1 %13, label LBL_5, label LBL_4
LBL_4:
%14 = sext i32 %11 to i64
%15 = add i64 %0, -112
%16 = add i64 %15, %14
%17 = inttoptr i64 %16 to i8*
store i8 0, i8* %17, align 1
%18 = bitcast i64* %sv_2 to i8*
%19 = call i32 @atoi(i8* nonnull %18)
store i32 %19, 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
%20 = call i32 @close(i32 %2)
store i64 0, i64* %sv_2, align 8
%21 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
%22 = icmp sgt i32 %sv_0.0.ph.reload, 99
store i32 %sv_0.0.ph.reload, i32* %sv_0.034.reg2mem
br i1 %22, label LBL_7, label LBL_6
LBL_6:
%sv_0.034.reload = load i32, i32* %sv_0.034.reg2mem
%23 = call i64* @memcpy(i64* nonnull %sv_2, i64* nonnull %sv_1, i32 %sv_0.034.reload)
%24 = sext i32 %sv_0.034.reload to i64
%25 = add i64 %0, -112
%26 = add i64 %25, %24
%27 = inttoptr i64 %26 to i8*
store i8 0, i8* %27, align 1
br label LBL_7
LBL_7:
%28 = call i64 @FUNC(i64* nonnull %sv_2)
%29 = call i64 @FUNC(i64 40)
%30 = icmp eq i64 %1, %29
store i64 0, i64* %rax.0.reg2mem
br i1 %30, 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 %sv_0.034.reload, { 1, 0 }
uselistorder i32 %11, { 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, { 1, 2, 5, 3, 4, 0 }
uselistorder i64* %sv_1, { 1, 2, 0 }
uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 3, 2, 1 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 2, 0, 3 }
uselistorder i32 99, { 2, 1, 0 }
uselistorder i32 65, { 1, 0 }
uselistorder i32 -1, { 2, 1, 3, 0, 4 }
uselistorder label LBL_6, { 1, 0 }
uselistorder label LBL_5, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_listen_socket_snprintf_01-bad
|
CWE134_Uncontrolled_Format_String__char_listen_socket_snprintf_01_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 i32 @strlen(i8* nonnull %1)
%3 = call i32 @socket(i32 2, i32 1, i32 6)
%4 = icmp eq i32 %3, -1
br i1 %4, label LBL_11, label LBL_1
LBL_1:
%5 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16)
store i64 2, i64* %sv_1, align 8
%6 = call i16 @htons(i16 27015)
%7 = bitcast i64* %sv_1 to %sockaddr*
%8 = call i32 @bind(i32 %3, %sockaddr* nonnull %7, i32 16)
%9 = icmp eq i32 %8, -1
br i1 %9, label LBL_9, label LBL_2
LBL_2:
%10 = call i32 @listen(i32 %3, i32 5)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_9, 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_9, label LBL_4
LBL_4:
%14 = sext i32 %2 to i64
%15 = ptrtoint i64* %sv_2 to i64
%16 = add i64 %14, %15
%17 = inttoptr i64 %16 to i64*
%18 = sub i32 99, %2
%19 = call i32 @recv(i32 %12, i64* %17, i32 %18, i32 0)
%20 = add i32 %19, 1
%21 = icmp ult i32 %20, 2
br i1 %21, label LBL_10, label LBL_5
LBL_5:
%22 = sext i32 %19 to i64
%23 = add i64 %16, %22
%24 = inttoptr i64 %23 to i8*
store i8 0, i8* %24, align 1
%25 = call i8* @strchr(i8* nonnull %1, i32 13)
%26 = icmp eq i8* %25, null
br i1 %26, label LBL_7, label LBL_6
LBL_6:
store i8 0, i8* %25, align 1
br label LBL_7
LBL_7:
%27 = call i8* @strchr(i8* nonnull %1, i32 10)
%28 = icmp eq i8* %27, null
br i1 %28, label LBL_10, label LBL_8
LBL_8:
store i8 0, i8* %27, align 1
br label LBL_10
LBL_9:
%29 = call i32 @close(i32 %3)
br label LBL_11
LBL_10:
%30 = call i32 @close(i32 %3)
%31 = call i32 @close(i32 %12)
br label LBL_11
LBL_11:
store i64 0, i64* %sv_0, align 8
%32 = bitcast i64* %sv_0 to i8*
%33 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %32, i32 99, i8* nonnull %1)
%34 = call i64 @FUNC(i64* nonnull %sv_0)
%35 = call i64 @FUNC(i64 40)
%36 = icmp eq i64 %0, %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 %19, { 1, 0 }
uselistorder i32 %3, { 4, 0, 1, 2, 3, 5 }
uselistorder i8* %1, { 2, 0, 1, 3 }
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 label LBL_11, { 2, 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_declare_ncpy_07-bad
|
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_declare_ncpy_07_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
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_0.LBL_3_crit_edge, label LBL_2
LBL_1:
%.pre = ptrtoint i64* %sv_1 to i64
store i64 %.pre, i64* %.pre-phi.reg2mem
br label LBL_3
LBL_2:
%4 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
%5 = ptrtoint i64* %sv_1 to i64
%6 = add i64 %5, 99
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 1
store i64 %5, i64* %.pre-phi.reg2mem
br label LBL_3
LBL_3:
%8 = bitcast i64* %sv_1 to i8*
%.pre-phi.reload = load i64, i64* %.pre-phi.reg2mem
store i64 0, i64* %sv_0, align 8
%9 = call i32 @strlen(i8* nonnull %8)
%10 = bitcast i64* %sv_0 to i8*
%11 = call i8* @strncpy(i8* nonnull %10, i8* nonnull %8, i32 %9)
%12 = call i64 @FUNC(i64 %.pre-phi.reload)
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %8, { 1, 0 }
uselistorder i64* %sv_1, { 3, 1, 2, 0 }
uselistorder label LBL_3, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_listen_socket_printf_31-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_1, align 8
%1 = bitcast i64* %sv_1 to i8*
%2 = call i32 @strlen(i8* nonnull %1)
%3 = call i32 @socket(i32 2, i32 1, i32 6)
%4 = icmp eq i32 %3, -1
br i1 %4, label LBL_11, label LBL_1
LBL_1:
%5 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16)
store i64 2, i64* %sv_0, align 8
%6 = call i16 @htons(i16 27015)
%7 = bitcast i64* %sv_0 to %sockaddr*
%8 = call i32 @bind(i32 %3, %sockaddr* nonnull %7, i32 16)
%9 = icmp eq i32 %8, -1
br i1 %9, label LBL_9, label LBL_2
LBL_2:
%10 = call i32 @listen(i32 %3, i32 5)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_9, 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_9, label LBL_4
LBL_4:
%14 = sext i32 %2 to i64
%15 = ptrtoint i64* %sv_1 to i64
%16 = add i64 %14, %15
%17 = inttoptr i64 %16 to i64*
%18 = sub i32 99, %2
%19 = call i32 @recv(i32 %12, i64* %17, i32 %18, i32 0)
%20 = add i32 %19, 1
%21 = icmp ult i32 %20, 2
br i1 %21, label LBL_10, label LBL_5
LBL_5:
%22 = sext i32 %19 to i64
%23 = add i64 %16, %22
%24 = inttoptr i64 %23 to i8*
store i8 0, i8* %24, align 1
%25 = call i8* @strchr(i8* nonnull %1, i32 13)
%26 = icmp eq i8* %25, null
br i1 %26, label LBL_7, label LBL_6
LBL_6:
store i8 0, i8* %25, align 1
br label LBL_7
LBL_7:
%27 = call i8* @strchr(i8* nonnull %1, i32 10)
%28 = icmp eq i8* %27, null
br i1 %28, label LBL_10, label LBL_8
LBL_8:
store i8 0, i8* %27, align 1
br label LBL_10
LBL_9:
%29 = call i32 @close(i32 %3)
br label LBL_11
LBL_10:
%30 = call i32 @close(i32 %3)
%31 = call i32 @close(i32 %12)
br label LBL_11
LBL_11:
%32 = call i32 @puts(i8* nonnull %1)
%33 = call i64 @FUNC(i64 40)
%34 = icmp eq i64 %0, %33
store i64 0, i64* %rax.0.reg2mem
br i1 %34, 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 %19, { 1, 0 }
uselistorder i32 %3, { 4, 0, 1, 2, 3, 5 }
uselistorder i8* %1, { 2, 0, 1, 3 }
uselistorder i64* %sv_0, { 0, 2, 1 }
uselistorder i32 (i32)* @close, { 2, 1, 0, 3 }
uselistorder label LBL_11, { 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE195_Signed_to_Unsigned_Conversion_Error__fgets_malloc_05-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
%spec.select = select i1 %1, i32 -1, i32 99
%2 = call i64* @malloc(i32 %spec.select)
%3 = icmp eq i64* %2, null
%4 = icmp eq i1 %3, false
br i1 %4, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%5 = ptrtoint i64* %2 to i64
%6 = add nsw i32 %spec.select, -1
%7 = call i64* @memset(i64* %2, i32 65, i32 %6)
%8 = sext i32 %6 to i64
%9 = add i64 %8, %5
%10 = inttoptr i64 %9 to i8*
store i8 0, i8* %10, align 1
%11 = call i64 @FUNC(i64 %5)
call void @free(i64* %2)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64 %5, { 1, 0 }
uselistorder i64* %2, { 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 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_int64_t_memmove_17-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32))
%2 = icmp eq i64* %1, null
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%4 = bitcast i64* %sv_0 to i8*
call void @FUNC(i8* nonnull %4, i64 0, i64 100)
%5 = call i64* @memmove(i64* %1, i64* nonnull %sv_0, i32 ptrtoint (i32* @gv_0 to i32))
%6 = load i64, i64* %1, align 8
%7 = call i64 @FUNC(i64 %6)
call void @free(i64* %1)
%8 = call i64 @FUNC(i64 40)
%9 = icmp eq i64 %0, %8
store i64 0, i64* %rax.0.reg2mem
br i1 %9, 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, { 2, 1, 0, 3 }
uselistorder i32 ptrtoint (i32* @gv_0 to i32), { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__unsigned_int_fscanf_multiply_07-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.reg2mem = alloca i32
%sv_0 = alloca i32, align 4
%0 = call i64 @FUNC(i64 40)
store i32 0, i32* %sv_0, align 4
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 %1, i32* %.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i32* nonnull %sv_0)
%.pr = load i32, i32* @gv_0, align 4
store i32 %.pr, i32* %.reg2mem
br label LBL_2
LBL_2:
%.reload = load i32, i32* %.reg2mem
%6 = icmp eq i32 %.reload, 5
br i1 %6, label LBL_4, label LBL_3
LBL_3:
%7 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_3 to i64))
br label LBL_8
LBL_4:
%8 = load i32, i32* %sv_0, align 4
%9 = icmp eq i32 %8, 0
br i1 %9, label LBL_8, label LBL_5
LBL_5:
%10 = icmp ult i32 %8, 2147483647
br i1 %10, label LBL_6, label LBL_7
LBL_6:
%11 = mul i32 %8, 2
%12 = zext i32 %11 to i64
%13 = call i64 @FUNC(i64 %12)
br label LBL_8
LBL_7:
%14 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_4 to i64))
br label LBL_8
LBL_8:
%15 = call i64 @FUNC(i64 40)
%16 = icmp eq i64 %0, %15
store i64 0, i64* %rax.0.reg2mem
br i1 %16, 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, { 1, 2, 0 }
uselistorder i32* %.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE127_Buffer_Underread__char_declare_memmove_15-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 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
%2 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%3 = call i64* @memmove(i64* nonnull %sv_0, i64* nonnull %sv_1, i32 100)
%4 = call i64 @FUNC(i64* nonnull %sv_0)
%5 = call i64 @FUNC(i64 40)
%6 = icmp eq i64 %0, %5
store i64 0, i64* %rax.0.reg2mem
br i1 %6, 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*, i64*, i32)* @memmove, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 3, 2, 1, 0, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__int_array_alloca_no_init_12-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%indvars.iv.reg2mem = alloca i64
%indvars.iv10.reg2mem = alloca i64
%indvars.iv13.reg2mem = alloca i64
%storemerge29.reg2mem = alloca i32
%sv_0 = alloca i32, align 4
%0 = ptrtoint i32* %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 = call i64 @FUNC()
%6 = trunc i64 %5 to i32
%7 = icmp eq i32 %6, 0
store i64 0, i64* %indvars.iv10.reg2mem
br i1 %7, label LBL_4, label LBL_1
LBL_1:
store i32 0, i32* %sv_0, align 4
store i32 0, i32* %storemerge29.reg2mem
br label LBL_2
LBL_2:
%storemerge29.reload = load i32, i32* %storemerge29.reg2mem
%8 = sext i32 %storemerge29.reload to i64
%9 = mul i64 %8, 4
%10 = add i64 %9, %3
%11 = inttoptr i64 %10 to i32*
store i32 %storemerge29.reload, i32* %11, align 4
%12 = load i32, i32* %sv_0, align 4
%13 = add i32 %12, 1
store i32 %13, i32* %sv_0, align 4
%14 = icmp slt i32 %13, 10
store i32 %13, i32* %storemerge29.reg2mem
store i64 0, i64* %indvars.iv13.reg2mem
br i1 %14, label LBL_2, label LBL_3
LBL_3:
%indvars.iv13.reload = load i64, i64* %indvars.iv13.reg2mem
%15 = mul i64 %indvars.iv13.reload, 4
%16 = add i64 %15, %3
%17 = inttoptr i64 %16 to i32*
%18 = load i32, i32* %17, align 4
%19 = zext i32 %18 to i64
%20 = call i64 @FUNC(i64 %19)
%indvars.iv.next14 = add nuw nsw i64 %indvars.iv13.reload, 1
%exitcond15 = icmp eq i64 %indvars.iv.next14, 10
store i64 %indvars.iv.next14, i64* %indvars.iv13.reg2mem
br i1 %exitcond15, label LBL_6, label LBL_3
LBL_4:
%indvars.iv10.reload = load i64, i64* %indvars.iv10.reg2mem
%21 = mul i64 %indvars.iv10.reload, 4
%22 = add i64 %21, %3
%23 = inttoptr i64 %22 to i32*
%24 = trunc i64 %indvars.iv10.reload to i32
store i32 %24, i32* %23, align 4
%indvars.iv.next11 = add nuw nsw i64 %indvars.iv10.reload, 1
%exitcond12 = icmp eq i64 %indvars.iv.next11, 10
store i64 %indvars.iv.next11, i64* %indvars.iv10.reg2mem
store i64 0, i64* %indvars.iv.reg2mem
br i1 %exitcond12, label LBL_5, label LBL_4
LBL_5:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%25 = mul i64 %indvars.iv.reload, 4
%26 = add i64 %25, %3
%27 = inttoptr i64 %26 to i32*
%28 = load i32, i32* %27, align 4
%29 = zext i32 %28 to i64
%30 = call i64 @FUNC(i64 %29)
%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_6, label LBL_5
LBL_6:
%31 = call i64 @FUNC(i64 40)
%32 = icmp eq i64 %1, %31
store i64 0, i64* %rax.0.reg2mem
br i1 %32, 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 i32 %13, { 0, 2, 1 }
uselistorder i32 %storemerge29.reload, { 1, 0 }
uselistorder i32* %sv_0, { 1, 3, 0, 2 }
uselistorder i32* %storemerge29.reg2mem, { 1, 0, 2 }
uselistorder i64* %indvars.iv13.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv10.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 }
uselistorder label LBL_6, { 1, 0 }
uselistorder label LBL_5, { 1, 0 }
uselistorder label LBL_4, { 1, 0 }
uselistorder label LBL_3, { 1, 0 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE127_Buffer_Underread__char_declare_loop_07-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i64
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%1 = load i64, i64* %0
%2 = call i64 @FUNC(i64 40)
%3 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
%4 = load i32, i32* @gv_0, align 4
%5 = icmp eq i32 %4, 5
%6 = icmp eq i1 %5, false
%7 = ptrtoint i64* %sv_1 to i64
%spec.select = select i1 %6, i64 %1, i64 %7
%8 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%9 = ptrtoint i64* %sv_0 to i64
store i64 0, i64* %storemerge1.reg2mem
br label LBL_1
LBL_1:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%10 = add i64 %storemerge1.reload, %spec.select
%11 = inttoptr i64 %10 to i8*
%12 = load i8, i8* %11, align 1
%13 = add i64 %storemerge1.reload, %9
%14 = inttoptr i64 %13 to i8*
store i8 %12, i8* %14, align 1
%15 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %15, 100
store i64 %15, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_2, label LBL_1
LBL_2:
%16 = call i64 @FUNC(i64 %9)
%17 = call i64 @FUNC(i64 40)
%18 = icmp eq i64 %2, %17
store i64 0, i64* %rax.0.reg2mem
br i1 %18, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %storemerge1.reload, { 0, 2, 1 }
uselistorder i64 %9, { 1, 0 }
uselistorder i64* %sv_1, { 1, 0 }
uselistorder i64* %sv_0, { 1, 0 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder i32* @gv_0, { 1, 0 }
uselistorder i64* (i64*, i32, i32)* @memset, { 3, 2, 1, 0, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE675_Duplicate_Operations_on_Resource__fopen_04-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([21 x i8], [21 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0))
%1 = call i32 @fclose(%_IO_FILE* %0)
%2 = sext i32 %1 to i64
ret i64 %2
uselistorder i32 (%_IO_FILE*)* @fclose, { 1, 3, 0, 2, 4 }
uselistorder %_IO_FILE* (i8*, i8*)* @fopen, { 0, 1, 3, 2, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE789_Uncontrolled_Mem_Alloc__malloc_char_fgets_32-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = bitcast i64* %sv_0 to i8*
%3 = call i8* @fgets(i8* nonnull %2, i32 26, %_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_6
LBL_2:
%6 = call i32 @strtoul(i8* nonnull %2, i8** null, i32 0)
%.off = add i32 %6, -6
%7 = icmp ult i32 %.off, 94
br i1 %7, label LBL_3, label LBL_6
LBL_3:
%8 = call i64* @malloc(i32 %6)
%9 = icmp eq i64* %8, null
%10 = icmp eq i1 %9, false
br i1 %10, label LBL_5, label LBL_4
LBL_4:
call void @exit(i32 -1)
unreachable
LBL_5:
%11 = ptrtoint i64* %8 to i64
%12 = bitcast i64* %8 to i32*
store i32 1819043176, i32* %12, align 4
%13 = add i64 %11, 4
%14 = inttoptr i64 %13 to i16*
store i16 111, i16* %14, align 2
%15 = call i64 @FUNC(i64 %11)
call void @free(i64* %8)
br label LBL_7
LBL_6:
%16 = call i64 @FUNC(i64 ptrtoint ([64 x i8]* @gv_2 to i64))
br label LBL_7
LBL_7:
%17 = call i64 @FUNC(i64 40)
%18 = icmp eq i64 %0, %17
store i64 0, i64* %rax.0.reg2mem
br i1 %18, label LBL_9, label LBL_8
LBL_8:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_9
LBL_9:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %8, { 0, 1, 3, 2 }
uselistorder i32 %6, { 1, 0 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
uselistorder label LBL_6, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_connect_socket_popen_07-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 2126700, i64* %sv_0, align 8
%1 = bitcast i64* %sv_0 to i8*
%2 = load i32, i32* @gv_0, align 4
%3 = icmp eq i32 %2, 5
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
br label LBL_3
LBL_2:
%5 = call i32 @strlen(i8* nonnull %1)
%6 = sext i32 %5 to i64
%7 = ptrtoint i64* %sv_0 to i64
%8 = add i64 %6, %7
%9 = inttoptr i64 %8 to i32*
store i32 2764330, i32* %9, align 4
br label LBL_3
LBL_3:
%10 = call %_IO_FILE* @popen(i8* nonnull %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_2, i64 0, i64 0))
%11 = icmp eq %_IO_FILE* %10, null
br i1 %11, label LBL_5, label LBL_4
LBL_4:
%12 = call i32 @pclose(%_IO_FILE* nonnull %10)
br label LBL_5
LBL_5:
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, 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
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__char_type_overrun_memmove_05-bad
|
CWE122_Heap_Based_Buffer_Overflow__char_type_overrun_memmove_05_bad
|
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_4, label LBL_1
LBL_1:
%2 = call i64* @malloc(i32 32)
%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:
%5 = ptrtoint i64* %2 to i64
%6 = add i64 %5, 16
%7 = inttoptr i64 %6 to i64*
store i64 ptrtoint ([32 x i8]* @gv_1 to i64), i64* %7, align 8
%8 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_1 to i64))
store i64 3978425819141910832, i64* %2, align 8
%9 = add i64 %5, 8
%10 = inttoptr i64 %9 to i64*
store i64 7378413942531504440, i64* %10, align 8
store i64 3978425819141910832, i64* %7, align 8
%11 = add i64 %5, 24
%12 = inttoptr i64 %11 to i64*
store i64 28539350662854968, i64* %12, align 8
%13 = add i64 %5, 15
%14 = inttoptr i64 %13 to i8*
store i8 0, i8* %14, align 1
%15 = call i64 @FUNC(i64 %5)
%16 = load i64, i64* %7, align 8
%17 = call i64 @FUNC(i64 %16)
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 %5, { 0, 1, 3, 2, 4 }
uselistorder i64* %2, { 0, 2, 1 }
}
|
1
|
juliet-test-suite-c
|
CWE775_Missing_Release_of_File_Descriptor_or_Handle__fopen_no_close_04-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0))
%1 = icmp eq %_IO_FILE* %0, null
store i64 1, i64* %rax.0.reg2mem
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = call i32 @fclose(%_IO_FILE* nonnull %0)
%3 = sext i32 %2 to i64
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
uselistorder %_IO_FILE* %0, { 1, 0 }
uselistorder i32 (%_IO_FILE*)* @fclose, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int64_t_rand_sub_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 0, i64* %sv_0.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i32 @rand()
%4 = urem i32 %3, 2
%5 = icmp eq i32 %4, 0
%6 = call i32 @rand()
%7 = zext i32 %6 to i64
%8 = mul i64 %7, 1152921504606846976
%9 = call i32 @rand()
%10 = zext i32 %9 to i64
%11 = mul i64 %10, 35184372088832
%12 = call i32 @rand()
%13 = sext i32 %12 to i64
%14 = mul i64 %13, 1073741824
%15 = call i32 @rand()
%16 = sext i32 %15 to i64
%17 = mul i64 %16, 32768
%18 = call i32 @rand()
%19 = sext i32 %18 to i64
%20 = sext i1 %5 to i64
%21 = xor i64 %8, %20
%22 = xor i64 %21, %11
%23 = xor i64 %22, %14
%24 = xor i64 %23, %17
%storemerge = xor i64 %24, %19
%.pre = load i32, i32* @gv_0, align 4
store i32 %.pre, i32* %.reg2mem
store i64 %storemerge, i64* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%.reload = load i32, i32* %.reg2mem
%25 = zext i32 %.reload to i64
%26 = icmp eq i32 %.reload, 5
%27 = icmp eq i1 %26, false
store i64 %25, i64* %rax.0.reg2mem
br i1 %27, label LBL_6, label LBL_3
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%28 = icmp eq i64 %sv_0.0.reload, -9223372036854775808
br i1 %28, label LBL_5, label LBL_4
LBL_4:
%29 = add i64 %sv_0.0.reload, -1
%30 = call i64 @FUNC(i64 %29)
store i64 %30, i64* %rax.0.reg2mem
br label LBL_6
LBL_5:
%31 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_1 to i64))
store i64 %31, 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* %rax.0.reg2mem, { 0, 2, 1, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_declare_snprintf_10-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.pre-phi.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
%.pre = ptrtoint i64* %sv_1 to i64
store i64 %.pre, i64* %.pre-phi.reg2mem
br label LBL_3
LBL_2:
%4 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 49)
%5 = ptrtoint i64* %sv_1 to i64
%6 = add i64 %5, 49
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 1
store i64 %5, i64* %.pre-phi.reg2mem
br label LBL_3
LBL_3:
%8 = bitcast i64* %sv_1 to i8*
%.pre-phi.reload = load i64, i64* %.pre-phi.reg2mem
store i64 0, i64* %sv_0, align 8
%9 = call i32 @strlen(i8* nonnull %8)
%10 = bitcast i64* %sv_0 to i8*
%11 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %10, i32 %9, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i64* nonnull %sv_1)
%12 = call i64 @FUNC(i64 %.pre-phi.reload)
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_1, { 2, 4, 1, 3, 0 }
uselistorder i64* %.pre-phi.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE606_Unchecked_Loop_Condition__char_environment_07-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.lcssa.reg2mem = alloca i64
%storemerge3.reg2mem = alloca i32
%.reg2mem = alloca i32
%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 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 %1, i32* %.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = ptrtoint i64* %sv_2 to i64
%5 = bitcast i64* %sv_2 to i16*
store i16 13617, i16* %5, align 8
%6 = or i64 %4, 2
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 2
%.pre = load i32, i32* @gv_0, align 4
store i32 %.pre, i32* %.reg2mem
br label LBL_2
LBL_2:
%.reload = load i32, i32* %.reg2mem
%8 = icmp eq i32 %.reload, 5
%9 = icmp eq i1 %8, false
br i1 %9, label LBL_8, label LBL_3
LBL_3:
%10 = bitcast i64* %sv_2 to i8*
%11 = call i32 (i8*, i8*, ...) @sscanf(i8* nonnull %10, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_1)
%12 = icmp eq i32 %11, 1
%13 = icmp eq i1 %12, false
br i1 %13, label LBL_8, label LBL_4
LBL_4:
%14 = load i64, i64* %sv_1, align 8
%15 = and i64 %14, 4294967295
%16 = icmp eq i64 %15, 0
store i32 0, i32* %storemerge3.reg2mem
store i64 0, i64* %sv_0.0.lcssa.reg2mem
br i1 %16, label LBL_7, label LBL_5
LBL_5:
%storemerge3.reload = load i32, i32* %storemerge3.reg2mem
%17 = add i32 %storemerge3.reload, 1
%18 = sext i32 %17 to i64
%19 = icmp sgt i64 %15, %18
store i32 %17, i32* %storemerge3.reg2mem
br i1 %19, label LBL_5, label LBL_6
LBL_6:
%phitmp = zext i32 %17 to i64
store i64 %phitmp, i64* %sv_0.0.lcssa.reg2mem
br label LBL_7
LBL_7:
%sv_0.0.lcssa.reload = load i64, i64* %sv_0.0.lcssa.reg2mem
%20 = call i64 @FUNC(i64 %sv_0.0.lcssa.reload)
br label LBL_8
LBL_8:
%21 = call i64 @FUNC(i64 40)
%22 = icmp eq i64 %0, %21
store i64 0, i64* %rax.0.reg2mem
br i1 %22, 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 %17, { 1, 0, 2 }
uselistorder i64* %sv_2, { 2, 0, 1, 3 }
uselistorder i32* %.reg2mem, { 0, 2, 1 }
uselistorder i32* %storemerge3.reg2mem, { 2, 0, 1 }
uselistorder i64* %sv_0.0.lcssa.reg2mem, { 0, 2, 1 }
uselistorder i64 (i64)* @printIntLine, { 3, 2, 1, 0 }
uselistorder i32* @gv_0, { 0, 7, 6, 5, 4, 3, 1, 2 }
uselistorder label LBL_7, { 1, 0 }
uselistorder label LBL_5, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_environment_snprintf_08-good
|
goodB2G1
|
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 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_3, label LBL_1
LBL_1:
%4 = bitcast i64* %sv_1 to i8*
%5 = call i32 @strlen(i8* nonnull %4)
%6 = call i8* @getenv(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_0, i64 0, i64 0))
%7 = icmp eq i8* %6, null
br i1 %7, label LBL_3, label LBL_2
LBL_2:
%8 = sext i32 %5 to i64
%9 = ptrtoint i64* %sv_1 to i64
%10 = add i64 %8, %9
%11 = inttoptr i64 %10 to i8*
%12 = sub i32 99, %5
%13 = call i8* @strncat(i8* %11, i8* nonnull %6, i32 %12)
br label LBL_3
LBL_3:
%14 = call i64 @FUNC()
%15 = trunc i64 %14 to i32
%16 = icmp eq i32 %15, 0
br i1 %16, label LBL_5, label LBL_4
LBL_4:
%17 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
br label LBL_6
LBL_5:
store i64 0, i64* %sv_0, align 8
%18 = bitcast i64* %sv_0 to i8*
%19 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %18, i32 99, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i64* nonnull %sv_1)
%20 = ptrtoint i64* %sv_0 to i64
%21 = call i64 @FUNC(i64 %20)
br label LBL_6
LBL_6:
%22 = call i64 @FUNC(i64 40)
%23 = icmp eq i64 %0, %22
store i64 0, i64* %rax.0.reg2mem
br i1 %23, label LBL_8, label LBL_7
LBL_7:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_8
LBL_8:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_0, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_snprintf_07-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i8*
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i8* null, i8** %sv_0.0.reg2mem
br i1 %3, label LBL_4, label LBL_1
LBL_1:
%4 = call i64* @malloc(i32 100)
%5 = icmp eq i64* %4, null
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%7 = bitcast i64* %4 to i8*
store i8 0, i8* %7, align 1
store i8* %7, i8** %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem
%8 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%9 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* %sv_0.0.reload, i32 100, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_1)
%10 = ptrtoint i8* %sv_0.0.reload to i64
%11 = call i64 @FUNC(i64 %10)
%12 = bitcast i8* %sv_0.0.reload to i64*
call void @free(i64* %12)
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %4, { 1, 0 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i32 (i8*, i32, i8*, ...)* @snprintf, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
uselistorder i32 100, { 0, 1, 3, 2 }
uselistorder i32* @gv_0, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_connect_socket_snprintf_05-bad
|
CWE134_Uncontrolled_Format_String__char_connect_socket_snprintf_05_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_2, align 8
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_11, label LBL_1
LBL_1:
%3 = bitcast i64* %sv_2 to i8*
%4 = call i32 @strlen(i8* nonnull %3)
%5 = call i32 @socket(i32 2, i32 1, i32 6)
%cond = icmp eq i32 %5, -1
br i1 %cond, label LBL_9, label LBL_2
LBL_2:
%6 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16)
store i64 2, i64* %sv_1, align 8
%7 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_1, i64 0, i64 0))
%8 = call i16 @htons(i16 27015)
%9 = bitcast i64* %sv_1 to %sockaddr*
%10 = call i32 @connect(i32 %5, %sockaddr* nonnull %9, i32 16)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_8, label LBL_3
LBL_3:
%12 = sext i32 %4 to i64
%13 = ptrtoint i64* %sv_2 to i64
%14 = add i64 %12, %13
%15 = inttoptr i64 %14 to i64*
%16 = sub i32 99, %4
%17 = call i32 @recv(i32 %5, i64* %15, i32 %16, i32 0)
%18 = add i32 %17, 1
%19 = icmp ult i32 %18, 2
br i1 %19, label LBL_8, label LBL_4
LBL_4:
%20 = sext i32 %17 to i64
%21 = add i64 %14, %20
%22 = inttoptr i64 %21 to i8*
store i8 0, i8* %22, align 1
%23 = call i8* @strchr(i8* nonnull %3, i32 13)
%24 = icmp eq i8* %23, null
br i1 %24, label LBL_6, label LBL_5
LBL_5:
store i8 0, i8* %23, align 1
br label LBL_6
LBL_6:
%25 = call i8* @strchr(i8* nonnull %3, i32 10)
%26 = icmp eq i8* %25, null
br i1 %26, label LBL_8, label LBL_7
LBL_7:
store i8 0, i8* %25, align 1
br label LBL_8
LBL_8:
%27 = call i32 @close(i32 %5)
br label LBL_9
LBL_9:
%.pr = load i32, i32* @gv_0, align 4
%28 = icmp eq i32 %.pr, 0
br i1 %28, label LBL_11, label LBL_10
LBL_10:
store i64 0, i64* %sv_0, align 8
%29 = bitcast i64* %sv_0 to i8*
%30 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %29, i32 99, i8* nonnull %3)
%31 = call i64 @FUNC(i64* nonnull %sv_0)
br label LBL_11
LBL_11:
%32 = call i64 @FUNC(i64 40)
%33 = icmp eq i64 %0, %32
store i64 0, i64* %rax.0.reg2mem
br i1 %33, 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 %17, { 1, 0 }
uselistorder i32 %5, { 3, 1, 2, 0 }
uselistorder i8* %3, { 3, 0, 1, 2 }
uselistorder i64* %sv_1, { 0, 2, 1 }
uselistorder i8* (i8*, i32)* @strchr, { 1, 0, 2 }
uselistorder i32 99, { 1, 0 }
uselistorder i32 -1, { 1, 0 }
uselistorder label LBL_11, { 1, 2, 0 }
uselistorder label LBL_9, { 1, 0 }
uselistorder label LBL_8, { 2, 1, 0, 3 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE129_fscanf_11-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%indvars.iv.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
store i32 7, i32* %sv_0.0.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
store i32 -1, i32* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%5 = call i64 @FUNC()
%6 = trunc i64 %5 to i32
%7 = icmp eq i32 %6, 0
br i1 %7, label LBL_7, label LBL_3
LBL_3:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%8 = icmp slt i32 %sv_0.0.reload, 0
br i1 %8, label LBL_6, label LBL_4
LBL_4:
%9 = ptrtoint i64* %sv_1 to i64
%10 = sext i32 %sv_0.0.reload to i64
%11 = mul i64 %10, 4
%12 = add i64 %9, -48
%13 = add i64 %11, %12
%14 = inttoptr i64 %13 to i32*
store i32 1, i32* %14, align 4
store i64 0, i64* %indvars.iv.reg2mem
br label LBL_5
LBL_5:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%15 = mul i64 %indvars.iv.reload, 4
%16 = add i64 %15, %12
%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_7, label LBL_5
LBL_6:
%21 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_1 to i64))
br label LBL_7
LBL_7:
%22 = call i64 @FUNC(i64 40)
%23 = icmp eq i64 %0, %22
store i64 0, i64* %rax.0.reg2mem
br i1 %23, 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* %sv_0.0.reg2mem, { 0, 2, 1 }
uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 }
uselistorder i64 ()* @globalReturnsFalse, { 1, 0 }
uselistorder label LBL_7, { 1, 0, 2 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE590_Free_Memory_Not_on_Heap__free_struct_declare_13-bad
|
CWE590_Free_Memory_Not_on_Heap__free_struct_declare_13_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = ptrtoint i64* %sv_2 to i64
%1 = call i64 @FUNC(i64 40)
%2 = load i32, i32* inttoptr (i64 8336 to i32*), align 16
%3 = icmp eq i32 %2, 5
%4 = icmp eq i1 %3, false
store i64 0, i64* %storemerge1.reg2mem
store i64 0, i64* %sv_0.0.reg2mem
br i1 %4, label LBL_3, label LBL_1
LBL_1:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%5 = mul i64 %storemerge1.reload, 8
%6 = add i64 %5, %0
%7 = add i64 %6, -816
%8 = inttoptr i64 %7 to i32*
store i32 1, i32* %8, align 8
%9 = add i64 %6, -812
%10 = inttoptr i64 %9 to i32*
store i32 1, i32* %10, align 4
%11 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %11, 100
store i64 %11, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_2, label LBL_1
LBL_2:
%12 = ptrtoint i64* %sv_1 to i64
store i64 %12, i64* %sv_0.0.reg2mem
br label LBL_3
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%13 = call i64 @FUNC(i64 %sv_0.0.reload)
%14 = inttoptr i64 %sv_0.0.reload to i64*
call void @free(i64* %14)
%15 = call i64 @FUNC(i64 40)
%16 = icmp eq i64 %1, %15
store i64 0, i64* %rax.0.reg2mem
br i1 %16, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 }
uselistorder label LBL_1, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE401_Memory_Leak__struct_twoIntsStruct_realloc_13-bad
|
CWE401_Memory_Leak__struct_twoIntsStruct_realloc_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 = 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_4, label LBL_1
LBL_1:
%4 = call i64* @realloc(i64* null, i32 ptrtoint (i32* @gv_0 to i32))
%5 = icmp eq i64* %4, null
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%7 = ptrtoint i64* %4 to i64
%8 = bitcast i64* %4 to i32*
store i32 0, i32* %8, align 4
%9 = add i64 %7, 4
%10 = inttoptr i64 %9 to i32*
store i32 0, i32* %10, align 4
%11 = call i64 @FUNC(i64 %7)
store i64 %11, 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* %4, { 0, 2, 1 }
uselistorder i64* null, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int_fscanf_sub_32-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 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, -2147483648
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, 0, 2 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE415_Double_Free__malloc_free_struct_10-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
store i64 0, i64* %rax.0.reg2mem
br i1 %1, label LBL_5, label LBL_1
LBL_1:
%2 = call i64* @malloc(i32 ptrtoint (i32* @gv_1 to i32))
%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, { 2, 3, 0, 1, 4 }
uselistorder i32* @gv_0, { 0, 4, 3, 2, 1 }
uselistorder label LBL_5, { 1, 2, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__int_rand_modulo_01-bad
|
CWE369_Divide_by_Zero__int_rand_modulo_01_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%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 = urem i32 100, %storemerge.in
%12 = zext i32 %11 to i64
%13 = call i64 @FUNC(i64 %12)
ret i64 %13
}
|
1
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_connect_socket_execlp_14-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 2126700, i64* %sv_0, align 8
%1 = 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 = bitcast i64* %sv_0 to i8*
%5 = call i32 @strlen(i8* nonnull %4)
%6 = sext i32 %5 to i64
%7 = ptrtoint i64* %sv_0 to i64
%8 = add i64 %6, %7
%9 = inttoptr i64 %8 to i32*
store i32 2764330, i32* %9, align 4
br label LBL_3
LBL_3:
%10 = call i32 (i8*, i8*, ...) @execlp(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0))
%11 = call i64 @FUNC(i64 40)
%12 = icmp eq i64 %0, %11
store i64 0, i64* %rax.0.reg2mem
br i1 %12, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__char_rand_square_03-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge.reg2mem = alloca i64
%0 = call i32 @rand()
%1 = urem i32 %0, 2
%2 = icmp eq i32 %1, 0
%3 = call i32 @rand()
%4 = call i32 @rand()
%5 = call i32 @rand()
%6 = sub i32 0, %5
%7 = sub i32 %6, 1
%8 = zext i32 %7 to i64
%9 = sext i32 %5 to i64
%storemerge2 = select i1 %2, i64 %8, i64 %9
%10 = trunc i64 %storemerge2 to i8
%11 = sub i8 0, %10
%12 = icmp slt i8 %11, 0
%13 = icmp eq i1 %12, false
%14 = select i1 %13, i8 %11, i8 %10
%15 = icmp ult i8 %14, 12
br i1 %15, label LBL_1, label LBL_2
LBL_1:
%16 = trunc i64 %storemerge2 to i32
%17 = urem i32 %16, 256
%narrow = mul i32 %16, 16777216
%sext = mul i32 %narrow, %17
%18 = ashr exact i32 %sext, 24
%19 = zext i32 %18 to i64
%20 = call i64 @FUNC(i64 %19)
store i64 %20, i64* %storemerge.reg2mem
br label LBL_3
LBL_2:
%21 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_0 to i64))
store i64 %21, i64* %storemerge.reg2mem
br label LBL_3
LBL_3:
%storemerge.reload = load i64, i64* %storemerge.reg2mem
ret i64 %storemerge.reload
uselistorder i64 %storemerge2, { 1, 0 }
uselistorder i32 %5, { 1, 0 }
uselistorder i64* %storemerge.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE590_Free_Memory_Not_on_Heap__free_int_alloca_12-bad
|
CWE590_Free_Memory_Not_on_Heap__free_int_alloca_12_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%storemerge24.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 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_3, label LBL_1
LBL_1:
%4 = ptrtoint i64* %sv_0 to i64
%5 = add i64 %4, -401
%6 = and i64 %5, -16
store i64 0, i64* %storemerge5.reg2mem
br label LBL_2
LBL_2:
%storemerge5.reload = load i64, i64* %storemerge5.reg2mem
%7 = mul i64 %storemerge5.reload, 4
%8 = add i64 %7, %6
%9 = inttoptr i64 %8 to i32*
store i32 5, i32* %9, align 4
%10 = add nuw nsw i64 %storemerge5.reload, 1
%exitcond6 = icmp eq i64 %10, 100
store i64 %10, i64* %storemerge5.reg2mem
store i64 %6, i64* %storemerge1.reg2mem
br i1 %exitcond6, label LBL_6, label LBL_2
LBL_3:
%11 = call i64* @malloc(i32 400)
%12 = ptrtoint i64* %11 to i64
%13 = icmp eq i64* %11, null
%14 = icmp eq i1 %13, false
store i64 0, i64* %storemerge24.reg2mem
br i1 %14, label LBL_5, label LBL_4
LBL_4:
%15 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_0 to i64))
call void @exit(i32 1)
unreachable
LBL_5:
%storemerge24.reload = load i64, i64* %storemerge24.reg2mem
%16 = mul i64 %storemerge24.reload, 4
%17 = add i64 %16, %12
%18 = inttoptr i64 %17 to i32*
store i32 5, i32* %18, align 4
%19 = add nuw nsw i64 %storemerge24.reload, 1
%exitcond = icmp eq i64 %19, 100
store i64 %19, i64* %storemerge24.reg2mem
store i64 %12, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_6, label LBL_5
LBL_6:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
store i64 %storemerge1.reload, i64* %sv_0, align 8
%20 = inttoptr i64 %storemerge1.reload to i32*
%21 = load i32, i32* %20, align 4
%22 = zext i32 %21 to i64
%23 = call i64 @FUNC(i64 %22)
%24 = load i64, i64* %sv_0, align 8
%25 = inttoptr i64 %24 to i64*
call void @free(i64* %25)
%26 = call i64 @FUNC(i64 40)
%27 = icmp eq i64 %0, %26
store i64 0, i64* %rax.0.reg2mem
br i1 %27, label LBL_8, label LBL_7
LBL_7:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_8
LBL_8:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %storemerge1.reload, { 1, 0 }
uselistorder i64* %sv_0, { 1, 0, 3, 2 }
uselistorder i64* %storemerge5.reg2mem, { 1, 0, 2 }
uselistorder i64* %storemerge24.reg2mem, { 2, 0, 1 }
uselistorder i64* %storemerge1.reg2mem, { 0, 2, 1 }
uselistorder i64 100, { 1, 0 }
uselistorder label LBL_6, { 1, 0 }
uselistorder label LBL_5, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__int_pointer_08-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 ()* @staticReturnsFalse, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE401_Memory_Leak__int64_t_calloc_13-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64* @calloc(i32 100, i32 8)
%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:
store i64 5, i64* %0, align 8
%3 = call i64 @FUNC(i64 5)
call void @free(i64* %0)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* null, { 1, 2, 0 }
uselistorder i64* (i32, i32)* @calloc, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__unsigned_int_fscanf_sub_11-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 = 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
br i1 %8, label LBL_6, label LBL_3
LBL_3:
%9 = load i32, i32* %sv_0, align 4
%10 = icmp eq i32 %9, 0
br i1 %10, label LBL_5, label LBL_4
LBL_4:
%11 = add i32 %9, -1
%12 = zext i32 %11 to i64
%13 = call i64 @FUNC(i64 %12)
br label LBL_6
LBL_5:
%14 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_2 to i64))
br label LBL_6
LBL_6:
%15 = call i64 @FUNC(i64 40)
%16 = icmp eq i64 %0, %15
store i64 0, i64* %rax.0.reg2mem
br i1 %16, 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 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
|
CWE127_Buffer_Underread__char_declare_ncpy_07-bad
|
CWE127_Buffer_Underread__char_declare_ncpy_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i8*, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @memset(i64* nonnull %sv_2, i32 65, i32 99)
%2 = load i32, i32* @gv_0, align 4
%3 = icmp eq i32 %2, 5
%4 = icmp eq i1 %3, false
br i1 %4, label LBL_2, label LBL_1
LBL_1:
%5 = bitcast i8** %sv_1 to i8*
store i8* %5, i8** %sv_1, align 8
br label LBL_2
LBL_2:
%6 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%7 = bitcast i64* %sv_0 to i8*
%8 = call i32 @strlen(i8* nonnull %7)
%9 = load i8*, i8** %sv_1, align 8
%10 = call i8* @strncpy(i8* nonnull %7, i8* %9, i32 %8)
%11 = call i64 @FUNC(i64* nonnull %sv_0)
%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 i8** %sv_1, { 2, 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE606_Unchecked_Loop_Condition__char_connect_socket_12-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.lcssa.reg2mem = alloca i64
%storemerge24.reg2mem = alloca i32
%sv_1.0.lcssa.reg2mem = alloca i64
%storemerge6.reg2mem = alloca i32
%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 i64 @FUNC()
%3 = ptrtoint i64* %sv_3 to i64
%4 = bitcast i64* %sv_3 to i16*
store i16 ptrtoint (i64* @gv_0 to i16), i16* %4, align 8
%5 = or i64 %3, 2
%6 = inttoptr i64 %5 to i8*
store i8 0, i8* %6, align 2
%7 = call i64 @FUNC()
%8 = trunc i64 %7 to i32
%9 = icmp eq i32 %8, 0
%10 = 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_2)
%11 = icmp eq i32 %10, 1
%12 = icmp eq i1 %11, false
br i1 %9, label LBL_6, label LBL_1
LBL_1:
br i1 %12, label LBL_11, label LBL_2
LBL_2:
%13 = load i64, i64* %sv_2, align 8
%14 = and i64 %13, 4294967295
%15 = icmp eq i64 %14, 0
store i32 0, i32* %storemerge6.reg2mem
store i64 0, i64* %sv_1.0.lcssa.reg2mem
br i1 %15, label LBL_5, label LBL_3
LBL_3:
%storemerge6.reload = load i32, i32* %storemerge6.reg2mem
%16 = add i32 %storemerge6.reload, 1
%17 = sext i32 %16 to i64
%18 = icmp sgt i64 %14, %17
store i32 %16, i32* %storemerge6.reg2mem
br i1 %18, label LBL_3, label LBL_4
LBL_4:
%phitmp = zext i32 %16 to i64
store i64 %phitmp, i64* %sv_1.0.lcssa.reg2mem
br label LBL_5
LBL_5:
%sv_1.0.lcssa.reload = load i64, i64* %sv_1.0.lcssa.reg2mem
%19 = call i64 @FUNC(i64 %sv_1.0.lcssa.reload)
br label LBL_11
LBL_6:
br i1 %12, label LBL_11, label LBL_7
LBL_7:
%20 = load i64, i64* %sv_2, align 8
%21 = and i64 %20, 4294967295
%22 = icmp eq i64 %21, 0
store i32 0, i32* %storemerge24.reg2mem
store i64 0, i64* %sv_0.0.lcssa.reg2mem
br i1 %22, label LBL_10, label LBL_8
LBL_8:
%storemerge24.reload = load i32, i32* %storemerge24.reg2mem
%23 = add i32 %storemerge24.reload, 1
%24 = sext i32 %23 to i64
%25 = icmp sgt i64 %21, %24
store i32 %23, i32* %storemerge24.reg2mem
br i1 %25, label LBL_8, label LBL_9
LBL_9:
%phitmp8 = zext i32 %23 to i64
store i64 %phitmp8, i64* %sv_0.0.lcssa.reg2mem
br label LBL_10
LBL_10:
%sv_0.0.lcssa.reload = load i64, i64* %sv_0.0.lcssa.reg2mem
%26 = call i64 @FUNC(i64 %sv_0.0.lcssa.reload)
br label LBL_11
LBL_11:
%27 = call i64 @FUNC(i64 40)
%28 = icmp eq i64 %0, %27
store i64 0, i64* %rax.0.reg2mem
br i1 %28, 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 %23, { 1, 0, 2 }
uselistorder i32 %16, { 1, 0, 2 }
uselistorder i1 %12, { 1, 0 }
uselistorder i64* %sv_2, { 1, 0, 2 }
uselistorder i32* %storemerge6.reg2mem, { 2, 0, 1 }
uselistorder i64* %sv_1.0.lcssa.reg2mem, { 0, 2, 1 }
uselistorder i32* %storemerge24.reg2mem, { 2, 0, 1 }
uselistorder i64* %sv_0.0.lcssa.reg2mem, { 0, 2, 1 }
uselistorder i64 (i64)* @printIntLine, { 3, 2, 1, 0 }
uselistorder i64 ()* @globalReturnsTrueOrFalse, { 3, 2, 1, 0 }
uselistorder label LBL_10, { 1, 0 }
uselistorder label LBL_8, { 1, 0 }
uselistorder label LBL_5, { 1, 0 }
uselistorder label LBL_3, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE590_Free_Memory_Not_on_Heap__free_int_declare_07-bad
|
CWE590_Free_Memory_Not_on_Heap__free_int_declare_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%storemerge1.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_4, label LBL_1
LBL_1:
%4 = ptrtoint i64* %sv_2 to i64
%5 = add i64 %4, -416
store i64 0, i64* %storemerge1.reg2mem
br label LBL_2
LBL_2:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%6 = mul i64 %storemerge1.reload, 4
%7 = add i64 %5, %6
%8 = inttoptr i64 %7 to i32*
store i32 5, i32* %8, align 4
%9 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %9, 100
store i64 %9, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_3, label LBL_2
LBL_3:
%10 = ptrtoint i64* %sv_1 to i64
store i64 %10, i64* %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%11 = inttoptr i64 %sv_0.0.reload to i32*
%12 = load i32, i32* %11, align 4
%13 = zext i32 %12 to i64
%14 = call i64 @FUNC(i64 %13)
%15 = inttoptr i64 %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_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder i32 5, { 2, 0, 1 }
}
|
1
|
juliet-test-suite-c
|
CWE789_Uncontrolled_Mem_Alloc__malloc_char_connect_socket_13-bad
|
CWE789_Uncontrolled_Mem_Alloc__malloc_char_connect_socket_13_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 = load i32, i32* inttoptr (i64 8408 to i32*), align 8
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_9, 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_9, label LBL_2
LBL_2:
%6 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16)
store i64 2, i64* %sv_1, align 8
%7 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%8 = call i16 @htons(i16 27015)
%9 = bitcast i64* %sv_1 to %sockaddr*
%10 = call i32 @connect(i32 %4, %sockaddr* nonnull %9, i32 16)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_4, label LBL_3
LBL_3:
%12 = call i32 @recv(i32 %4, i64* nonnull %sv_0, i32 25, i32 0)
%13 = add i32 %12, 1
%14 = icmp ult i32 %13, 2
br i1 %14, label LBL_4, label LBL_5
LBL_4:
%15 = call i32 @close(i32 %4)
br label LBL_9
LBL_5:
%16 = ptrtoint i64* %sv_2 to i64
%17 = sext i32 %12 to i64
%18 = add i64 %16, -48
%19 = add i64 %18, %17
%20 = inttoptr i64 %19 to i8*
store i8 0, i8* %20, align 1
%21 = bitcast i64* %sv_0 to i8*
%22 = call i32 @strtoul(i8* nonnull %21, i8** null, i32 0)
%23 = call i32 @close(i32 %4)
%24 = icmp ult i32 %22, 6
br i1 %24, label LBL_9, label LBL_6
LBL_6:
%25 = call i64* @malloc(i32 %22)
%26 = icmp eq i64* %25, null
%27 = icmp eq i1 %26, false
br i1 %27, label LBL_8, label LBL_7
LBL_7:
call void @exit(i32 -1)
unreachable
LBL_8:
%28 = ptrtoint i64* %25 to i64
%29 = bitcast i64* %25 to i32*
store i32 1819043176, i32* %29, align 4
%30 = add i64 %28, 4
%31 = inttoptr i64 %30 to i16*
store i16 111, i16* %31, align 2
%32 = call i64 @FUNC(i64 %28)
call void @free(i64* %25)
br label LBL_10
LBL_9:
%33 = call i64 @FUNC(i64 ptrtoint ([51 x i8]* @gv_1 to i64))
br label LBL_10
LBL_10:
%34 = call i64 @FUNC(i64 40)
%35 = icmp eq i64 %0, %34
store i64 0, i64* %rax.0.reg2mem
br i1 %35, 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 i64* %25, { 0, 1, 3, 2 }
uselistorder i32 %22, { 1, 0 }
uselistorder i32 %12, { 1, 0 }
uselistorder i32 %4, { 3, 0, 1, 2, 4 }
uselistorder i64* %sv_1, { 0, 2, 1 }
uselistorder i32 (i32)* @close, { 1, 0, 2 }
uselistorder i32 -1, { 2, 0, 1 }
uselistorder label LBL_9, { 3, 2, 0, 1 }
}
|
1
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.