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
|
CWE121_Stack_Based_Buffer_Overflow__CWE135_04-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i32*, align 8
%0 = ptrtoint i32** %sv_0 to i64
%1 = call i64 @FUNC(i64 40)
store i32* getelementptr inbounds ([43 x i32], [43 x i32]* @gv_0, i64 0, i64 0), i32** %sv_0, align 8
%2 = call i32 @wcslen(i32* getelementptr inbounds ([43 x i32], [43 x i32]* @gv_0, i64 0, i64 0))
%3 = sext i32 %2 to i64
%4 = mul i64 %3, 4
%5 = add nsw i64 %4, 27
%6 = udiv i64 %5, 16
%7 = mul i64 %6, 16
%8 = and i64 %7, -4096
%9 = and i64 %7, 4080
%10 = add i64 %0, 15
%11 = sub i64 %10, %9
%12 = sub i64 %11, %8
%13 = and i64 %12, -16
%14 = load i32*, i32** %sv_0, align 8
%15 = inttoptr i64 %13 to i32*
%16 = call i32* @wcscpy(i32* %15, i32* %14)
%17 = call i64 @FUNC(i64 %13)
%18 = call i64 @FUNC(i64 40)
%19 = icmp eq i64 %1, %18
store i64 0, i64* %rax.0.reg2mem
br i1 %19, 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 %13, { 1, 0 }
uselistorder i64 %7, { 1, 0 }
uselistorder i32** %sv_0, { 2, 0, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_declare_ncpy_14-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.pre-phi.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
%.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 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 i64* %.pre-phi.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE127_Buffer_Underread__char_declare_loop_08-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 = call i64 @FUNC()
%5 = trunc i64 %4 to i32
%6 = icmp eq i32 %5, 0
%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 i64* (i64*, i32, i32)* @memset, { 1, 2, 3, 0, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__CWE129_connect_socket_01-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
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i32 @socket(i32 2, i32 1, i32 6)
%2 = icmp eq i32 %1, -1
br i1 %2, label LBL_1, label LBL_2
LBL_1:
store i64 0, i64* %sv_1, align 8
br label LBL_7
LBL_2:
%3 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16)
store i64 2, i64* %sv_1, align 8
%4 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%5 = call i16 @htons(i16 27015)
%6 = bitcast i64* %sv_1 to %sockaddr*
%7 = call i32 @connect(i32 %1, %sockaddr* nonnull %6, i32 16)
%8 = icmp eq i32 %7, -1
br i1 %8, label LBL_16, label LBL_3
LBL_3:
%9 = call i32 @recv(i32 %1, i64* nonnull %sv_0, i32 13, i32 0)
%10 = add i32 %9, 1
%11 = icmp ult i32 %10, 2
br i1 %11, label LBL_16, label LBL_5
LBL_4:
%12 = call i32 @close(i32 %1)
store i64 0, i64* %sv_1, align 8
br label LBL_7
LBL_5:
%13 = ptrtoint i64* %sv_2 to i64
%14 = sext i32 %9 to i64
%15 = add i64 %13, -22
%16 = add i64 %15, %14
%17 = inttoptr i64 %16 to i8*
store i8 0, i8* %17, align 1
%18 = bitcast i64* %sv_0 to i8*
%19 = call i32 @atoi(i8* nonnull %18)
%20 = call i32 @close(i32 %1)
store i64 0, i64* %sv_1, align 8
%21 = icmp ugt i32 %19, 9
br i1 %21, label LBL_7, label LBL_6
LBL_6:
%22 = sext i32 %19 to i64
%23 = mul i64 %22, 4
%24 = add i64 %13, -64
%25 = add i64 %24, %23
%26 = inttoptr i64 %25 to i32*
%27 = load i32, i32* %26, align 4
%28 = zext i32 %27 to i64
%29 = call i64 @FUNC(i64 %28)
br label LBL_8
LBL_7:
%30 = call i64 @FUNC(i64 ptrtoint ([36 x i8]* @gv_1 to i64))
br label LBL_8
LBL_8:
%31 = call i64 @FUNC(i64 40)
%32 = icmp eq i64 %0, %31
store i64 0, i64* %rax.0.reg2mem
br i1 %32, label LBL_10, label LBL_9
LBL_9:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_10
LBL_10:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %19, { 1, 0 }
uselistorder i64 %13, { 1, 0 }
uselistorder i32 %9, { 1, 0 }
uselistorder i32 %1, { 3, 0, 1, 2, 4 }
uselistorder i64* %sv_1, { 4, 0, 2, 5, 3, 1 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
uselistorder i32 (i32)* @close, { 1, 0, 2 }
uselistorder label LBL_7, { 2, 0, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__malloc_char_memmove_14-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64*
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
store i64* null, i64** %sv_0.0.reg2mem
br label LBL_5
LBL_2:
%4 = call i64* @malloc(i32 100)
%5 = icmp eq i64* %4, null
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_4, label LBL_3
LBL_3:
call void @exit(i32 -1)
unreachable
LBL_4:
%7 = ptrtoint i64* %4 to i64
%8 = call i64* @memset(i64* %4, i32 65, i32 99)
%9 = add i64 %7, 99
%10 = inttoptr i64 %9 to i8*
store i8 0, i8* %10, align 1
store i64* %4, i64** %sv_0.0.reg2mem
br label LBL_5
LBL_5:
%sv_0.0.reload = load i64*, i64** %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 i32 @strlen(i8* nonnull %12)
%14 = call i64* @memmove(i64* nonnull %sv_1, i64* %sv_0.0.reload, i32 %13)
%15 = ptrtoint i64* %sv_1 to i64
%16 = call i64 @FUNC(i64 %15)
call void @free(i64* %sv_0.0.reload)
%17 = call i64 @FUNC(i64 40)
%18 = icmp eq i64 %0, %17
store i64 0, i64* %rax.0.reg2mem
br i1 %18, 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* %4, { 0, 1, 3, 2 }
uselistorder i64* %sv_1, { 3, 0, 1, 2 }
uselistorder i64** %sv_0.0.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__char_rand_add_05-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
store i32 32, i32* %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 = call i32 @rand()
%7 = call i32 @rand()
%8 = sext i1 %4 to i32
%storemerge = xor i32 %7, %8
%sext = mul i32 %storemerge, 16777216
%9 = ashr exact i32 %sext, 24
store i32 %9, i32* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%10 = load i32, i32* @gv_1, align 4
%11 = icmp eq i32 %10, 0
br i1 %11, label LBL_4, label LBL_3
LBL_3:
%12 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64))
store i64 %12, i64* %rax.0.reg2mem
br label LBL_7
LBL_4:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%13 = trunc i32 %sv_0.0.reload to i8
%14 = icmp eq i8 %13, 127
br i1 %14, label LBL_6, label LBL_5
LBL_5:
%15 = mul i32 %sv_0.0.reload, 16777216
%sext2 = add i32 %15, 16777216
%16 = ashr exact i32 %sext2, 24
%17 = zext i32 %16 to i64
%18 = call i64 @FUNC(i64 %17)
store i64 %18, i64* %rax.0.reg2mem
br label LBL_7
LBL_6:
%19 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_3 to i64))
store i64 %19, i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %sv_0.0.reload, { 1, 0 }
uselistorder i64* %rax.0.reg2mem, { 0, 3, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_int64_t_memmove_02-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)
%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
}
|
0
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_connect_socket_popen_12-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 2126700, i64* %sv_0, align 8
%1 = bitcast i64* %sv_0 to i8*
%2 = call i64 @FUNC()
%3 = call i32 @strlen(i8* nonnull %1)
%4 = sext i32 %3 to i64
%5 = ptrtoint i64* %sv_0 to i64
%6 = add i64 %4, %5
%7 = inttoptr i64 %6 to i32*
store i32 2764330, i32* %7, align 4
%8 = call %_IO_FILE* @popen(i8* nonnull %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_0, i64 0, i64 0))
%9 = icmp eq %_IO_FILE* %8, null
br i1 %9, label LBL_2, label LBL_1
LBL_1:
%10 = call i32 @pclose(%_IO_FILE* nonnull %8)
br label LBL_2
LBL_2:
%11 = call i64 @FUNC(i64 40)
%12 = icmp eq i64 %0, %11
store i64 0, i64* %rax.0.reg2mem
br i1 %12, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
0
|
juliet-test-suite-c
|
CWE194_Unexpected_Sign_Extension__fscanf_memcpy_08-bad
|
CWE194_Unexpected_Sign_Extension__fscanf_memcpy_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%sv_2 = alloca i16, align 2
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i16 0, i16* %sv_2, align 2
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i16* nonnull %sv_2)
br label LBL_2
LBL_2:
store i64 0, i64* %sv_1, align 8
%6 = call i64* @memset(i64* nonnull %sv_0, i32 65, i32 99)
%7 = load i16, i16* %sv_2, align 2
%8 = icmp sgt i16 %7, 99
br i1 %8, label LBL_4, label LBL_3
LBL_3:
%9 = ptrtoint i64* %sv_3 to i64
%10 = sext i16 %7 to i32
%11 = call i64* @memcpy(i64* nonnull %sv_1, i64* nonnull %sv_0, i32 %10)
%12 = load i16, i16* %sv_2, align 2
%13 = sext i16 %12 to i64
%14 = add i64 %9, -112
%15 = add i64 %14, %13
%16 = inttoptr i64 %15 to i8*
store i8 0, i8* %16, align 1
br label LBL_4
LBL_4:
%17 = call i64 @FUNC(i64* nonnull %sv_1)
%18 = call i64 @FUNC(i64 40)
%19 = icmp eq i64 %0, %18
store i64 0, i64* %rax.0.reg2mem
br i1 %19, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i16* %sv_2, { 1, 2, 0, 3 }
uselistorder i8 0, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__unsigned_int_fscanf_multiply_05-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i32, align 4
%0 = call i64 @FUNC(i64 40)
store i32 0, i32* %sv_0, align 4
%1 = load 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* %sv_0, align 4
%5 = load i32, i32* @gv_0, align 4
%6 = icmp eq i32 %5, 0
%7 = icmp eq i32 %.pr, 0
%or.cond = or i1 %7, %6
br i1 %or.cond, label LBL_5, label LBL_2
LBL_2:
%8 = icmp ult i32 %.pr, 2147483647
br i1 %8, label LBL_3, label LBL_4
LBL_3:
%9 = mul i32 %.pr, 2
%10 = zext i32 %9 to i64
%11 = call i64 @FUNC(i64 %10)
br label LBL_5
LBL_4:
%12 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_3 to i64))
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
uselistorder i32 %.pr, { 0, 2, 1 }
uselistorder i32* %sv_0, { 0, 2, 1 }
uselistorder i32 (%_IO_FILE*, i8*, ...)* @fscanf, { 1, 0, 2 }
uselistorder %_IO_FILE** @gv_1, { 2, 1, 0 }
uselistorder label LBL_5, { 1, 2, 3, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_memcpy_07-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i64 0, i64* %sv_0.0.reg2mem
br i1 %3, label LBL_4, label LBL_1
LBL_1:
%4 = call i64* @malloc(i32 100)
%5 = icmp eq i64* %4, null
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%7 = ptrtoint i64* %4 to i64
%8 = bitcast i64* %4 to i8*
store i8 0, i8* %8, align 1
store i64 %7, i64* %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%9 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%10 = load i64, i64* %sv_1, align 8
%11 = inttoptr i64 %sv_0.0.reload to i64*
store i64 %10, i64* %11, align 8
%12 = add i64 %sv_0.0.reload, 8
%13 = inttoptr i64 %12 to i64*
%14 = add i64 %sv_0.0.reload, 16
%15 = inttoptr i64 %14 to i64*
%16 = add i64 %sv_0.0.reload, 24
%17 = inttoptr i64 %16 to i64*
%18 = add i64 %sv_0.0.reload, 32
%19 = inttoptr i64 %18 to i64*
%20 = add i64 %sv_0.0.reload, 40
%21 = inttoptr i64 %20 to i64*
%22 = add i64 %sv_0.0.reload, 48
%23 = inttoptr i64 %22 to i64*
%24 = add i64 %sv_0.0.reload, 56
%25 = inttoptr i64 %24 to i64*
%26 = add i64 %sv_0.0.reload, 64
%27 = inttoptr i64 %26 to i64*
%28 = add i64 %sv_0.0.reload, 72
%29 = inttoptr i64 %28 to i64*
%30 = add i64 %sv_0.0.reload, 80
%31 = inttoptr i64 %30 to i64*
%32 = add i64 %sv_0.0.reload, 88
%33 = inttoptr i64 %32 to i64*
%34 = add i64 %sv_0.0.reload, 96
%35 = inttoptr i64 %34 to i32*
%36 = add i64 %sv_0.0.reload, 99
%37 = inttoptr i64 %36 to i8*
store i8 0, i8* %37, align 1
%38 = call i64 @FUNC(i64 %sv_0.0.reload)
call void @free(i64* %11)
%39 = call i64 @FUNC(i64 40)
%40 = icmp eq i64 %0, %39
store i64 0, i64* %rax.0.reg2mem
br i1 %40, 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.0.reload, { 14, 13, 12, 4, 11, 1, 10, 9, 8, 7, 6, 5, 3, 2, 0 }
uselistorder i64* %4, { 0, 2, 1 }
uselistorder i64* %sv_1, { 1, 0 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i32* @gv_0, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__float_rand_31-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i128
%storemerge.reg2mem = alloca i64
%storemerge2.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* %storemerge2.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* %storemerge2.reg2mem
br label LBL_3
LBL_3:
%20 = icmp eq i32 %13, 0
%storemerge2.reload = load i128, i128* %storemerge2.reg2mem
%21 = call i64 @FUNC(i128 %storemerge2.reload)
%22 = trunc i64 %21 to i32
%23 = call i128 @__asm_movss.1(i32 %22)
%24 = call i64 @FUNC(i128 %23)
%25 = trunc i64 %24 to i32
%26 = call i128 @__asm_movss.1(i32 %25)
%27 = call i64 @FUNC(i128 %26)
%28 = trunc i64 %27 to i32
%29 = call i128 @__asm_movss.1(i32 %28)
%30 = call i128 @__asm_movss.1(i32 2147483647)
%31 = call i128 @FUNC(i128 %29, i128 %30)
%32 = call i128 @__asm_cvtss2sd.2(i128 %31)
%33 = load i128, i128* @gv_0, align 8
call void @FUNC(i128 %32, i128 %33)
br i1 %20, label LBL_5, label LBL_4
LBL_4:
%34 = call i128 @FUNC(i128 %30, i128 %30)
%35 = call i128 @FUNC(i32 %28)
%36 = call i128 @FUNC(i64 4636737291354636288)
%37 = call i128 @FUNC(i128 %36, i128 %35)
%38 = call i32 @FUNC(i128 %37)
%39 = zext i32 %38 to i64
%40 = call i64 @FUNC(i64 %39)
store i64 %40, i64* %storemerge.reg2mem
br label LBL_6
LBL_5:
%41 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_1 to i64))
store i64 %41, i64* %storemerge.reg2mem
br label LBL_6
LBL_6:
%storemerge.reload = load i64, i64* %storemerge.reg2mem
ret i64 %storemerge.reload
uselistorder i128 %30, { 1, 0, 2 }
uselistorder i32 %13, { 2, 0, 1 }
uselistorder i128 %2, { 3, 2, 1, 0, 4 }
uselistorder i128* %storemerge2.reg2mem, { 0, 2, 1 }
uselistorder i64* %storemerge.reg2mem, { 0, 2, 1 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE129_rand_02-bad
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE129_rand_02_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%indvars.iv.reg2mem = alloca i64
%indvars.iv6.reg2mem = alloca i64
%0 = call i32 @rand()
%1 = urem i32 %0, 2
%2 = icmp eq i32 %1, 0
%3 = call i32 @rand()
%4 = mul i32 %3, 1073741824
%5 = call i32 @rand()
%6 = mul i32 %5, 32768
%7 = xor i32 %6, %4
%8 = call i32 @rand()
%9 = xor i32 %7, %8
%10 = sext i1 %2 to i32
%storemerge3.in = xor i32 %9, %10
%11 = call i64* @malloc(i32 40)
%12 = ptrtoint i64* %11 to i64
%13 = icmp eq i64* %11, null
%14 = icmp eq i1 %13, false
store i64 0, i64* %indvars.iv6.reg2mem
br i1 %14, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%indvars.iv6.reload = load i64, i64* %indvars.iv6.reg2mem
%15 = mul i64 %indvars.iv6.reload, 4
%16 = add i64 %15, %12
%17 = inttoptr i64 %16 to i32*
store i32 0, i32* %17, align 4
%indvars.iv.next7 = add nuw nsw i64 %indvars.iv6.reload, 1
%exitcond8 = icmp eq i64 %indvars.iv.next7, 10
store i64 %indvars.iv.next7, i64* %indvars.iv6.reg2mem
br i1 %exitcond8, label LBL_3, label LBL_2
LBL_3:
%18 = icmp slt i32 %storemerge3.in, 0
br i1 %18, label LBL_6, label LBL_4
LBL_4:
%19 = sext i32 %storemerge3.in to i64
%20 = mul i64 %19, 4
%21 = add i64 %20, %12
%22 = inttoptr i64 %21 to i32*
store i32 1, i32* %22, align 4
store i64 0, i64* %indvars.iv.reg2mem
br label LBL_5
LBL_5:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%23 = mul i64 %indvars.iv.reload, 4
%24 = add i64 %23, %12
%25 = inttoptr i64 %24 to i32*
%26 = load i32, i32* %25, align 4
%27 = zext i32 %26 to i64
%28 = call i64 @FUNC(i64 %27)
%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:
%29 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_0 to i64))
br label LBL_7
LBL_7:
call void @free(i64* %11)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64* %indvars.iv6.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 }
uselistorder i64 10, { 1, 0 }
uselistorder label LBL_7, { 1, 0 }
uselistorder label LBL_2, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__unsigned_int_fscanf_postinc_07-good
|
goodB2G2
|
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)
%.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_6, label LBL_3
LBL_3:
%8 = load i32, i32* %sv_0, align 4
%9 = icmp eq i32 %8, -1
br i1 %9, label LBL_5, label LBL_4
LBL_4:
%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_6
LBL_5:
%13 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_3 to i64))
br label LBL_6
LBL_6:
%14 = call i64 @FUNC(i64 40)
%15 = icmp eq i64 %0, %14
store i64 0, i64* %rax.0.reg2mem
br i1 %15, label LBL_8, label LBL_7
LBL_7:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_8
LBL_8:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %sv_0, { 2, 1, 3, 0 }
uselistorder i32* %.reg2mem, { 0, 2, 1 }
uselistorder i32 (%_IO_FILE*, i8*, ...)* @fscanf, { 1, 0, 2 }
uselistorder %_IO_FILE** @gv_1, { 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__char_fscanf_square_16-good
|
goodB2G
|
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 = sub i8 0, %3
%5 = icmp slt i8 %4, 0
%6 = icmp eq i1 %5, false
%.v = select i1 %6, i8 %4, i8 %3
%7 = icmp ult i8 %.v, 12
br i1 %7, label LBL_1, label LBL_2
LBL_1:
%8 = mul i8 %3, %3
%9 = sext i8 %8 to i64
%10 = and i64 %9, 4294967295
%11 = call i64 @FUNC(i64 %10)
br label LBL_3
LBL_2:
%12 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64))
br label LBL_3
LBL_3:
%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 %3, { 1, 0, 2, 3 }
uselistorder i8* %sv_0, { 1, 0, 2 }
uselistorder i8 0, { 1, 2, 3, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE832_Unlock_of_Resource_That_is_Not_Locked__basic_08-bad
|
CWE832_Unlock_of_Resource_That_is_Not_Locked__basic_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
store i64 %0, i64* %rax.0.reg2mem
br i1 %2, label LBL_4, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([17 x i8]* @gv_0 to i64))
%4 = call i64 @FUNC(i64 ptrtoint (i32* @gv_1 to i64))
%5 = trunc i64 %4 to i32
%6 = icmp eq i32 %5, 0
%7 = icmp eq i1 %6, false
br i1 %7, label LBL_3, label LBL_2
LBL_2:
%8 = call i64 @FUNC(i64 ptrtoint ([22 x i8]* @gv_2 to i64))
call void @exit(i32 1)
unreachable
LBL_3:
%9 = call i64 @FUNC(i64 ptrtoint ([18 x i8]* @gv_3 to i64))
%10 = load i32, i32* @gv_1, align 4
%11 = sext i32 %10 to i64
%12 = call i64 @FUNC(i64 %11)
%13 = call i64 @FUNC(i64 ptrtoint ([19 x i8]* @gv_4 to i64))
%14 = load i32, i32* @gv_1, align 4
%15 = sext i32 %14 to i64
%16 = call i64 @FUNC(i64 %15)
store i64 %16, 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* @gv_1, { 2, 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__char_declare_loop_03-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
%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 = icmp eq i32 %5, 0
br i1 %6, label LBL_3, label LBL_1
LBL_1:
%7 = ptrtoint i64* %sv_1 to i64
%8 = sext i32 %5 to i64
%9 = ptrtoint i64* %sv_0 to i64
store i64 0, i64* %storemerge1.reg2mem
br label LBL_2
LBL_2:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%10 = add i64 %storemerge1.reload, %7
%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 i64 %storemerge1.reload, 1
%16 = icmp ult i64 %15, %8
store i64 %15, i64* %storemerge1.reg2mem
br i1 %16, label LBL_2, label LBL_3
LBL_3:
%17 = call i64 @FUNC(i64* nonnull %sv_0)
%18 = call i64 @FUNC(i64 40)
%19 = icmp eq i64 %0, %18
store i64 0, i64* %rax.0.reg2mem
br i1 %19, label LBL_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.reload, { 0, 2, 1 }
uselistorder i32 %5, { 1, 0 }
uselistorder i64* %sv_1, { 1, 0 }
uselistorder i64* %sv_0, { 0, 3, 1, 2 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 0, 1, 5, 4, 3, 2, 6 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE401_Memory_Leak__strdup_char_17-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = ptrtoint i64* %sv_0 to i64
%1 = call i64 @FUNC(i64 40)
%2 = add i64 %0, -97
%3 = and i64 %2, -16
%4 = inttoptr i64 %3 to i64*
store i64 7453010373645639777, i64* %4, align 16
%5 = or i64 %3, 8
%6 = inttoptr i64 %5 to i8*
store i8 0, i8* %6, align 8
%7 = call i64 @FUNC(i64 %3)
%8 = call i64 @FUNC(i64 40)
%9 = icmp eq i64 %1, %8
store i64 0, i64* %rax.0.reg2mem
br i1 %9, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %3, { 2, 0, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE127_Buffer_Underread__char_declare_cpy_11-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i8*
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%1 = load i8*, i8** %0
%sv_1 = alloca i64, align 8
%2 = call i64 @FUNC(i64 40)
%3 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
%4 = call i64 @FUNC()
%5 = trunc i64 %4 to i32
%6 = icmp eq i32 %5, 0
%7 = bitcast i64* %sv_1 to i8*
%spec.select = select i1 %6, i8* %1, i8* %7
%8 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 199)
%9 = bitcast i64* %sv_0 to i8*
%10 = call i8* @strcpy(i8* nonnull %9, i8* %spec.select)
%11 = ptrtoint i64* %sv_0 to i64
%12 = call i64 @FUNC(i64 %11)
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %2, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_0, { 2, 0, 1 }
uselistorder i8* (i8*, i8*)* @strcpy, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 3, 2, 1, 0, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__malloc_char_ncpy_17-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i8*, align 8
%sv_2 = alloca i8*, align 8
%0 = call i64 @FUNC(i64 40)
store i8* null, i8** %sv_2, align 8
%1 = call i64* @malloc(i32 100)
%2 = bitcast i64* %1 to i8*
store i8* %2, i8** %sv_1, align 8
%3 = icmp eq i64* %1, null
%4 = icmp eq i1 %3, false
br i1 %4, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%5 = bitcast i8** %sv_2 to i64*
%6 = call i64* @memset(i64* %1, i32 65, i32 99)
%7 = ptrtoint i64* %1 to i64
%8 = add i64 %7, 99
%9 = inttoptr i64 %8 to i8*
store i8 0, i8* %9, align 1
%10 = load i8*, i8** %sv_1, align 8
%11 = ptrtoint i8* %10 to i64
store i64 %11, i64* %5, align 8
%12 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%13 = bitcast i64* %sv_0 to i8*
%14 = call i8* @strncpy(i8* %10, i8* nonnull %13, i32 99)
%15 = add i64 %11, 99
%16 = inttoptr i64 %15 to i8*
store i8 0, i8* %16, align 1
%17 = load i8*, i8** %sv_2, align 8
%18 = ptrtoint i8* %17 to i64
%19 = call i64 @FUNC(i64 %18)
%20 = call i64 @FUNC(i64 40)
%21 = icmp eq i64 %0, %20
store i64 0, i64* %rax.0.reg2mem
br i1 %21, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %11, { 1, 0 }
uselistorder i8** %sv_2, { 2, 0, 1 }
uselistorder i8 0, { 1, 0, 2 }
uselistorder i64 99, { 1, 0 }
uselistorder i32 99, { 1, 2, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_declare_memcpy_07-bad
|
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_declare_memcpy_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%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
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%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_2
LBL_2:
%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* @memcpy(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_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
|
CWE510_Trapdoor__hostname_based_logic_12-bad
|
CWE510_Trapdoor__hostname_based_logic_12_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%sv_4 = alloca i32, align 4
%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_13, label LBL_1
LBL_1:
store i32 16, i32* %sv_4, align 4
%4 = call i32 @socket(i32 2, i32 1, i32 6)
%5 = icmp eq i32 %4, -1
br i1 %5, label LBL_21, label LBL_2
LBL_2:
%6 = call i64* @memset(i64* nonnull %sv_3, i32 0, i32 16)
store i64 2, i64* %sv_3, align 8
%7 = call i16 @htons(i16 20000)
%8 = bitcast i64* %sv_3 to %sockaddr*
%9 = call i32 @bind(i32 %4, %sockaddr* nonnull %8, i32 16)
%10 = icmp eq i32 %9, -1
br i1 %10, label LBL_11, label LBL_3
LBL_3:
%11 = call i32 @listen(i32 %4, i32 5)
%12 = icmp eq i32 %11, -1
br i1 %12, label LBL_11, label LBL_4
LBL_4:
%13 = call i32 @accept(i32 %4, %sockaddr* null, i32* null)
%14 = icmp eq i32 %13, -1
br i1 %14, label LBL_11, label LBL_5
LBL_5:
%15 = bitcast i64* %sv_2 to %sockaddr*
%16 = call i32 @getsockname(i32 %13, %sockaddr* nonnull %15, i32* nonnull %sv_4)
%17 = icmp eq i32 %16, -1
br i1 %17, label LBL_12, label LBL_6
LBL_6:
%18 = bitcast i64* %sv_0 to i8*
%19 = bitcast i64* %sv_1 to i8*
%20 = call i32 @getnameinfo(%sockaddr* nonnull %15, i32 16, i8* nonnull %18, i32 ptrtoint (i32* @gv_0 to i32), i8* nonnull %19, i32 32, i32 2)
%21 = icmp eq i32 %20, 0
%22 = icmp eq i1 %21, false
br i1 %22, label LBL_12, label LBL_7
LBL_7:
%23 = call i32 @strcmp(i8* getelementptr inbounds ([17 x i8], [17 x i8]* @gv_1, i64 0, i64 0), i8* nonnull %18)
%24 = icmp eq i32 %23, 0
%25 = icmp eq i1 %24, false
br i1 %25, label LBL_9, label LBL_8
LBL_8:
%26 = call i32 @send(i32 %13, i64* bitcast ([16 x i8]* @gv_2 to i64*), i32 15, i32 0)
br label LBL_12
LBL_9:
%27 = call i32 @send(i32 %13, i64* bitcast ([9 x i8]* @gv_3 to i64*), i32 8, i32 0)
%28 = icmp eq i32 %27, -1
%29 = icmp eq i1 %28, false
br i1 %29, label LBL_12, label LBL_10
LBL_10:
%30 = call i64 @FUNC(i64 ptrtoint ([13 x i8]* @gv_4 to i64))
br label LBL_12
LBL_11:
%31 = call i32 @close(i32 %4)
br label LBL_21
LBL_12:
%32 = call i32 @close(i32 %4)
%33 = call i32 @close(i32 %13)
br label LBL_21
LBL_13:
%34 = call i32 @socket(i32 2, i32 1, i32 6)
%35 = icmp eq i32 %34, -1
br i1 %35, label LBL_21, label LBL_14
LBL_14:
%36 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%37 = call i16 @htons(i16 20000)
%38 = bitcast i64* %sv_2 to %sockaddr*
%39 = call i32 @bind(i32 %34, %sockaddr* nonnull %38, i32 16)
%40 = icmp eq i32 %39, -1
br i1 %40, label LBL_19, label LBL_15
LBL_15:
%41 = call i32 @listen(i32 %34, i32 5)
%42 = icmp eq i32 %41, -1
br i1 %42, label LBL_19, label LBL_16
LBL_16:
%43 = call i32 @accept(i32 %34, %sockaddr* null, i32* null)
%44 = icmp eq i32 %43, -1
br i1 %44, label LBL_19, label LBL_17
LBL_17:
%45 = call i32 @send(i32 %43, i64* bitcast ([9 x i8]* @gv_3 to i64*), i32 8, i32 0)
%46 = icmp eq i32 %45, -1
%47 = icmp eq i1 %46, false
br i1 %47, label LBL_20, label LBL_18
LBL_18:
%48 = call i64 @FUNC(i64 ptrtoint ([13 x i8]* @gv_4 to i64))
br label LBL_20
LBL_19:
%49 = call i32 @close(i32 %34)
br label LBL_21
LBL_20:
%50 = call i32 @close(i32 %34)
%51 = call i32 @close(i32 %43)
br label LBL_21
LBL_21:
%52 = call i64 @FUNC(i64 40)
%53 = icmp eq i64 %0, %52
store i64 0, i64* %rax.0.reg2mem
br i1 %53, label LBL_23, label LBL_22
LBL_22:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_23
LBL_23:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %34, { 4, 0, 1, 2, 3, 5 }
uselistorder i32 %4, { 0, 4, 1, 2, 3, 5 }
uselistorder i64* %sv_3, { 0, 2, 1 }
uselistorder i64* %sv_2, { 0, 3, 1, 2 }
uselistorder i32 (i32)* @close, { 5, 4, 0, 3, 1, 2, 6 }
uselistorder i32 (i32, i64*, i32, i32)* @send, { 2, 1, 0, 3 }
uselistorder i32 (i32, %sockaddr*, i32*)* @accept, { 1, 0, 2 }
uselistorder i32 (i32, i32)* @listen, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32)* @bind, { 1, 0, 2 }
uselistorder i16 (i16)* @htons, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder i32 (i32, i32, i32)* @socket, { 1, 0, 2 }
uselistorder label LBL_21, { 4, 2, 0, 5, 3, 1 }
uselistorder label LBL_12, { 1, 2, 0, 3, 4 }
uselistorder label LBL_11, { 2, 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE401_Memory_Leak__struct_twoIntsStruct_realloc_01-bad
|
CWE401_Memory_Leak__struct_twoIntsStruct_realloc_01_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64* @realloc(i64* null, i32 ptrtoint (i32* @gv_0 to i32))
%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 = bitcast i64* %0 to i32*
store i32 0, i32* %3, align 4
%4 = ptrtoint i64* %0 to i64
%5 = add i64 %4, 4
%6 = inttoptr i64 %5 to i32*
store i32 0, i32* %6, align 4
%7 = call i64 @FUNC(i64 %4)
ret i64 %7
uselistorder i64* %0, { 0, 2, 1 }
}
|
1
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__float_zero_17-bad
|
CWE369_Divide_by_Zero__float_zero_17_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i128
%1 = load i128, i128* %0
%2 = load i128, i128* %0
%3 = call i128 @FUNC(i128 %2, i128 %2)
%4 = call i64 @FUNC(i128 %3)
%5 = call i128 @FUNC(i128 %3, i128 %3)
%6 = call i64 @FUNC(i128 %5)
%sv_0.0.le = trunc i64 %6 to i32
%7 = call i128 @FUNC(i128 %1, i128 %1)
%8 = call i128 @FUNC(i32 %sv_0.0.le)
%9 = call i128 @FUNC(i64 4636737291354636288)
%10 = call i128 @FUNC(i128 %9, i128 %8)
%11 = call i32 @FUNC(i128 %10)
%12 = zext i32 %11 to i64
%13 = call i64 @FUNC(i64 %12)
ret i64 %13
uselistorder i128 %3, { 1, 0, 2 }
uselistorder i128* %0, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_int_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 400)
%5 = ptrtoint i64* %4 to i64
%6 = icmp eq i64* %4, null
%7 = icmp eq i1 %6, false
store i64 %5, i64* %sv_0.0.reg2mem
br i1 %7, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%8 = bitcast i64* %sv_1 to i8*
call void @FUNC(i8* nonnull %8, i64 0, i64 50)
%9 = inttoptr i64 %sv_0.0.reload to i64*
%10 = call i64* @memmove(i64* %9, i64* nonnull %sv_1, i32 400)
%11 = inttoptr i64 %sv_0.0.reload to i32*
%12 = load i32, i32* %11, align 4
%13 = zext i32 %12 to i64
%14 = call i64 @FUNC(i64 %13)
call void @free(i64* %9)
%15 = call i64 @FUNC(i64 40)
%16 = icmp eq i64 %0, %15
store i64 0, i64* %rax.0.reg2mem
br i1 %16, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
uselistorder i64* (i64*, i64*, i32)* @memmove, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
uselistorder i32 400, { 0, 1, 3, 2 }
uselistorder i32* @gv_0, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_snprintf_14-bad
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_snprintf_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.pre-phi.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @malloc(i32 100)
%2 = icmp eq i64* %1, null
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%4 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%5 = icmp eq i32 %4, 5
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_2.LBL_5_crit_edge, label LBL_4
LBL_3:
%.pre = ptrtoint i64* %1 to i64
store i64 %.pre, i64* %.pre-phi.reg2mem
br label LBL_5
LBL_4:
%7 = call i64* @memset(i64* %1, i32 65, i32 99)
%8 = ptrtoint i64* %1 to i64
%9 = add i64 %8, 99
%10 = inttoptr i64 %9 to i8*
store i8 0, i8* %10, align 1
store i64 %8, i64* %.pre-phi.reg2mem
br label LBL_5
LBL_5:
%11 = bitcast i64* %1 to i8*
%.pre-phi.reload = load i64, i64* %.pre-phi.reg2mem
store i64 0, i64* %sv_0, align 8
%12 = call i32 @strlen(i8* %11)
%13 = bitcast i64* %sv_0 to i8*
%14 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %13, i32 %12, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0), i64* %1)
%15 = call i64 @FUNC(i64 %.pre-phi.reload)
call void @free(i64* %1)
%16 = call i64 @FUNC(i64 40)
%17 = icmp eq i64 %0, %16
store i64 0, i64* %rax.0.reg2mem
br i1 %17, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %1, { 1, 2, 6, 3, 4, 0, 5 }
uselistorder label LBL_5, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__char_calloc_06-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64* @calloc(i32 20, i32 1)
%1 = icmp eq i64* %0, null
store i64 5, i64* %rax.0.reg2mem
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = ptrtoint i64* %0 to i64
store i64 7596553777019711049, i64* %0, align 8
%3 = add i64 %2, 8
%4 = inttoptr i64 %3 to i16*
store i16 25978, i16* %4, align 2
%5 = add i64 %2, 10
%6 = inttoptr i64 %5 to i8*
store i8 0, i8* %6, align 1
%7 = call i64 @FUNC(i64 %2)
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 %2, { 0, 2, 1 }
uselistorder i64* %0, { 0, 1, 3, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__short_fscanf_multiply_05-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i16, align 2
%0 = call i64 @FUNC(i64 40)
store i16 0, i16* %sv_0, align 2
%1 = 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 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%4 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %3, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_2, i64 0, i64 0), i16* nonnull %sv_0)
br label LBL_2
LBL_2:
%5 = load i32, i32* @gv_3, align 4
%6 = icmp eq i32 %5, 0
br i1 %6, label LBL_4, label LBL_3
LBL_3:
%7 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_4 to i64))
br label LBL_8
LBL_4:
%8 = load i16, i16* %sv_0, align 2
%9 = icmp slt i16 %8, 1
br i1 %9, label LBL_8, label LBL_5
LBL_5:
%10 = icmp sgt i16 %8, 16382
br i1 %10, label LBL_7, label LBL_6
LBL_6:
%11 = mul i16 %8, 2
%12 = sext i16 %11 to i64
%13 = and i64 %12, 4294967294
%14 = call i64 @FUNC(i64 %13)
br label LBL_8
LBL_7:
%15 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_5 to i64))
br label LBL_8
LBL_8:
%16 = call i64 @FUNC(i64 40)
%17 = icmp eq i64 %0, %16
store i64 0, i64* %rax.0.reg2mem
br i1 %17, label LBL_10, label LBL_9
LBL_9:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_10
LBL_10:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i16* %sv_0, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE197_Numeric_Truncation_Error__int_fgets_to_short_08-bad
|
CWE197_Numeric_Truncation_Error__int_fgets_to_short_08_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 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
store i64 4294967295, i64* %sv_0.0.reg2mem
br i1 %3, label LBL_4, label LBL_1
LBL_1:
store i64 0, i64* %sv_1, align 8
%4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%5 = bitcast i64* %sv_1 to i8*
%6 = call i8* @fgets(i8* nonnull %5, i32 14, %_IO_FILE* %4)
%7 = icmp eq i8* %6, null
br i1 %7, label LBL_3, label LBL_2
LBL_2:
%8 = call i32 @atoi(i8* nonnull %5)
%phitmp = mul i32 %8, 65536
%phitmp1 = ashr exact i32 %phitmp, 16
%phitmp2 = zext i32 %phitmp1 to i64
store i64 %phitmp2, i64* %sv_0.0.reg2mem
br label LBL_4
LBL_3:
%9 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64))
store i64 4294967295, i64* %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%10 = call i64 @FUNC(i64 %sv_0.0.reload)
%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.0.reg2mem, { 0, 2, 1, 3 }
}
|
1
|
juliet-test-suite-c
|
CWE400_Resource_Exhaustion__listen_socket_fwrite_04-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge13.reg2mem = alloca i64
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i32 @socket(i32 2, i32 1, i32 6)
%2 = icmp eq i32 %1, -1
br i1 %2, label LBL_15, label LBL_1
LBL_1:
%3 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%4 = call i16 @htons(i16 27015)
%5 = bitcast i64* %sv_2 to %sockaddr*
%6 = call i32 @bind(i32 %1, %sockaddr* nonnull %5, i32 16)
%7 = icmp eq i32 %6, -1
br i1 %7, label LBL_6, label LBL_2
LBL_2:
%8 = call i32 @listen(i32 %1, i32 5)
%9 = icmp eq i32 %8, -1
br i1 %9, label LBL_6, label LBL_3
LBL_3:
%10 = call i32 @accept(i32 %1, %sockaddr* null, i32* null)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_6, label LBL_4
LBL_4:
%12 = call i32 @recv(i32 %10, i64* nonnull %sv_1, i32 13, i32 0)
%13 = add i32 %12, 1
%14 = icmp ult i32 %13, 2
store i32 -1, i32* %sv_0.0.ph.reg2mem
br i1 %14, label LBL_7, label LBL_5
LBL_5:
%15 = ptrtoint i64* %sv_3 to i64
%16 = sext i32 %12 to i64
%17 = add i64 %15, -22
%18 = add i64 %17, %16
%19 = inttoptr i64 %18 to i8*
store i8 0, i8* %19, align 1
%20 = bitcast i64* %sv_1 to i8*
%21 = call i32 @atoi(i8* nonnull %20)
store i32 %21, i32* %sv_0.0.ph.reg2mem
br label LBL_7
LBL_6:
%22 = call i32 @close(i32 %1)
br label LBL_15
LBL_7:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%23 = call i32 @close(i32 %1)
%24 = call i32 @close(i32 %10)
%sv_0.0.off = add i32 %sv_0.0.ph.reload, -1
%25 = icmp ugt i32 %sv_0.0.off, 19
br i1 %25, label LBL_15, label LBL_8
LBL_8:
%26 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0))
%27 = icmp eq %_IO_FILE* %26, null
%28 = icmp eq i1 %27, false
br i1 %28, label LBL_9, label LBL_10
LBL_9:
%29 = sext i32 %sv_0.0.ph.reload to i64
store i64 0, i64* %storemerge13.reg2mem
br label LBL_11
LBL_10:
call void @exit(i32 1)
unreachable
LBL_11:
%30 = call i32 @fwrite(i64* bitcast ([51 x i8]* @gv_2 to i64*), i32 1, i32 50, %_IO_FILE* %26)
%31 = icmp eq i32 %30, 50
br i1 %31, label LBL_13, label LBL_12
LBL_12:
call void @exit(i32 1)
unreachable
LBL_13:
%storemerge13.reload = load i64, i64* %storemerge13.reg2mem
%32 = add nuw i64 %storemerge13.reload, 1
%33 = icmp ult i64 %32, %29
store i64 %32, i64* %storemerge13.reg2mem
br i1 %33, label LBL_11, label LBL_14
LBL_14:
%34 = call i32 @fclose(%_IO_FILE* nonnull %26)
br label LBL_15
LBL_15:
%35 = call i64 @FUNC(i64 40)
%36 = icmp eq i64 %0, %35
store i64 0, i64* %rax.0.reg2mem
br i1 %36, label LBL_17, label LBL_16
LBL_16:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_17
LBL_17:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder %_IO_FILE* %26, { 1, 0, 2 }
uselistorder i32 %12, { 1, 0 }
uselistorder i32 %1, { 4, 0, 1, 2, 3, 5 }
uselistorder i64* %sv_2, { 0, 2, 1 }
uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 1 }
uselistorder i64* %storemerge13.reg2mem, { 1, 0, 2 }
uselistorder i32 (i32)* @close, { 5, 4, 0, 3, 2, 1, 6 }
uselistorder i32 (i8*)* @atoi, { 1, 0, 2 }
uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32*)* @accept, { 1, 0, 2 }
uselistorder i16 (i16)* @htons, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder i32 -1, { 2, 0, 4, 5, 6, 7, 3, 1, 8, 9, 10, 11 }
uselistorder i32 (i32, i32, i32)* @socket, { 1, 0, 2 }
uselistorder label LBL_15, { 2, 3, 1, 0 }
uselistorder label LBL_11, { 1, 0 }
uselistorder label LBL_7, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_declare_memcpy_03-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = ptrtoint i64* %sv_1 to i64
%2 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 49)
%3 = add i64 %1, 49
%4 = inttoptr i64 %3 to i8*
store i8 0, i8* %4, align 1
store i64 0, i64* %sv_0, align 8
%5 = bitcast i64* %sv_1 to i8*
%6 = call i32 @strlen(i8* nonnull %5)
%7 = call i64* @memcpy(i64* nonnull %sv_0, i64* nonnull %sv_1, i32 %6)
%8 = call i64 @FUNC(i64 %1)
%9 = call i64 @FUNC(i64 40)
%10 = icmp eq i64 %0, %9
store i64 0, i64* %rax.0.reg2mem
br i1 %10, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* (i64*, i64*, i32)* @memcpy, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE400_Resource_Exhaustion__connect_socket_sleep_07-bad
|
CWE400_Resource_Exhaustion__connect_socket_sleep_07_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* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 -1, 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 -1, 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_1, 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 -1, 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 -1, 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:
%23 = load i32, i32* @gv_0, align 4
%24 = icmp eq i32 %23, 5
%25 = icmp eq i1 %24, false
br i1 %25, label LBL_8, label LBL_7
LBL_7:
%sv_0.1.reload = load i32, i32* %sv_0.1.reg2mem
%26 = call i32 @usleep(i32 %sv_0.1.reload)
%27 = call i64 @FUNC(i64 ptrtoint ([29 x i8]* @gv_2 to i64))
br label LBL_8
LBL_8:
%28 = call i64 @FUNC(i64 40)
%29 = icmp eq i64 %0, %28
store i64 0, i64* %rax.0.reg2mem
br i1 %29, 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 %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 i32 -1, { 3, 2, 4, 0, 5, 1 }
uselistorder i32* @gv_0, { 1, 0 }
uselistorder label LBL_6, { 1, 0, 2 }
uselistorder label LBL_5, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__int_zero_modulo_13-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64 @FUNC(i64 2)
ret i64 %0
uselistorder i64 (i64)* @printIntLine, { 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_loop_08-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
store i64 0, i64* %sv_0.0.reg2mem
br i1 %3, label LBL_3, label LBL_1
LBL_1:
%4 = call i64* @malloc(i32 11)
%5 = ptrtoint i64* %4 to i64
%6 = icmp eq i64* %4, null
%7 = icmp eq i1 %6, false
store i64 %5, i64* %sv_0.0.reg2mem
br i1 %7, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
store i64 4702111234474983745, i64* %sv_1, align 8
%8 = bitcast i64* %sv_1 to i8*
%9 = call i32 @strlen(i8* nonnull %8)
%10 = sext i32 %9 to i64
%11 = add nsw i64 %10, 1
%12 = icmp eq i64 %11, 0
br i1 %12, label LBL_6, label LBL_4
LBL_4:
%13 = ptrtoint i64* %sv_1 to i64
store i64 0, i64* %storemerge1.reg2mem
br label LBL_5
LBL_5:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%14 = add i64 %storemerge1.reload, %sv_0.0.reload
%15 = add i64 %storemerge1.reload, %13
%16 = inttoptr i64 %15 to i8*
%17 = load i8, i8* %16, align 1
%18 = inttoptr i64 %14 to i8*
store i8 %17, i8* %18, align 1
%19 = add nuw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %19, %11
store i64 %19, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_6, label LBL_5
LBL_6:
%20 = call i64 @FUNC(i64 %sv_0.0.reload)
%21 = inttoptr i64 %sv_0.0.reload to i64*
call void @free(i64* %21)
%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 %storemerge1.reload, { 0, 2, 1 }
uselistorder i64 %sv_0.0.reload, { 1, 0, 2 }
uselistorder i64* %sv_1, { 1, 0, 2 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE606_Unchecked_Loop_Condition__char_listen_socket_05-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.lcssa.reg2mem = alloca i64
%storemerge8.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_2, align 8
%1 = bitcast i64* %sv_2 to i8*
%2 = load i32, i32* @gv_0, align 4
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_12, label LBL_1
LBL_1:
%4 = call i32 @strlen(i8* nonnull %1)
%5 = call i32 @socket(i32 2, i32 1, i32 6)
%6 = icmp eq i32 %5, -1
br i1 %6, label LBL_12, label LBL_2
LBL_2:
%7 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16)
store i64 2, i64* %sv_1, align 8
%8 = call i16 @htons(i16 27015)
%9 = bitcast i64* %sv_1 to %sockaddr*
%10 = call i32 @bind(i32 %5, %sockaddr* nonnull %9, i32 16)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_10, label LBL_3
LBL_3:
%12 = call i32 @listen(i32 %5, i32 5)
%13 = icmp eq i32 %12, -1
br i1 %13, label LBL_10, label LBL_4
LBL_4:
%14 = call i32 @accept(i32 %5, %sockaddr* null, i32* null)
%15 = icmp eq i32 %14, -1
br i1 %15, label LBL_10, label LBL_5
LBL_5:
%16 = sext i32 %4 to i64
%17 = ptrtoint i64* %sv_2 to i64
%18 = add i64 %16, %17
%19 = inttoptr i64 %18 to i64*
%20 = sub i32 99, %4
%21 = call i32 @recv(i32 %14, i64* %19, i32 %20, i32 0)
%22 = add i32 %21, 1
%23 = icmp ult i32 %22, 2
br i1 %23, label LBL_11, label LBL_6
LBL_6:
%24 = sext i32 %21 to i64
%25 = add i64 %18, %24
%26 = inttoptr i64 %25 to i8*
store i8 0, i8* %26, align 1
%27 = call i8* @strchr(i8* nonnull %1, i32 13)
%28 = icmp eq i8* %27, null
br i1 %28, label LBL_8, label LBL_7
LBL_7:
store i8 0, i8* %27, align 1
br label LBL_8
LBL_8:
%29 = call i8* @strchr(i8* nonnull %1, i32 10)
%30 = icmp eq i8* %29, null
br i1 %30, label LBL_11, label LBL_9
LBL_9:
store i8 0, i8* %29, align 1
br label LBL_11
LBL_10:
%31 = call i32 @close(i32 %5)
br label LBL_12
LBL_11:
%32 = call i32 @close(i32 %5)
%33 = call i32 @close(i32 %14)
br label LBL_12
LBL_12:
%34 = load i32, i32* @gv_1, align 4
%35 = icmp eq i32 %34, 0
br i1 %35, label LBL_14, label LBL_13
LBL_13:
%36 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64))
br label LBL_20
LBL_14:
%37 = call i32 (i8*, i8*, ...) @sscanf(i8* nonnull %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_3, i64 0, i64 0), i64* nonnull %sv_3)
%38 = icmp eq i32 %37, 1
%39 = icmp eq i1 %38, false
br i1 %39, label LBL_20, label LBL_15
LBL_15:
%40 = load i64, i64* %sv_3, align 8
%41 = trunc i64 %40 to i32
%42 = icmp sgt i32 %41, 9999
br i1 %42, label LBL_20, label LBL_16
LBL_16:
%43 = and i64 %40, 4294967295
%44 = icmp eq i64 %43, 0
store i32 0, i32* %storemerge8.reg2mem
store i64 0, i64* %sv_0.0.lcssa.reg2mem
br i1 %44, label LBL_19, label LBL_17
LBL_17:
%storemerge8.reload = load i32, i32* %storemerge8.reg2mem
%45 = add i32 %storemerge8.reload, 1
%46 = sext i32 %45 to i64
%47 = icmp sgt i64 %43, %46
store i32 %45, i32* %storemerge8.reg2mem
br i1 %47, label LBL_17, label LBL_18
LBL_18:
%phitmp = zext i32 %45 to i64
store i64 %phitmp, i64* %sv_0.0.lcssa.reg2mem
br label LBL_19
LBL_19:
%sv_0.0.lcssa.reload = load i64, i64* %sv_0.0.lcssa.reg2mem
%48 = call i64 @FUNC(i64 %sv_0.0.lcssa.reload)
br label LBL_20
LBL_20:
%49 = call i64 @FUNC(i64 40)
%50 = icmp eq i64 %0, %49
store i64 0, i64* %rax.0.reg2mem
br i1 %50, label LBL_22, label LBL_21
LBL_21:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_22
LBL_22:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %45, { 1, 0, 2 }
uselistorder i32 %21, { 1, 0 }
uselistorder i32 %5, { 4, 0, 1, 2, 3, 5 }
uselistorder i8* %1, { 3, 0, 1, 2 }
uselistorder i64* %sv_3, { 1, 0 }
uselistorder i64* %sv_1, { 0, 2, 1 }
uselistorder i32* %storemerge8.reg2mem, { 2, 0, 1 }
uselistorder i64* %sv_0.0.lcssa.reg2mem, { 0, 2, 1 }
uselistorder label LBL_19, { 1, 0 }
uselistorder label LBL_17, { 1, 0 }
uselistorder label LBL_12, { 2, 1, 0, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE789_Uncontrolled_Mem_Alloc__malloc_char_listen_socket_02-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64* @malloc(i32 20)
%1 = icmp eq i64* %0, null
%2 = icmp eq i1 %1, false
br i1 %2, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%3 = ptrtoint i64* %0 to i64
%4 = bitcast i64* %0 to i32*
store i32 1819043176, i32* %4, align 4
%5 = add i64 %3, 4
%6 = inttoptr i64 %5 to i16*
store i16 111, i16* %6, align 2
%7 = call i64 @FUNC(i64 %3)
call void @free(i64* %0)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64* %0, { 0, 1, 3, 2 }
uselistorder void (i64*)* @free, { 3, 2, 1, 0, 4 }
uselistorder void (i32)* @exit, { 3, 2, 1, 0, 4 }
uselistorder i32 -1, { 0, 1, 6, 2, 3, 4, 5, 11, 7, 8, 9, 10 }
uselistorder i64* (i32)* @malloc, { 3, 2, 1, 0, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__unsigned_int_rand_predec_17-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge2.reg2mem = alloca i64
%0 = call i32 @rand()
%1 = call i32 @rand()
%2 = call i32 @rand()
%3 = call i32 @rand()
%4 = urem i32 %0, 2
%5 = icmp eq i32 %4, 0
%6 = mul i32 %1, 1073741824
%7 = mul i32 %2, 32768
%8 = xor i32 %7, %6
%9 = xor i32 %8, %3
%10 = sext i1 %5 to i32
%storemerge4.in.le = xor i32 %9, %10
%11 = icmp eq i32 %storemerge4.in.le, 0
br i1 %11, label LBL_2, label LBL_1
LBL_1:
%12 = add i32 %storemerge4.in.le, -1
%13 = zext i32 %12 to i64
%14 = call i64 @FUNC(i64 %13)
store i64 %14, i64* %storemerge2.reg2mem
br label LBL_3
LBL_2:
%15 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_0 to i64))
store i64 %15, i64* %storemerge2.reg2mem
br label LBL_3
LBL_3:
%storemerge2.reload = load i64, i64* %storemerge2.reg2mem
ret i64 %storemerge2.reload
uselistorder i32 %storemerge4.in.le, { 1, 0 }
uselistorder i64* %storemerge2.reg2mem, { 0, 2, 1 }
uselistorder label LBL_3, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE675_Duplicate_Operations_on_Resource__freopen_07-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca %_IO_FILE*
%.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 %_IO_FILE* null, %_IO_FILE** %sv_0.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([21 x i8], [21 x i8]* @gv_1, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0))
%.pre = load i32, i32* @gv_0, align 4
store i32 %.pre, i32* %.reg2mem
store %_IO_FILE* %3, %_IO_FILE** %sv_0.0.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:
%sv_0.0.reload = load %_IO_FILE*, %_IO_FILE** %sv_0.0.reg2mem
%7 = call i32 @fclose(%_IO_FILE* %sv_0.0.reload)
%8 = sext i32 %7 to i64
store i64 %8, i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder %_IO_FILE* (i8*, i8*)* @fopen, { 1, 0, 2 }
uselistorder i32* @gv_0, { 0, 6, 5, 4, 3, 1, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE427_Uncontrolled_Search_Path_Element__char_listen_socket_08-bad
|
CWE427_Uncontrolled_Search_Path_Element__char_listen_socket_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i1
%rax.0.reg2mem = alloca i64
%1 = load i1, i1* %0
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%2 = call i64 @FUNC(i64 40)
store i64 263206486352, i64* %sv_2, align 8
%3 = ptrtoint i64* %sv_1 to i64
%4 = bitcast i64* %sv_1 to i8*
call void @FUNC(i8* nonnull %4, i64 0, i64 29)
%5 = select i1 %1, i64 -232, i64 232
%6 = add i64 %5, %3
%7 = inttoptr i64 %6 to i16*
store i16 0, i16* %7, align 8
%8 = bitcast i64* %sv_2 to i8*
%9 = call i64 @FUNC()
%10 = trunc i64 %9 to i32
%11 = icmp eq i32 %10, 0
br i1 %11, label LBL_12, label LBL_1
LBL_1:
%12 = call i32 @strlen(i8* nonnull %8)
%13 = call i32 @socket(i32 2, i32 1, i32 6)
%14 = icmp eq i32 %13, -1
br i1 %14, label LBL_12, label LBL_2
LBL_2:
%15 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16)
store i64 2, i64* %sv_0, align 8
%16 = call i16 @htons(i16 27015)
%17 = bitcast i64* %sv_0 to %sockaddr*
%18 = call i32 @bind(i32 %13, %sockaddr* nonnull %17, i32 16)
%19 = icmp eq i32 %18, -1
br i1 %19, label LBL_10, label LBL_3
LBL_3:
%20 = call i32 @listen(i32 %13, i32 5)
%21 = icmp eq i32 %20, -1
br i1 %21, label LBL_10, label LBL_4
LBL_4:
%22 = call i32 @accept(i32 %13, %sockaddr* null, i32* null)
%23 = icmp eq i32 %22, -1
br i1 %23, label LBL_10, label LBL_5
LBL_5:
%24 = sext i32 %12 to i64
%25 = ptrtoint i64* %sv_2 to i64
%26 = add i64 %24, %25
%27 = inttoptr i64 %26 to i64*
%28 = sub i32 249, %12
%29 = call i32 @recv(i32 %22, i64* %27, i32 %28, i32 0)
%30 = add i32 %29, 1
%31 = icmp ult i32 %30, 2
br i1 %31, label LBL_11, label LBL_6
LBL_6:
%32 = sext i32 %29 to i64
%33 = add i64 %26, %32
%34 = inttoptr i64 %33 to i8*
store i8 0, i8* %34, align 1
%35 = call i8* @strchr(i8* nonnull %8, i32 13)
%36 = icmp eq i8* %35, null
br i1 %36, label LBL_8, label LBL_7
LBL_7:
store i8 0, i8* %35, align 1
br label LBL_8
LBL_8:
%37 = call i8* @strchr(i8* nonnull %8, i32 10)
%38 = icmp eq i8* %37, null
br i1 %38, label LBL_11, label LBL_9
LBL_9:
store i8 0, i8* %37, align 1
br label LBL_11
LBL_10:
%39 = call i32 @close(i32 %13)
br label LBL_12
LBL_11:
%40 = call i32 @close(i32 %13)
%41 = call i32 @close(i32 %22)
br label LBL_12
LBL_12:
%42 = call i32 @putenv(i8* nonnull %8)
%43 = call i64 @FUNC(i64 40)
%44 = icmp eq i64 %2, %43
store i64 0, i64* %rax.0.reg2mem
br i1 %44, label LBL_14, label LBL_13
LBL_13:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_14
LBL_14:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %29, { 1, 0 }
uselistorder i32 %13, { 4, 0, 1, 2, 3, 5 }
uselistorder i8* %8, { 3, 0, 1, 2 }
uselistorder i64* %sv_0, { 0, 2, 1 }
uselistorder i32 (i32)* @close, { 2, 1, 0, 3 }
uselistorder i8* (i8*, i32)* @strchr, { 1, 0, 2 }
uselistorder label LBL_12, { 2, 1, 0, 3 }
}
|
1
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_ncat_08-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i8*
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = 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))
store i8* null, i8** %sv_0.0.reg2mem
br label LBL_5
LBL_2:
%5 = call i64* @malloc(i32 100)
%6 = icmp eq i64* %5, null
%7 = icmp eq i1 %6, false
br i1 %7, label LBL_4, label LBL_3
LBL_3:
call void @exit(i32 -1)
unreachable
LBL_4:
%8 = bitcast i64* %5 to i8*
store i8 0, i8* %8, align 1
store i8* %8, i8** %sv_0.0.reg2mem
br label LBL_5
LBL_5:
%sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem
%9 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%10 = bitcast i64* %sv_1 to i8*
%11 = call i8* @strncat(i8* %sv_0.0.reload, i8* nonnull %10, i32 100)
%12 = ptrtoint i8* %sv_0.0.reload to i64
%13 = call i64 @FUNC(i64 %12)
%14 = bitcast i8* %sv_0.0.reload to i64*
call void @free(i64* %14)
%15 = call i64 @FUNC(i64 40)
%16 = icmp eq i64 %0, %15
store i64 0, i64* %rax.0.reg2mem
br i1 %16, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %5, { 1, 0 }
uselistorder i8** %sv_0.0.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__float_zero_12-bad
|
CWE369_Divide_by_Zero__float_zero_12_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i128
%rax.0.reg2mem = alloca i64
%storemerge.in.reg2mem = alloca i64
%1 = load i128, i128* %0
%2 = load i128, i128* %0
%3 = call i128 @FUNC(i128 %2, i128 %2)
%4 = call i64 @FUNC(i128 %3)
%5 = call i64 @FUNC()
%6 = trunc i64 %5 to i32
%7 = icmp eq i32 %6, 0
br i1 %7, label LBL_2, label LBL_1
LBL_1:
%8 = call i128 @FUNC(i128 %3, i128 %3)
%9 = call i64 @FUNC(i128 %8)
store i64 %9, i64* %storemerge.in.reg2mem
br label LBL_3
LBL_2:
%10 = call i128 @__asm_movss.1(i32 1073741824)
%11 = call i64 @FUNC(i128 %10)
store i64 %11, i64* %storemerge.in.reg2mem
br label LBL_3
LBL_3:
%storemerge.in.reload = load i64, i64* %storemerge.in.reg2mem
%storemerge = trunc i64 %storemerge.in.reload to i32
%12 = call i64 @FUNC()
%13 = trunc i64 %12 to i32
%14 = icmp eq i32 %13, 0
br i1 %14, label LBL_5, label LBL_4
LBL_4:
%15 = call i128 @FUNC(i128 %1, i128 %1)
%16 = call i128 @FUNC(i32 %storemerge)
%17 = call i128 @FUNC(i64 4636737291354636288)
%18 = call i128 @FUNC(i128 %17, i128 %16)
%19 = call i32 @FUNC(i128 %18)
%20 = zext i32 %19 to i64
%21 = call i64 @FUNC(i64 %20)
store i64 %21, i64* %rax.0.reg2mem
br label LBL_6
LBL_5:
%22 = call i128 @__asm_movss.1(i32 %storemerge)
%23 = call i128 @__asm_movss.1(i32 2147483647)
%24 = call i128 @FUNC(i128 %22, i128 %23)
%25 = call i128 @__asm_cvtss2sd.2(i128 %24)
%26 = load i128, i128* @gv_0, align 8
call void @FUNC(i128 %25, i128 %26)
%27 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_1 to i64))
store i64 %27, 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 %storemerge, { 1, 0 }
uselistorder i128 %3, { 1, 0, 2 }
uselistorder i64* %storemerge.in.reg2mem, { 0, 2, 1 }
uselistorder i64* %rax.0.reg2mem, { 0, 2, 1 }
uselistorder i128* %0, { 1, 0 }
uselistorder i64 ()* @globalReturnsTrueOrFalse, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE400_Resource_Exhaustion__connect_socket_fwrite_05-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge2.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 20, i64* %sv_0.0.reg2mem
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
store i64 -1, i64* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%3 = load i32, i32* @gv_2, align 4
%4 = icmp eq i32 %3, 0
store i64 0, i64* %rax.0.reg2mem
br i1 %4, label LBL_9, label LBL_3
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%5 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @gv_3, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_4, i64 0, i64 0))
%6 = icmp eq %_IO_FILE* %5, null
%7 = icmp eq i1 %6, false
store i64 0, i64* %storemerge2.reg2mem
br i1 %7, label LBL_5, label LBL_4
LBL_4:
call void @exit(i32 1)
unreachable
LBL_5:
%8 = call i32 @fwrite(i64* bitcast ([51 x i8]* @gv_5 to i64*), i32 1, i32 50, %_IO_FILE* %5)
%9 = icmp eq i32 %8, 50
br i1 %9, label LBL_7, label LBL_6
LBL_6:
call void @exit(i32 1)
unreachable
LBL_7:
%storemerge2.reload = load i64, i64* %storemerge2.reg2mem
%10 = add nuw i64 %storemerge2.reload, 1
%11 = icmp ult i64 %10, %sv_0.0.reload
store i64 %10, i64* %storemerge2.reg2mem
br i1 %11, label LBL_5, label LBL_8
LBL_8:
%12 = call i32 @fclose(%_IO_FILE* nonnull %5)
%13 = sext i32 %12 to i64
store i64 %13, 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 %_IO_FILE* %5, { 1, 0, 2 }
uselistorder i64* %sv_0.0.reg2mem, { 0, 2, 1 }
uselistorder i64* %storemerge2.reg2mem, { 2, 0, 1 }
uselistorder i32* @gv_0, { 1, 0 }
uselistorder label LBL_5, { 1, 0 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__unsigned_int_fscanf_multiply_05-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i32, align 4
%0 = call i64 @FUNC(i64 40)
store i32 0, i32* %sv_0, align 4
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_2, 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)
br label LBL_2
LBL_2:
%5 = load i32, i32* @gv_3, align 4
%6 = icmp eq i32 %5, 0
br i1 %6, label LBL_4, label LBL_3
LBL_3:
%7 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_4 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_5 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 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_loop_07-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i64 0, i64* %sv_0.0.reg2mem
br i1 %3, label LBL_4, label LBL_1
LBL_1:
%4 = call i64* @malloc(i32 100)
%5 = icmp eq i64* %4, null
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%7 = ptrtoint i64* %4 to i64
%8 = bitcast i64* %4 to i8*
store i8 0, i8* %8, align 1
store i64 %7, i64* %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%9 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%10 = ptrtoint i64* %sv_1 to i64
store i64 0, i64* %storemerge1.reg2mem
br label LBL_5
LBL_5:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%11 = add i64 %storemerge1.reload, %sv_0.0.reload
%12 = add i64 %storemerge1.reload, %10
%13 = inttoptr i64 %12 to i8*
%14 = load i8, i8* %13, align 1
%15 = inttoptr i64 %11 to i8*
store i8 %14, i8* %15, align 1
%16 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %16, 100
store i64 %16, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_6, label LBL_5
LBL_6:
%17 = add i64 %sv_0.0.reload, 99
%18 = inttoptr i64 %17 to i8*
store i8 0, i8* %18, align 1
%19 = call i64 @FUNC(i64 %sv_0.0.reload)
%20 = inttoptr i64 %sv_0.0.reload to i64*
call void @free(i64* %20)
%21 = call i64 @FUNC(i64 40)
%22 = icmp eq i64 %0, %21
store i64 0, i64* %rax.0.reg2mem
br i1 %22, label LBL_8, label LBL_7
LBL_7:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_8
LBL_8:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %storemerge1.reload, { 0, 2, 1 }
uselistorder i64 %sv_0.0.reload, { 1, 2, 0, 3 }
uselistorder i64* %4, { 0, 2, 1 }
uselistorder i64* %sv_1, { 1, 0 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder i32* @gv_0, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__CWE839_connect_socket_07-bad
|
CWE124_Buffer_Underwrite__CWE839_connect_socket_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%indvars.iv.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 = ptrtoint i64* %sv_3 to i64
%1 = call i64 @FUNC(i64 40)
%2 = load i32, i32* @gv_0, align 4
%3 = icmp eq i32 %2, 5
%4 = icmp eq i1 %3, false
store i32 -1, i32* %sv_0.1.reg2mem
br i1 %4, label LBL_6, label LBL_1
LBL_1:
%5 = call i32 @socket(i32 2, i32 1, i32 6)
%6 = icmp eq i32 %5, -1
store i32 -1, i32* %sv_0.1.reg2mem
br i1 %6, label LBL_6, label LBL_2
LBL_2:
%7 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%8 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_1, i64 0, i64 0))
%9 = call i16 @htons(i16 27015)
%10 = bitcast i64* %sv_2 to %sockaddr*
%11 = call i32 @connect(i32 %5, %sockaddr* nonnull %10, i32 16)
%12 = icmp eq i32 %11, -1
store i32 -1, i32* %sv_0.0.ph.reg2mem
br i1 %12, label LBL_5, label LBL_3
LBL_3:
%13 = call i32 @recv(i32 %5, i64* nonnull %sv_1, i32 13, i32 0)
%14 = add i32 %13, 1
%15 = icmp ult i32 %14, 2
store i32 -1, i32* %sv_0.0.ph.reg2mem
br i1 %15, label LBL_5, label LBL_4
LBL_4:
%16 = sext i32 %13 to i64
%17 = add i64 %0, -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 %5)
store i32 %sv_0.0.ph.reload, i32* %sv_0.1.reg2mem
br label LBL_6
LBL_6:
%23 = load i32, i32* @gv_0, align 4
%24 = icmp eq i32 %23, 5
%25 = icmp eq i1 %24, false
br i1 %25, label LBL_11, label LBL_7
LBL_7:
%sv_0.1.reload = load i32, i32* %sv_0.1.reg2mem
store i64 0, i64* %sv_2, align 8
%26 = icmp sgt i32 %sv_0.1.reload, 9
br i1 %26, label LBL_10, label LBL_8
LBL_8:
%27 = sext i32 %sv_0.1.reload to i64
%28 = mul i64 %27, 4
%29 = add i64 %0, -64
%30 = add i64 %28, %29
%31 = inttoptr i64 %30 to i32*
store i32 1, i32* %31, align 4
store i64 0, i64* %indvars.iv.reg2mem
br label LBL_9
LBL_9:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%32 = mul i64 %indvars.iv.reload, 4
%33 = add i64 %32, %29
%34 = inttoptr i64 %33 to i32*
%35 = load i32, i32* %34, align 4
%36 = zext i32 %35 to i64
%37 = call i64 @FUNC(i64 %36)
%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_11, label LBL_9
LBL_10:
%38 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_2 to i64))
br label LBL_11
LBL_11:
%39 = call i64 @FUNC(i64 40)
%40 = icmp eq i64 %1, %39
store i64 0, i64* %rax.0.reg2mem
br i1 %40, 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 %13, { 1, 0 }
uselistorder i32 %5, { 2, 0, 1, 3 }
uselistorder i64 %0, { 1, 0 }
uselistorder i64* %sv_2, { 2, 0, 3, 1 }
uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 3, 2, 1 }
uselistorder i32* %sv_0.1.reg2mem, { 0, 2, 1, 3 }
uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 }
uselistorder i32 -1, { 3, 2, 4, 0, 5, 1 }
uselistorder i32* @gv_0, { 1, 0 }
uselistorder label LBL_11, { 1, 0, 2 }
uselistorder label LBL_6, { 1, 0, 2 }
uselistorder label LBL_5, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_alloca_memmove_12-bad
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_alloca_memmove_12_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge2.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = ptrtoint i64* %sv_1 to i64
%1 = call i64 @FUNC(i64 40)
%2 = ptrtoint i64* %sv_2 to i64
%3 = call i64 @FUNC()
%4 = trunc i64 %3 to i32
%5 = icmp eq i32 %4, 0
%storemerge1.v.v = select i1 %5, i64 add (i64 add (i64 sub (i64 0, i64 and (i64 trunc (i128 mul (i128 sext (i64 trunc (i128 udiv (i128 zext (i64 add (i64 ptrtoint ([12 x i8]* @gv_0 to i64), i64 15) to i128), i128 16) to i64) to i128), i128 16) to i64), i64 4095)), i64 15), i64 add (i64 sub (i64 0, i64 and (i64 trunc (i128 mul (i128 sext (i64 trunc (i128 udiv (i128 zext (i64 add (i64 ptrtoint ([12 x i8]* @gv_0 to i64), i64 15) to i128), i128 16) to i64) to i128), i128 16) to i64), i64 -4096)), i64 -416)), i64 -401
%storemerge1.v = add i64 %storemerge1.v.v, %0
%storemerge1 = and i64 %storemerge1.v, -16
store i64 %storemerge1, i64* %sv_1, align 8
store i64 0, i64* %storemerge2.reg2mem
br label LBL_1
LBL_1:
%storemerge2.reload = load i64, i64* %storemerge2.reg2mem
%6 = mul i64 %storemerge2.reload, 8
%7 = add i64 %6, %2
%8 = add i64 %7, -816
%9 = inttoptr i64 %8 to i32*
store i32 0, i32* %9, align 8
%10 = add i64 %7, -812
%11 = inttoptr i64 %10 to i32*
store i32 0, i32* %11, align 4
%12 = add nuw nsw i64 %storemerge2.reload, 1
%exitcond = icmp eq i64 %12, 100
store i64 %12, i64* %storemerge2.reg2mem
br i1 %exitcond, label LBL_2, label LBL_1
LBL_2:
%13 = load i64, i64* %sv_1, align 8
%14 = inttoptr i64 %13 to i64*
%15 = call i64* @memmove(i64* %14, i64* nonnull %sv_0, i32 ptrtoint (i32* @gv_1 to i32))
%16 = load i64, i64* %sv_1, align 8
%17 = call i64 @FUNC(i64 %16)
%18 = call i64 @FUNC(i64 40)
%19 = icmp eq i64 %1, %18
store i64 0, i64* %rax.0.reg2mem
br i1 %19, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_1, { 1, 2, 0, 3 }
uselistorder i64* %storemerge2.reg2mem, { 1, 0, 2 }
uselistorder i64 trunc (i128 mul (i128 sext (i64 trunc (i128 udiv (i128 zext (i64 add (i64 ptrtoint ([12 x i8]* @gv_0 to i64), i64 15) to i128), i128 16) to i64) to i128), i128 16) to i64), { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__struct_array_malloc_no_init_08-bad
|
CWE457_Use_of_Uninitialized_Variable__struct_array_malloc_no_init_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.1.reg2mem = alloca i64
%indvars.iv.reg2mem = alloca i64
%0 = call i64* @malloc(i32 80)
%1 = icmp eq i64* %0, null
%2 = icmp eq i1 %1, false
br i1 %2, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%3 = ptrtoint i64* %0 to i64
%4 = call i64 @FUNC()
%5 = call i64 @FUNC()
%6 = trunc i64 %5 to i32
%7 = icmp eq i32 %6, 0
store i64 0, i64* %indvars.iv.reg2mem
store i64 %5, i64* %rax.1.reg2mem
br i1 %7, label LBL_4, label LBL_3
LBL_3:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%8 = mul i64 %indvars.iv.reload, 8
%9 = add i64 %8, %3
%10 = inttoptr i64 %9 to i32*
%11 = load i32, i32* %10, align 4
%12 = zext i32 %11 to i64
%13 = call i64 @FUNC(i64 %12)
%14 = add i64 %9, 4
%15 = inttoptr i64 %14 to i32*
%16 = load i32, i32* %15, align 4
%17 = zext i32 %16 to i64
%18 = call i64 @FUNC(i64 %17)
%indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1
%exitcond = icmp eq i64 %indvars.iv.next, 10
store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem
store i64 %18, i64* %rax.1.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
%rax.1.reload = load i64, i64* %rax.1.reg2mem
ret i64 %rax.1.reload
uselistorder i64* %0, { 1, 0 }
uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
uselistorder i64 ()* @staticReturnsTrue, { 1, 0 }
uselistorder label LBL_3, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int_fscanf_predec_12-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i32, align 4
%0 = call i64 @FUNC(i64 40)
store i32 0, i32* %sv_0, align 4
%1 = call i64 @FUNC()
%2 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%3 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %2, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0)
%4 = call i64 @FUNC()
%5 = trunc i64 %4 to i32
%6 = icmp eq i32 %5, 0
%7 = load i32, i32* %sv_0, align 4
%8 = icmp eq i32 %7, -2147483648
br i1 %6, label LBL_4, label LBL_1
LBL_1:
br i1 %8, label LBL_3, label LBL_2
LBL_2:
%9 = add i32 %7, -1
store i32 %9, i32* %sv_0, align 4
%10 = zext i32 %9 to i64
%11 = call i64 @FUNC(i64 %10)
br label LBL_7
LBL_3:
%12 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64))
br label LBL_7
LBL_4:
br i1 %8, label LBL_6, label LBL_5
LBL_5:
%13 = add i32 %7, -1
store i32 %13, i32* %sv_0, align 4
%14 = zext i32 %13 to i64
%15 = call i64 @FUNC(i64 %14)
br label LBL_7
LBL_6:
%16 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64))
br label LBL_7
LBL_7:
%17 = call i64 @FUNC(i64 40)
%18 = icmp eq i64 %0, %17
store i64 0, i64* %rax.0.reg2mem
br i1 %18, label LBL_9, label LBL_8
LBL_8:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_9
LBL_9:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i1 %8, { 1, 0 }
uselistorder i32 %7, { 1, 0, 2 }
uselistorder i32* %sv_0, { 1, 3, 2, 0, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE377_Insecure_Temporary_File__char_mktemp_07-bad
|
CWE377_Insecure_Temporary_File__char_mktemp_07_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, 5
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_5, label LBL_1
LBL_1:
store i64 6365935209750752870, i64* %sv_0, align 8
%4 = bitcast i64* %sv_0 to i8*
%5 = call i8* @mktemp(i8* nonnull %4)
%6 = icmp eq i8* %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 = ptrtoint i8* %5 to i64
%9 = call i64 @FUNC(i64 %8)
%10 = call i32 (i8*, i32, ...) @open(i8* %5, i32 66)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_5, label LBL_4
LBL_4:
%12 = call i64 @FUNC(i64 ptrtoint ([45 x i8]* @gv_1 to i64))
%13 = call i32 @close(i32 %10)
br label LBL_5
LBL_5:
%14 = call i64 @FUNC(i64 40)
%15 = icmp eq i64 %0, %14
store i64 0, i64* %rax.0.reg2mem
br i1 %15, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %5, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__int64_t_11-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i64
%rax.0.reg2mem = alloca i64
%1 = load i64, i64* %0
%2 = call i64 @FUNC()
%3 = call i64 @FUNC()
%4 = trunc i64 %3 to i32
%5 = icmp eq i32 %4, 0
store i64 %3, i64* %rax.0.reg2mem
br i1 %5, label LBL_2, label LBL_1
LBL_1:
%6 = trunc i64 %2 to i32
%7 = icmp eq i32 %6, 0
%spec.select = select i1 %7, i64 %1, i64 5
%8 = call i64 @FUNC(i64 %spec.select)
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
uselistorder i64 (i64)* @printLongLongLine, { 3, 2, 1, 0 }
uselistorder i64 5, { 1, 0, 2, 3 }
uselistorder i64 ()* @globalReturnsTrue, { 5, 4, 3, 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE590_Free_Memory_Not_on_Heap__free_int_alloca_15-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge1.reg2mem = alloca i64
%0 = call i64* @malloc(i32 400)
%1 = ptrtoint i64* %0 to i64
%2 = icmp eq i64* %0, null
%3 = icmp eq i1 %2, false
store i64 0, i64* %storemerge1.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_0 to i64))
call void @exit(i32 1)
unreachable
LBL_2:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%5 = mul i64 %storemerge1.reload, 4
%6 = add i64 %5, %1
%7 = inttoptr i64 %6 to i32*
store i32 5, i32* %7, align 4
%8 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %8, 100
store i64 %8, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_3, label LBL_2
LBL_3:
%9 = bitcast i64* %0 to i32*
%10 = load i32, i32* %9, align 4
%11 = zext i32 %10 to i64
%12 = call i64 @FUNC(i64 %11)
call void @free(i64* %0)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE665_Improper_Initialization__char_ncat_14-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = bitcast i64* %sv_1 to i8*
%2 = load i32, i32* @gv_0, align 4
%3 = icmp eq i32 %2, 5
%4 = icmp eq i1 %3, false
br i1 %4, label LBL_2, label LBL_1
LBL_1:
store i8 0, i8* %1, align 8
br label LBL_2
LBL_2:
%5 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%6 = bitcast i64* %sv_0 to i8*
%7 = call i32 @strlen(i8* nonnull %6)
%8 = call i8* @strncat(i8* nonnull %1, i8* nonnull %6, i32 %7)
%9 = ptrtoint i64* %sv_1 to i64
%10 = call i64 @FUNC(i64 %9)
%11 = call i64 @FUNC(i64 40)
%12 = icmp eq i64 %0, %11
store i64 0, i64* %rax.0.reg2mem
br i1 %12, label LBL_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* (i8*, i8*, i32)* @strncat, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE606_Unchecked_Loop_Condition__char_listen_socket_08-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.lcssa.reg2mem = alloca i64
%storemerge8.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_2, align 8
%1 = bitcast i64* %sv_2 to i8*
%2 = call i64 @FUNC()
%3 = trunc i64 %2 to i32
%4 = icmp eq i32 %3, 0
br i1 %4, label LBL_12, label LBL_1
LBL_1:
%5 = call i32 @strlen(i8* nonnull %1)
%6 = call i32 @socket(i32 2, i32 1, i32 6)
%7 = icmp eq i32 %6, -1
br i1 %7, label LBL_12, label LBL_2
LBL_2:
%8 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16)
store i64 2, i64* %sv_1, align 8
%9 = call i16 @htons(i16 27015)
%10 = bitcast i64* %sv_1 to %sockaddr*
%11 = call i32 @bind(i32 %6, %sockaddr* nonnull %10, i32 16)
%12 = icmp eq i32 %11, -1
br i1 %12, label LBL_10, label LBL_3
LBL_3:
%13 = call i32 @listen(i32 %6, i32 5)
%14 = icmp eq i32 %13, -1
br i1 %14, label LBL_10, label LBL_4
LBL_4:
%15 = call i32 @accept(i32 %6, %sockaddr* null, i32* null)
%16 = icmp eq i32 %15, -1
br i1 %16, label LBL_10, label LBL_5
LBL_5:
%17 = sext i32 %5 to i64
%18 = ptrtoint i64* %sv_2 to i64
%19 = add i64 %17, %18
%20 = inttoptr i64 %19 to i64*
%21 = sub i32 99, %5
%22 = call i32 @recv(i32 %15, i64* %20, i32 %21, i32 0)
%23 = add i32 %22, 1
%24 = icmp ult i32 %23, 2
br i1 %24, label LBL_11, label LBL_6
LBL_6:
%25 = sext i32 %22 to i64
%26 = add i64 %19, %25
%27 = inttoptr i64 %26 to i8*
store i8 0, i8* %27, align 1
%28 = call i8* @strchr(i8* nonnull %1, i32 13)
%29 = icmp eq i8* %28, null
br i1 %29, label LBL_8, label LBL_7
LBL_7:
store i8 0, i8* %28, align 1
br label LBL_8
LBL_8:
%30 = call i8* @strchr(i8* nonnull %1, i32 10)
%31 = icmp eq i8* %30, null
br i1 %31, label LBL_11, label LBL_9
LBL_9:
store i8 0, i8* %30, align 1
br label LBL_11
LBL_10:
%32 = call i32 @close(i32 %6)
br label LBL_12
LBL_11:
%33 = call i32 @close(i32 %6)
%34 = call i32 @close(i32 %15)
br label LBL_12
LBL_12:
%35 = call i64 @FUNC()
%36 = trunc i64 %35 to i32
%37 = icmp eq i32 %36, 0
br i1 %37, label LBL_19, label LBL_13
LBL_13:
%38 = call i32 (i8*, i8*, ...) @sscanf(i8* nonnull %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0), i64* nonnull %sv_3)
%39 = icmp eq i32 %38, 1
%40 = icmp eq i1 %39, false
br i1 %40, label LBL_19, label LBL_14
LBL_14:
%41 = load i64, i64* %sv_3, align 8
%42 = trunc i64 %41 to i32
%43 = icmp sgt i32 %42, 9999
br i1 %43, label LBL_19, label LBL_15
LBL_15:
%44 = and i64 %41, 4294967295
%45 = icmp eq i64 %44, 0
store i32 0, i32* %storemerge8.reg2mem
store i64 0, i64* %sv_0.0.lcssa.reg2mem
br i1 %45, label LBL_18, label LBL_16
LBL_16:
%storemerge8.reload = load i32, i32* %storemerge8.reg2mem
%46 = add i32 %storemerge8.reload, 1
%47 = sext i32 %46 to i64
%48 = icmp sgt i64 %44, %47
store i32 %46, i32* %storemerge8.reg2mem
br i1 %48, label LBL_16, label LBL_17
LBL_17:
%phitmp = zext i32 %46 to i64
store i64 %phitmp, i64* %sv_0.0.lcssa.reg2mem
br label LBL_18
LBL_18:
%sv_0.0.lcssa.reload = load i64, i64* %sv_0.0.lcssa.reg2mem
%49 = call i64 @FUNC(i64 %sv_0.0.lcssa.reload)
br label LBL_19
LBL_19:
%50 = call i64 @FUNC(i64 40)
%51 = icmp eq i64 %0, %50
store i64 0, i64* %rax.0.reg2mem
br i1 %51, label LBL_21, label LBL_20
LBL_20:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_21
LBL_21:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %46, { 1, 0, 2 }
uselistorder i32 %22, { 1, 0 }
uselistorder i32 %6, { 4, 0, 1, 2, 3, 5 }
uselistorder i8* %1, { 3, 0, 1, 2 }
uselistorder i64* %sv_3, { 1, 0 }
uselistorder i64* %sv_1, { 0, 2, 1 }
uselistorder i32* %storemerge8.reg2mem, { 2, 0, 1 }
uselistorder i64* %sv_0.0.lcssa.reg2mem, { 0, 2, 1 }
uselistorder i32 (i32)* @close, { 5, 4, 0, 3, 2, 1, 6 }
uselistorder i8* (i8*, i32)* @strchr, { 3, 2, 1, 0, 4 }
uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32*)* @accept, { 1, 0, 2 }
uselistorder i32 (i32, i32)* @listen, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32)* @bind, { 1, 0, 2 }
uselistorder i16 (i16)* @htons, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder i32 (i32, i32, i32)* @socket, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
uselistorder label LBL_18, { 1, 0 }
uselistorder label LBL_16, { 1, 0 }
uselistorder label LBL_12, { 2, 1, 0, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int64_t_rand_add_05-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
store i64 0, i64* %rax.0.reg2mem
br i1 %1, label LBL_5, label LBL_1
LBL_1:
%2 = call i32 @rand()
%3 = call i32 @rand()
%4 = call i32 @rand()
%5 = call i32 @rand()
%6 = call i32 @rand()
%7 = call i32 @rand()
%.pr = load i32, i32* @gv_0, align 4
%8 = icmp eq i32 %.pr, 0
store i64 0, i64* %rax.0.reg2mem
br i1 %8, label LBL_5, label LBL_2
LBL_2:
%9 = urem i32 %2, 2
%10 = icmp eq i32 %9, 0
%11 = zext i32 %3 to i64
%12 = mul i64 %11, 1152921504606846976
%13 = zext i32 %4 to i64
%14 = mul i64 %13, 35184372088832
%15 = sext i32 %5 to i64
%16 = mul i64 %15, 1073741824
%17 = sext i32 %6 to i64
%18 = mul i64 %17, 32768
%19 = sext i32 %7 to i64
%20 = sext i1 %10 to i64
%21 = xor i64 %12, %20
%22 = xor i64 %21, %14
%23 = xor i64 %22, %16
%24 = xor i64 %23, %18
%storemerge = xor i64 %24, %19
%25 = icmp eq i64 %storemerge, 9223372036854775807
br i1 %25, label LBL_4, label LBL_3
LBL_3:
%26 = add i64 %storemerge, 1
%27 = call i64 @FUNC(i64 %26)
store i64 %27, i64* %rax.0.reg2mem
br label LBL_5
LBL_4:
%28 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_1 to i64))
store i64 %28, i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %rax.0.reg2mem, { 0, 3, 2, 4, 1 }
uselistorder label LBL_5, { 1, 2, 3, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_alloca_ncat_13-bad
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_alloca_ncat_13_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 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 8336 to i32*), align 16
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = ptrtoint i64* %sv_2 to i64
%5 = add i64 %4, -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_2
LBL_2:
%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* @strncat(i8* %sv_0.0.reload, i8* nonnull %9, i32 100)
%11 = ptrtoint i8* %sv_0.0.reload 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_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_connect_socket_postinc_05-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.1.ph.reg2mem = alloca i32
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_10, label LBL_1
LBL_1:
%3 = call i32 @socket(i32 2, i32 1, i32 6)
%4 = icmp eq i32 %3, -1
store i32 0, i32* %sv_0.1.ph.reg2mem
br i1 %4, label LBL_6, label LBL_2
LBL_2:
%5 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%6 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_1, i64 0, i64 0))
%7 = call i16 @htons(i16 27015)
%8 = bitcast i64* %sv_2 to %sockaddr*
%9 = call i32 @connect(i32 %3, %sockaddr* nonnull %8, i32 16)
%10 = icmp eq i32 %9, -1
store i32 0, i32* %sv_0.0.ph.reg2mem
br i1 %10, label LBL_5, label LBL_3
LBL_3:
%11 = call i32 @recv(i32 %3, i64* nonnull %sv_1, i32 13, i32 0)
%12 = add i32 %11, 1
%13 = icmp ult i32 %12, 2
store i32 0, i32* %sv_0.0.ph.reg2mem
br i1 %13, label LBL_5, label LBL_4
LBL_4:
%14 = ptrtoint i64* %sv_3 to i64
%15 = sext i32 %11 to i64
%16 = add i64 %14, -22
%17 = add i64 %16, %15
%18 = inttoptr i64 %17 to i8*
store i8 0, i8* %18, align 1
%19 = bitcast i64* %sv_1 to i8*
%20 = call i32 @atoi(i8* nonnull %19)
store i32 %20, i32* %sv_0.0.ph.reg2mem
br label LBL_5
LBL_5:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%21 = call i32 @close(i32 %3)
store i32 %sv_0.0.ph.reload, i32* %sv_0.1.ph.reg2mem
br label LBL_6
LBL_6:
%.pr = load i32, i32* @gv_0, align 4
%22 = icmp eq i32 %.pr, 0
br i1 %22, label LBL_10, label LBL_7
LBL_7:
%sv_0.1.ph.reload = load i32, i32* %sv_0.1.ph.reg2mem
%23 = icmp eq i32 %sv_0.1.ph.reload, 2147483647
br i1 %23, label LBL_9, label LBL_8
LBL_8:
%24 = add i32 %sv_0.1.ph.reload, 1
%25 = zext i32 %24 to i64
%26 = call i64 @FUNC(i64 %25)
br label LBL_10
LBL_9:
%27 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64))
br label LBL_10
LBL_10:
%28 = call i64 @FUNC(i64 40)
%29 = icmp eq i64 %0, %28
store i64 0, i64* %rax.0.reg2mem
br i1 %29, label LBL_12, label LBL_11
LBL_11:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_12
LBL_12:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %sv_0.1.ph.reload, { 1, 0 }
uselistorder i32 %11, { 1, 0 }
uselistorder i32 %3, { 2, 0, 1, 3 }
uselistorder i64* %sv_2, { 0, 2, 1 }
uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 3, 2, 1 }
uselistorder i32 (i32)* @close, { 1, 0, 2 }
uselistorder i32 (i8*)* @atoi, { 1, 0, 2 }
uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32)* @connect, { 1, 0, 2 }
uselistorder i16 (i16)* @htons, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder label LBL_10, { 1, 2, 3, 0 }
uselistorder label LBL_6, { 1, 0 }
uselistorder label LBL_5, { 1, 2, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__char_declare_memcpy_07-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @memset(i64* nonnull %sv_2, i32 65, i32 99)
%2 = load i32, i32* @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 = ptrtoint i64* %sv_2 to i64
store i64 %5, i64* %sv_0.0.reg2mem
br label LBL_3
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%6 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%7 = load i64, i64* %sv_1, align 8
%8 = inttoptr i64 %sv_0.0.reload to i64*
store i64 %7, i64* %8, align 8
%9 = add i64 %sv_0.0.reload, 8
%10 = inttoptr i64 %9 to i64*
%11 = add i64 %sv_0.0.reload, 16
%12 = inttoptr i64 %11 to i64*
%13 = add i64 %sv_0.0.reload, 24
%14 = inttoptr i64 %13 to i64*
%15 = add i64 %sv_0.0.reload, 32
%16 = inttoptr i64 %15 to i64*
%17 = add i64 %sv_0.0.reload, 40
%18 = inttoptr i64 %17 to i64*
%19 = add i64 %sv_0.0.reload, 48
%20 = inttoptr i64 %19 to i64*
%21 = add i64 %sv_0.0.reload, 56
%22 = inttoptr i64 %21 to i64*
%23 = add i64 %sv_0.0.reload, 64
%24 = inttoptr i64 %23 to i64*
%25 = add i64 %sv_0.0.reload, 72
%26 = inttoptr i64 %25 to i64*
%27 = add i64 %sv_0.0.reload, 80
%28 = inttoptr i64 %27 to i64*
%29 = add i64 %sv_0.0.reload, 88
%30 = inttoptr i64 %29 to i64*
%31 = add i64 %sv_0.0.reload, 96
%32 = inttoptr i64 %31 to i32*
%33 = add i64 %sv_0.0.reload, 99
%34 = inttoptr i64 %33 to i8*
store i8 0, i8* %34, align 1
%35 = call i64 @FUNC(i64 %sv_0.0.reload)
%36 = call i64 @FUNC(i64 40)
%37 = icmp eq i64 %0, %36
store i64 0, i64* %rax.0.reg2mem
br i1 %37, 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.reload, { 14, 13, 12, 4, 11, 1, 10, 9, 8, 7, 6, 5, 3, 2, 0 }
uselistorder i64* %sv_2, { 1, 0 }
uselistorder i64* %sv_1, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE127_Buffer_Underread__char_alloca_loop_14-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
%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, -97
%5 = and i64 %4, -16
%6 = inttoptr i64 %5 to i64*
%7 = call i64* @memset(i64* %6, i32 65, i32 99)
%8 = add i64 %5, 99
%9 = inttoptr i64 %8 to i8*
store i8 0, i8* %9, align 1
%10 = load i32, i32* @gv_0, align 4
%11 = icmp eq i32 %10, 5
%12 = icmp eq i1 %11, false
%spec.select = select i1 %12, i64 %1, i64 %5
%13 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%14 = 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
%15 = add i64 %storemerge1.reload, %spec.select
%16 = inttoptr i64 %15 to i8*
%17 = load i8, i8* %16, align 1
%18 = add i64 %storemerge1.reload, %14
%19 = inttoptr i64 %18 to i8*
store i8 %17, i8* %19, align 1
%20 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %20, 100
store i64 %20, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_2, label LBL_1
LBL_2:
%21 = call i64 @FUNC(i64 %14)
%22 = call i64 @FUNC(i64 40)
%23 = icmp eq i64 %3, %22
store i64 0, i64* %rax.0.reg2mem
br i1 %23, 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 %14, { 1, 0 }
uselistorder i64 %5, { 0, 2, 1 }
uselistorder i64* %sv_0, { 1, 0 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 0, 3, 2, 1, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_declare_memcpy_08-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
%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 = 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_2
LBL_2:
%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* @memcpy(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_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 (i8*)* @strlen, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__short_rand_multiply_04-bad
|
CWE191_Integer_Underflow__short_rand_multiply_04_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i32 @rand()
%1 = urem i32 %0, 2
%2 = icmp eq i32 %1, 0
%3 = call i32 @rand()
%4 = call i32 @rand()
%5 = mul i32 %4, 32768
%6 = call i32 @rand()
%7 = xor i32 %6, %5
%8 = sext i1 %2 to i32
%storemerge.in = xor i32 %7, %8
%9 = trunc i32 %storemerge.in to i16
%10 = icmp slt i16 %9, 0
%11 = icmp eq i1 %10, false
store i64 1, i64* %rax.0.reg2mem
br i1 %11, label LBL_2, label LBL_1
LBL_1:
%sext2 = mul i32 %storemerge.in, 131072
%12 = ashr exact i32 %sext2, 16
%13 = zext i32 %12 to i64
%14 = call i64 @FUNC(i64 %13)
store i64 %14, 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
|
CWE124_Buffer_Underwrite__char_declare_loop_02-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 = add i64 %storemerge1.reload, %4
%7 = inttoptr i64 %6 to i8*
%8 = load i8, i8* %7, align 1
%9 = inttoptr i64 %5 to i8*
store i8 %8, 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 = add i64 %2, 99
%12 = inttoptr i64 %11 to i8*
store i8 0, i8* %12, align 1
%13 = call i64 @FUNC(i64 %2)
%14 = call i64 @FUNC(i64 40)
%15 = icmp eq i64 %0, %14
store i64 0, i64* %rax.0.reg2mem
br i1 %15, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %storemerge1.reload, { 0, 2, 1 }
uselistorder i64 %2, { 1, 2, 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, 1, 3, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_connect_socket_multiply_01-bad
|
CWE190_Integer_Overflow__int_connect_socket_multiply_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)
%1 = call i32 @socket(i32 2, i32 1, i32 6)
%2 = icmp eq i32 %1, -1
br i1 %2, label LBL_6, label LBL_1
LBL_1:
%3 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16)
store i64 2, i64* %sv_1, align 8
%4 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%5 = call i16 @htons(i16 27015)
%6 = bitcast i64* %sv_1 to %sockaddr*
%7 = call i32 @connect(i32 %1, %sockaddr* nonnull %6, i32 16)
%8 = icmp eq i32 %7, -1
br i1 %8, label LBL_3, label LBL_2
LBL_2:
%9 = call i32 @recv(i32 %1, i64* nonnull %sv_0, i32 13, i32 0)
%10 = add i32 %9, 1
%11 = icmp ult i32 %10, 2
br i1 %11, label LBL_3, label LBL_4
LBL_3:
%12 = call i32 @close(i32 %1)
br label LBL_6
LBL_4:
%13 = ptrtoint i64* %sv_2 to i64
%14 = sext i32 %9 to i64
%15 = add i64 %13, -22
%16 = add i64 %15, %14
%17 = inttoptr i64 %16 to i8*
store i8 0, i8* %17, align 1
%18 = bitcast i64* %sv_0 to i8*
%19 = call i32 @atoi(i8* nonnull %18)
%20 = call i32 @close(i32 %1)
%21 = icmp slt i32 %19, 1
br i1 %21, label LBL_6, label LBL_5
LBL_5:
%22 = mul i32 %19, 2
%23 = zext i32 %22 to i64
%24 = call i64 @FUNC(i64 %23)
br label LBL_6
LBL_6:
%25 = call i64 @FUNC(i64 40)
%26 = icmp eq i64 %0, %25
store i64 0, i64* %rax.0.reg2mem
br i1 %26, 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 %9, { 1, 0 }
uselistorder i32 %1, { 3, 0, 1, 2, 4 }
uselistorder i64* %sv_1, { 0, 2, 1 }
uselistorder i32 (i32)* @close, { 1, 0, 2 }
uselistorder label LBL_6, { 2, 3, 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE253_Incorrect_Check_of_Function_Return_Value__char_putchar_07-bad
|
CWE253_Incorrect_Check_of_Function_Return_Value__char_putchar_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = zext i32 %0 to i64
%2 = icmp eq i32 %0, 5
%3 = icmp eq i1 %2, false
store i64 %1, i64* %rax.0.reg2mem
br i1 %3, label LBL_3, label LBL_1
LBL_1:
%4 = call i32 @putchar(i32 65)
%5 = sext i32 %4 to i64
%6 = icmp eq i32 %4, 0
%7 = icmp eq i1 %6, false
store i64 %5, i64* %rax.0.reg2mem
br i1 %7, label LBL_3, label LBL_2
LBL_2:
%8 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64))
store i64 %8, i64* %rax.0.reg2mem
br label LBL_3
LBL_3:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
1
|
juliet-test-suite-c
|
CWE400_Resource_Exhaustion__fgets_for_loop_07-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge2.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%.reg2mem = alloca i32
%sv_0.0.ph.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, 5
%3 = icmp eq i1 %2, false
store i32 %1, i32* %.reg2mem
store i32 -1, i32* %sv_0.0.reg2mem
br i1 %3, label LBL_5, label LBL_1
LBL_1:
store i64 0, i64* %sv_1, align 8
%4 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%5 = bitcast i64* %sv_1 to i8*
%6 = call i8* @fgets(i8* nonnull %5, i32 14, %_IO_FILE* %4)
%7 = icmp eq i8* %6, null
br i1 %7, label LBL_3, label LBL_2
LBL_2:
%8 = call i32 @atoi(i8* nonnull %5)
store i32 %8, i32* %sv_0.0.ph.reg2mem
br label LBL_4
LBL_3:
%9 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_2 to i64))
store i32 -1, i32* %sv_0.0.ph.reg2mem
br label LBL_4
LBL_4:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%.pr = load i32, i32* @gv_0, align 4
store i32 %.pr, i32* %.reg2mem
store i32 %sv_0.0.ph.reload, i32* %sv_0.0.reg2mem
br label LBL_5
LBL_5:
%.reload = load i32, i32* %.reg2mem
%10 = icmp eq i32 %.reload, 5
br i1 %10, label LBL_7, label LBL_6
LBL_6:
%11 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_3 to i64))
br label LBL_10
LBL_7:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%sv_0.0.off = add i32 %sv_0.0.reload, -1
%12 = icmp ugt i32 %sv_0.0.off, 19
br i1 %12, label LBL_10, label LBL_8
LBL_8:
%13 = sext i32 %sv_0.0.reload to i64
store i64 0, i64* %storemerge2.reg2mem
br label LBL_9
LBL_9:
%storemerge2.reload = load i64, i64* %storemerge2.reg2mem
%14 = call i64 @FUNC(i64 ptrtoint ([6 x i8]* @gv_4 to i64))
%15 = add nuw i64 %storemerge2.reload, 1
%16 = icmp ult i64 %15, %13
store i64 %15, i64* %storemerge2.reg2mem
br i1 %16, label LBL_9, label LBL_10
LBL_10:
%17 = call i64 @FUNC(i64 40)
%18 = icmp eq i64 %0, %17
store i64 0, i64* %rax.0.reg2mem
br i1 %18, label LBL_12, label LBL_11
LBL_11:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_12
LBL_12:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %.reg2mem, { 0, 2, 1 }
uselistorder i32* %sv_0.0.reg2mem, { 0, 2, 1 }
uselistorder i64* %storemerge2.reg2mem, { 1, 0, 2 }
uselistorder label LBL_9, { 1, 0 }
uselistorder label LBL_4, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE127_Buffer_Underread__char_declare_ncpy_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 = bitcast i64* %sv_0 to i8*
%4 = call i32 @strlen(i8* nonnull %3)
%5 = bitcast i64* %sv_1 to i8*
%6 = call i8* @strncpy(i8* nonnull %3, i8* nonnull %5, i32 %4)
%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
uselistorder i8* (i8*, i8*, i32)* @strncpy, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 3, 2, 0, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_connect_socket_add_12-bad
|
CWE190_Integer_Overflow__int_connect_socket_add_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
br i1 %25, label LBL_8, label LBL_7
LBL_7:
%26 = add i32 %sv_0.1.reload, 1
%27 = zext i32 %26 to i64
%28 = call i64 @FUNC(i64 %27)
br label LBL_11
LBL_8:
%29 = icmp eq i32 %sv_0.1.reload, 2147483647
br i1 %29, label LBL_10, label LBL_9
LBL_9:
%30 = add i32 %sv_0.1.reload, 1
%31 = zext i32 %30 to i64
%32 = call i64 @FUNC(i64 %31)
br label LBL_11
LBL_10:
%33 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_1 to i64))
br label LBL_11
LBL_11:
%34 = call i64 @FUNC(i64 40)
%35 = icmp eq i64 %0, %34
store i64 0, i64* %rax.0.reg2mem
br i1 %35, label LBL_13, label LBL_12
LBL_12:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_13
LBL_13:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %sv_0.1.reload, { 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
|
CWE195_Signed_to_Unsigned_Conversion_Error__rand_strncpy_05-bad
|
CWE195_Signed_to_Unsigned_Conversion_Error__rand_strncpy_05_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.01.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_1, label LBL_2
LBL_1:
store i64 0, i64* %sv_2, align 8
%3 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
store i32 -1, i32* %sv_0.01.reg2mem
br label LBL_3
LBL_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
%14 = sext i1 %6 to i32
%storemerge.in = xor i32 %13, %14
store i64 0, i64* %sv_2, align 8
%15 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
%16 = icmp sgt i32 %storemerge.in, 99
store i32 %storemerge.in, i32* %sv_0.01.reg2mem
br i1 %16, label LBL_4, label LBL_3
LBL_3:
%17 = ptrtoint i64* %sv_3 to i64
%sv_0.01.reload = load i32, i32* %sv_0.01.reg2mem
%18 = bitcast i64* %sv_2 to i8*
%19 = bitcast i64* %sv_1 to i8*
%20 = call i8* @strncpy(i8* nonnull %18, i8* nonnull %19, i32 %sv_0.01.reload)
%21 = sext i32 %sv_0.01.reload to i64
%22 = add i64 %17, -128
%23 = add i64 %22, %21
%24 = inttoptr i64 %23 to i8*
store i8 0, i8* %24, align 1
br label LBL_4
LBL_4:
%25 = call i64 @FUNC(i64* nonnull %sv_2)
%26 = call i64 @FUNC(i64 40)
%27 = icmp eq i64 %0, %26
store i64 0, i64* %rax.0.reg2mem
br i1 %27, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %sv_0.01.reload, { 1, 0 }
uselistorder i64* %sv_2, { 1, 2, 3, 0 }
uselistorder i64* %sv_1, { 1, 2, 0 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder i32 99, { 2, 1, 0 }
uselistorder i32 65, { 1, 0 }
uselistorder label LBL_3, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int64_t_rand_square_14-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.off0.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.off0.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.off0.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.off0.reload = load i64, i64* %sv_0.0.off0.reg2mem
%sv_0.0.off0.off = add i64 %sv_0.0.off0.reload, 3037000499
%28 = icmp ugt i64 %sv_0.0.off0.off, 6074000998
br i1 %28, label LBL_6, label LBL_5
LBL_5:
%29 = mul i64 %sv_0.0.off0.reload, %sv_0.0.off0.reload
%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 ([54 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 %sv_0.0.off0.reload, { 1, 0, 2 }
uselistorder i64* %rax.0.reg2mem, { 0, 3, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__char_fscanf_add_32-good
|
goodB2G
|
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 eq i8 %3, 127
br i1 %4, label LBL_2, label LBL_1
LBL_1:
%5 = zext i8 %3 to i32
%6 = mul i32 %5, 16777216
%sext = add i32 %6, 16777216
%7 = ashr exact i32 %sext, 24
%8 = zext i32 %7 to i64
%9 = call i64 @FUNC(i64 %8)
br label LBL_3
LBL_2:
%10 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64))
br label LBL_3
LBL_3:
%11 = call i64 @FUNC(i64 40)
%12 = icmp eq i64 %0, %11
store i64 0, i64* %rax.0.reg2mem
br i1 %12, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %sv_0, { 1, 0, 2 }
uselistorder i64 (i64)* @printHexCharLine, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE197_Numeric_Truncation_Error__int_fscanf_to_short_13-bad
|
CWE197_Numeric_Truncation_Error__int_fscanf_to_short_13_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.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* inttoptr (i64 8340 to i32*), align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i64 4294967295, i64* %.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0)
%.pre = load i32, i32* %sv_0, align 4
%phitmp = mul i32 %.pre, 65536
%phitmp1 = ashr exact i32 %phitmp, 16
%phitmp2 = zext i32 %phitmp1 to i64
store i64 %phitmp2, i64* %.reg2mem
br label LBL_2
LBL_2:
%.reload = load i64, i64* %.reg2mem
%6 = call i64 @FUNC(i64 %.reload)
%7 = call i64 @FUNC(i64 40)
%8 = icmp eq i64 %0, %7
store i64 0, i64* %rax.0.reg2mem
br i1 %8, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %.reg2mem, { 0, 2, 1 }
}
|
1
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__sizeof_double_12-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
%3 = call i64* @malloc(i32 8)
%4 = icmp eq i64* %3, null
%5 = icmp eq i1 %4, false
br i1 %2, label LBL_4, label LBL_1
LBL_1:
br i1 %5, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%6 = call i128 @FUNC(i64 9098483789791991595)
%7 = call i64 @__asm_movsd.1(i128 %6)
store i64 %7, i64* %storemerge.reg2mem
br label LBL_7
LBL_4:
br i1 %5, label LBL_6, label LBL_5
LBL_5:
call void @exit(i32 -1)
unreachable
LBL_6:
%8 = call i128 @FUNC(i64 9098483789791991595)
%9 = call i64 @__asm_movsd.1(i128 %8)
store i64 %9, i64* %storemerge.reg2mem
br label LBL_7
LBL_7:
%storemerge.reload = load i64, i64* %storemerge.reg2mem
store i64 %storemerge.reload, i64* %3, align 8
%10 = call i128 @FUNC(i64 %storemerge.reload)
%11 = call i64 @FUNC()
call void @free(i64* %3)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64 %storemerge.reload, { 1, 0 }
uselistorder i1 %5, { 1, 0 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE400_Resource_Exhaustion__rand_fwrite_17-bad
|
CWE400_Resource_Exhaustion__rand_fwrite_17_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge27.reg2mem = alloca i64
%0 = call i32 @rand()
%1 = call i32 @rand()
%2 = call i32 @rand()
%3 = call i32 @rand()
%4 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0))
%5 = icmp eq %_IO_FILE* %4, null
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_1, label LBL_2
LBL_1:
%7 = urem i32 %0, 2
%8 = icmp eq i32 %7, 0
%9 = mul i32 %1, 1073741824
%10 = mul i32 %2, 32768
%11 = xor i32 %10, %9
%12 = xor i32 %11, %3
%13 = sext i1 %8 to i32
%storemerge4.in.le = xor i32 %12, %13
%phitmp.le = sext i32 %storemerge4.in.le to i64
%14 = icmp eq i32 %storemerge4.in.le, 0
store i64 0, i64* %storemerge27.reg2mem
br i1 %14, label LBL_6, label LBL_3
LBL_2:
call void @exit(i32 1)
unreachable
LBL_3:
%15 = call i32 @fwrite(i64* bitcast ([51 x i8]* @gv_2 to i64*), i32 1, i32 50, %_IO_FILE* %4)
%16 = icmp eq i32 %15, 50
br i1 %16, label LBL_5, label LBL_4
LBL_4:
call void @exit(i32 1)
unreachable
LBL_5:
%storemerge27.reload = load i64, i64* %storemerge27.reg2mem
%17 = add nuw i64 %storemerge27.reload, 1
%18 = icmp ult i64 %17, %phitmp.le
store i64 %17, i64* %storemerge27.reg2mem
br i1 %18, label LBL_3, label LBL_6
LBL_6:
%19 = call i32 @fclose(%_IO_FILE* nonnull %4)
%20 = sext i32 %19 to i64
ret i64 %20
uselistorder %_IO_FILE* %4, { 1, 0, 2 }
uselistorder i64* %storemerge27.reg2mem, { 2, 0, 1 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder label LBL_3, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE401_Memory_Leak__int64_t_malloc_08-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64*
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
store i64* null, i64** %sv_0.0.reg2mem
br i1 %2, label LBL_4, label LBL_1
LBL_1:
%3 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32))
%4 = icmp eq i64* %3, null
%5 = icmp eq i1 %4, false
br i1 %5, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
store i64 5, i64* %3, align 8
%6 = call i64 @FUNC(i64 5)
store i64* %3, i64** %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%7 = call i64 @FUNC()
%8 = trunc i64 %7 to i32
%9 = icmp eq i32 %8, 0
br i1 %9, label LBL_6, label LBL_5
LBL_5:
%10 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
store i64 %10, i64* %storemerge.reg2mem
br label LBL_7
LBL_6:
%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* %storemerge.reg2mem
br label LBL_7
LBL_7:
%storemerge.reload = load i64, i64* %storemerge.reg2mem
ret i64 %storemerge.reload
uselistorder i64* %storemerge.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE590_Free_Memory_Not_on_Heap__free_char_declare_12-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
%3 = call i64* @malloc(i32 100)
%4 = ptrtoint i64* %3 to i64
%5 = icmp eq i64* %3, null
%6 = icmp eq i1 %5, false
br i1 %2, label LBL_4, label LBL_1
LBL_1:
br i1 %6, label LBL_3, label LBL_2
LBL_2:
%7 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_0 to i64))
call void @exit(i32 1)
unreachable
LBL_3:
%8 = call i64* @memset(i64* %3, i32 65, i32 99)
%9 = add i64 %4, 99
%10 = inttoptr i64 %9 to i8*
store i8 0, i8* %10, align 1
br label LBL_7
LBL_4:
br i1 %6, label LBL_6, label LBL_5
LBL_5:
%11 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_0 to i64))
call void @exit(i32 1)
unreachable
LBL_6:
%12 = call i64* @memset(i64* %3, i32 65, i32 99)
%13 = add i64 %4, 99
%14 = inttoptr i64 %13 to i8*
store i8 0, i8* %14, align 1
br label LBL_7
LBL_7:
%15 = call i64 @FUNC(i64 %4)
call void @free(i64* %3)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i1 %6, { 1, 0 }
uselistorder i64 %4, { 0, 2, 1 }
uselistorder i64* %3, { 0, 2, 1, 3, 4 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_dest_char_cat_02-bad
|
CWE122_Heap_Based_Buffer_Overflow__c_dest_char_cat_02_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @malloc(i32 50)
%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 i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%6 = bitcast i64* %sv_0 to i8*
%7 = call i8* @strcat(i8* %4, i8* nonnull %6)
%8 = ptrtoint i64* %1 to i64
%9 = call i64 @FUNC(i64 %8)
call void @free(i64* %1)
%10 = call i64 @FUNC(i64 40)
%11 = icmp eq i64 %0, %10
store i64 0, i64* %rax.0.reg2mem
br i1 %11, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %4, { 1, 0 }
uselistorder i64* %1, { 0, 1, 3, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_connect_socket_execl_05-bad
|
CWE78_OS_Command_Injection__char_connect_socket_execl_05_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 2126700, i64* %sv_1, align 8
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_9, label LBL_1
LBL_1:
%3 = bitcast i64* %sv_1 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_0, i32 0, i32 16)
store i64 2, i64* %sv_0, 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_0 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_1 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:
%28 = call i32 (i8*, i8*, ...) @execl(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @gv_2, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @gv_2, i64 0, i64 0))
%29 = call i64 @FUNC(i64 40)
%30 = icmp eq i64 %0, %29
store i64 0, i64* %rax.0.reg2mem
br i1 %30, label LBL_11, label LBL_10
LBL_10:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_11
LBL_11:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %17, { 1, 0 }
uselistorder i32 %5, { 3, 1, 2, 0 }
uselistorder i64* %sv_0, { 0, 2, 1 }
uselistorder i8* (i8*, i32)* @strchr, { 1, 0, 2 }
uselistorder i32 -1, { 1, 0 }
uselistorder label LBL_9, { 1, 0, 2 }
uselistorder label LBL_8, { 2, 1, 0, 3 }
}
|
1
|
juliet-test-suite-c
|
CWE476_NULL_Pointer_Dereference__char_07-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.02.reg2mem = alloca i8*
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 5
store i8* getelementptr inbounds ([5 x i8], [5 x i8]* @gv_1, i64 0, i64 0), i8** %sv_0.02.reg2mem
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64))
%.pre = load i32, i32* @gv_0, align 4
%3 = zext i32 %.pre to i64
%4 = icmp eq i32 %.pre, 5
%5 = icmp eq i1 %4, false
store i64 %3, i64* %rax.0.reg2mem
br i1 %5, label LBL_3, label LBL_2
LBL_2:
%sv_0.02.reload = load i8*, i8** %sv_0.02.reg2mem
%6 = load i8, i8* %sv_0.02.reload, align 1
%7 = sext i8 %6 to i64
%8 = and i64 %7, 4294967295
%9 = call i64 @FUNC(i64 %8)
store i64 %9, i64* %rax.0.reg2mem
br label LBL_3
LBL_3:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE195_Signed_to_Unsigned_Conversion_Error__connect_socket_memcpy_08-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
store i32 99, 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 = ptrtoint i64* %sv_3 to i64
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
store i64 0, i64* %sv_2, align 8
%6 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
%7 = call i64* @memcpy(i64* nonnull %sv_2, i64* nonnull %sv_1, i32 %sv_0.0.reload)
%8 = sext i32 %sv_0.0.reload to i64
%9 = add i64 %5, -112
%10 = add i64 %9, %8
%11 = inttoptr i64 %10 to i8*
store i8 0, i8* %11, align 1
%12 = ptrtoint i64* %sv_2 to i64
%13 = call i64 @FUNC(i64 %12)
%14 = call i64 @FUNC(i64 40)
%15 = icmp eq i64 %0, %14
store i64 0, i64* %rax.0.reg2mem
br i1 %15, label LBL_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.0.reload, { 1, 0 }
uselistorder i64* %sv_2, { 1, 0, 2 }
uselistorder i32* %sv_0.0.reg2mem, { 0, 2, 1 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_struct_memmove_03-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = ptrtoint i64* %sv_1 to i64
%1 = call i64 @FUNC(i64 40)
%2 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32))
%3 = ptrtoint i64* %2 to i64
%4 = icmp eq i64* %2, null
%5 = icmp eq i1 %4, false
store i64 0, i64* %storemerge1.reg2mem
br i1 %5, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%6 = mul i64 %storemerge1.reload, 8
%7 = add i64 %6, %0
%8 = add i64 %7, -816
%9 = inttoptr i64 %8 to i32*
store i32 0, i32* %9, align 8
%10 = add i64 %7, -812
%11 = inttoptr i64 %10 to i32*
store i32 0, i32* %11, align 4
%12 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %12, 100
store i64 %12, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_3, label LBL_2
LBL_3:
%13 = call i64* @memmove(i64* %2, i64* nonnull %sv_0, i32 ptrtoint (i32* @gv_0 to i32))
%14 = call i64 @FUNC(i64 %3)
call void @free(i64* %2)
%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 void (i64*)* @free, { 1, 0, 2 }
uselistorder i64 (i64)* @printStructLine, { 1, 0 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE563_Unused_Variable__unused_init_variable_char_08-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
store i64 %0, i64* %rax.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 67)
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 i64 (i64)* @printHexCharLine, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE761_Free_Pointer_Not_at_Start_of_Buffer__char_connect_socket_09-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge4.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @malloc(i32 100)
%2 = icmp eq i64* %1, null
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%4 = bitcast i64* %1 to i8*
store i8 0, i8* %4, align 1
%5 = call i32 @strlen(i8* %4)
%6 = call i32 @socket(i32 2, i32 1, i32 6)
%cond = icmp eq i32 %6, -1
br i1 %cond, label LBL_10, label LBL_3
LBL_3:
%7 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16)
store i64 2, i64* %sv_0, align 8
%8 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%9 = call i16 @htons(i16 27015)
%10 = bitcast i64* %sv_0 to %sockaddr*
%11 = call i32 @connect(i32 %6, %sockaddr* nonnull %10, i32 16)
%12 = icmp eq i32 %11, -1
br i1 %12, label LBL_9, label LBL_4
LBL_4:
%13 = sext i32 %5 to i64
%14 = ptrtoint i64* %1 to i64
%15 = add i64 %13, %14
%16 = inttoptr i64 %15 to i64*
%17 = sub i32 99, %5
%18 = call i32 @recv(i32 %6, i64* %16, i32 %17, i32 0)
%19 = add i32 %18, 1
%20 = icmp ult i32 %19, 2
br i1 %20, label LBL_9, label LBL_5
LBL_5:
%21 = sext i32 %18 to i64
%22 = add i64 %15, %21
%23 = inttoptr i64 %22 to i8*
store i8 0, i8* %23, align 1
%24 = call i8* @strchr(i8* nonnull %4, i32 13)
%25 = icmp eq i8* %24, null
br i1 %25, label LBL_7, label LBL_6
LBL_6:
store i8 0, i8* %24, align 1
br label LBL_7
LBL_7:
%26 = call i8* @strchr(i8* nonnull %4, i32 10)
%27 = icmp eq i8* %26, null
br i1 %27, label LBL_9, label LBL_8
LBL_8:
store i8 0, i8* %26, align 1
br label LBL_9
LBL_9:
%28 = call i32 @close(i32 %6)
br label LBL_10
LBL_10:
%29 = call i32 @strlen(i8* nonnull %4)
%30 = icmp eq i32 %29, 0
br i1 %30, label LBL_15, label LBL_11
LBL_11:
%31 = ptrtoint i64* %1 to i64
store i64 0, i64* %storemerge4.reg2mem
br label LBL_12
LBL_12:
%storemerge4.reload = load i64, i64* %storemerge4.reg2mem
%32 = add i64 %storemerge4.reload, %31
%33 = inttoptr i64 %32 to i8*
%34 = load i8, i8* %33, align 1
%35 = icmp eq i8 %34, 83
%36 = icmp eq i1 %35, false
br i1 %36, label LBL_14, label LBL_13
LBL_13:
%37 = call i64 @FUNC(i64 ptrtoint ([17 x i8]* @gv_1 to i64))
br label LBL_15
LBL_14:
%38 = add nuw i64 %storemerge4.reload, 1
%39 = call i32 @strlen(i8* %4)
%40 = sext i32 %39 to i64
%41 = icmp ult i64 %38, %40
store i64 %38, i64* %storemerge4.reg2mem
br i1 %41, label LBL_12, label LBL_15
LBL_15:
call void @free(i64* %1)
%42 = call i64 @FUNC(i64 40)
%43 = icmp eq i64 %0, %42
store i64 0, i64* %rax.0.reg2mem
br i1 %43, label LBL_17, label LBL_16
LBL_16:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_17
LBL_17:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %18, { 1, 0 }
uselistorder i32 %6, { 3, 1, 2, 0 }
uselistorder i8* %4, { 3, 0, 1, 2, 5, 4 }
uselistorder i64* %1, { 1, 0, 2, 4, 3 }
uselistorder i64* %sv_0, { 0, 2, 1 }
uselistorder i64* %storemerge4.reg2mem, { 1, 0, 2 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i32 (i32)* @close, { 1, 0, 2 }
uselistorder i8* (i8*, i32)* @strchr, { 3, 2, 1, 0, 4 }
uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32)* @connect, { 1, 0, 2 }
uselistorder i16 (i16)* @htons, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 5, 0, 3, 2, 1, 4, 6 }
uselistorder i32 -1, { 2, 0, 3, 4, 1, 5 }
uselistorder label LBL_15, { 0, 2, 1 }
uselistorder label LBL_12, { 1, 0 }
uselistorder label LBL_10, { 1, 0 }
uselistorder label LBL_9, { 2, 1, 0, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE390_Error_Without_Action__sqrt_11-bad
|
CWE390_Error_Without_Action__sqrt_11_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
store i64 %0, i64* %rax.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i32* @__errno_location()
store i32 0, i32* %3, align 4
%4 = call i128 @FUNC(i64 -4616189618054758400)
%5 = trunc i128 %4 to i64
%6 = bitcast i64 %5 to double
%7 = call double @sqrt(double %6)
%8 = fptrunc double %7 to float
%9 = bitcast float %8 to i32
%10 = sext i32 %9 to i128
%11 = call i64 @__asm_movq.1(i128 %10)
%12 = call i32* @__errno_location()
%13 = call i128 @FUNC(i64 %11)
%14 = call i64 @FUNC()
store i64 %14, 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* ()* @__errno_location, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE680_Integer_Overflow_to_Buffer_Overflow__malloc_fixed_08-bad
|
CWE680_Integer_Overflow_to_Buffer_Overflow__malloc_fixed_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge1.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
%spec.select = select i1 %2, i32 -1, i32 1073741825
%3 = mul i32 %spec.select, 4
%4 = call i64* @malloc(i32 %3)
%5 = icmp eq i64* %4, null
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_1, label LBL_2
LBL_1:
%7 = ptrtoint i64* %4 to i64
%8 = sext i32 %spec.select to i64
store i64 0, i64* %storemerge1.reg2mem
br label LBL_3
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%9 = mul i64 %storemerge1.reload, 4
%10 = add i64 %9, %7
%11 = inttoptr i64 %10 to i32*
store i32 0, i32* %11, align 4
%12 = add nuw i64 %storemerge1.reload, 1
%13 = icmp ult i64 %12, %8
store i64 %12, i64* %storemerge1.reg2mem
br i1 %13, label LBL_3, label LBL_4
LBL_4:
%14 = bitcast i64* %4 to i32*
%15 = load i32, i32* %14, align 4
%16 = zext i32 %15 to i64
%17 = call i64 @FUNC(i64 %16)
call void @free(i64* %4)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64* %4, { 0, 1, 3, 2 }
uselistorder i32 %spec.select, { 1, 0 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder i32 -1, { 1, 0 }
uselistorder label LBL_3, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__unsigned_int_max_add_14-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = zext i32 %0 to i64
%2 = icmp eq i32 %0, 5
%3 = icmp eq i1 %2, false
store i64 %1, i64* %rax.0.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 3)
store i64 %4, i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 (i64)* @printUnsignedLine, { 2, 1, 0 }
uselistorder i64 3, { 1, 0 }
uselistorder i32 5, { 0, 1, 2, 3, 5, 4, 6 }
uselistorder i32* @gv_0, { 4, 0, 3, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_declare_loop_07-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge2.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, 5
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%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_2
LBL_2:
%sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem
%5 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%6 = ptrtoint i8* %sv_0.0.reload to i64
%7 = ptrtoint i64* %sv_1 to i64
store i64 0, i64* %storemerge2.reg2mem
br label LBL_3
LBL_3:
%storemerge2.reload = load i64, i64* %storemerge2.reg2mem
%8 = add i64 %storemerge2.reload, %6
%9 = add i64 %storemerge2.reload, %7
%10 = inttoptr i64 %9 to i8*
%11 = load i8, i8* %10, align 1
%12 = inttoptr i64 %8 to i8*
store i8 %11, i8* %12, align 1
%13 = add nuw nsw i64 %storemerge2.reload, 1
%exitcond = icmp eq i64 %13, 100
store i64 %13, i64* %storemerge2.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
%14 = add i64 %6, 99
%15 = inttoptr i64 %14 to i8*
store i8 0, i8* %15, align 1
%16 = call i64 @FUNC(i64 %6)
%17 = call i64 @FUNC(i64 40)
%18 = icmp eq i64 %0, %17
store i64 0, i64* %rax.0.reg2mem
br i1 %18, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %storemerge2.reload, { 0, 2, 1 }
uselistorder i64 %6, { 1, 2, 0 }
uselistorder i64* %sv_1, { 1, 0 }
uselistorder i64* %storemerge2.reg2mem, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder i32* @gv_0, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE253_Incorrect_Check_of_Function_Return_Value__char_putchar_12-bad
|
CWE253_Incorrect_Check_of_Function_Return_Value__char_putchar_12_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
%3 = call i32 @putchar(i32 65)
%4 = sext i32 %3 to i64
br i1 %2, label LBL_3, label LBL_1
LBL_1:
%5 = icmp eq i32 %3, 0
%6 = icmp eq i1 %5, false
store i64 %4, i64* %rax.0.reg2mem
br i1 %6, label LBL_5, label LBL_2
LBL_2:
%7 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_0 to i64))
store i64 %7, i64* %rax.0.reg2mem
br label LBL_5
LBL_3:
%8 = icmp eq i32 %3, -1
%9 = icmp eq i1 %8, false
store i64 %4, i64* %rax.0.reg2mem
br i1 %9, label LBL_5, label LBL_4
LBL_4:
%10 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_0 to i64))
store i64 %10, 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 %4, { 1, 0 }
uselistorder i32 %3, { 1, 0, 2 }
uselistorder i64* %rax.0.reg2mem, { 0, 3, 4, 1, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__char_fscanf_sub_10-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* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_2, 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), i8* nonnull %sv_0)
br label LBL_2
LBL_2:
%5 = load i32, i32* @gv_3, align 4
%6 = icmp eq i32 %5, 0
br i1 %6, label LBL_4, label LBL_3
LBL_3:
%7 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_4 to i64))
br label LBL_7
LBL_4:
%8 = load i8, i8* %sv_0, align 1
%9 = icmp eq i8 %8, -128
br i1 %9, label LBL_6, label LBL_5
LBL_5:
%10 = add i8 %8, -1
%11 = sext i8 %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 ([48 x i8]* @gv_5 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 i8* %sv_0, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE400_Resource_Exhaustion__rand_for_loop_17-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.1.reg2mem = alloca i64
%storemerge15.reg2mem = alloca i64
%0 = call i32 @rand()
%1 = call i32 @rand()
%2 = call i32 @rand()
%3 = call i32 @rand()
%4 = urem i32 %0, 2
%5 = icmp eq i32 %4, 0
%6 = mul i32 %1, 1073741824
%7 = mul i32 %2, 32768
%8 = xor i32 %7, %6
%9 = xor i32 %8, %3
%10 = sext i1 %5 to i32
%storemerge3.in.le = xor i32 %9, %10
%storemerge3.le = zext i32 %storemerge3.in.le to i64
%sv_0.0.off = add i32 %storemerge3.in.le, -1
%11 = icmp ugt i32 %sv_0.0.off, 19
%12 = sext i32 %storemerge3.in.le to i64
store i64 0, i64* %storemerge15.reg2mem
store i64 %storemerge3.le, i64* %rax.1.reg2mem
br i1 %11, label LBL_2, label LBL_1
LBL_1:
%storemerge15.reload = load i64, i64* %storemerge15.reg2mem
%13 = call i64 @FUNC(i64 ptrtoint ([6 x i8]* @gv_0 to i64))
%14 = add nuw i64 %storemerge15.reload, 1
%15 = icmp ult i64 %14, %12
store i64 %14, i64* %storemerge15.reg2mem
store i64 %12, i64* %rax.1.reg2mem
br i1 %15, label LBL_1, label LBL_2
LBL_2:
%rax.1.reload = load i64, i64* %rax.1.reg2mem
ret i64 %rax.1.reload
uselistorder i32 %storemerge3.in.le, { 1, 0, 2 }
uselistorder i64* %storemerge15.reg2mem, { 2, 0, 1 }
uselistorder label LBL_1, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_declare_memmove_08-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
%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 = 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_2
LBL_2:
%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_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* (i64*, i64*, i32)* @memmove, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE401_Memory_Leak__strdup_char_01-bad
|
CWE401_Memory_Leak__strdup_char_01_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 7453010373643565421, i64* %sv_0, align 8
%1 = bitcast i64* %sv_0 to i8*
%2 = call i8* @strdup(i8* nonnull %1)
%3 = ptrtoint i8* %2 to i64
%4 = call i64 @FUNC(i64 %3)
%5 = call i64 @FUNC(i64 40)
%6 = icmp eq i64 %0, %5
store i64 0, i64* %rax.0.reg2mem
br i1 %6, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
1
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_struct_memcpy_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 = ptrtoint i64* %sv_1 to i64
%1 = call i64 @FUNC(i64 40)
%2 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32))
%3 = ptrtoint i64* %2 to i64
%4 = icmp eq i64* %2, null
%5 = icmp eq i1 %4, false
store i64 0, i64* %storemerge1.reg2mem
br i1 %5, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%6 = mul i64 %storemerge1.reload, 8
%7 = add i64 %6, %0
%8 = add i64 %7, -816
%9 = inttoptr i64 %8 to i32*
store i32 0, i32* %9, align 8
%10 = add i64 %7, -812
%11 = inttoptr i64 %10 to i32*
store i32 0, i32* %11, align 4
%12 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %12, 100
store i64 %12, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_3, label LBL_2
LBL_3:
%13 = call i64* @memcpy(i64* %2, i64* nonnull %sv_0, i32 ptrtoint (i32* @gv_0 to i32))
%14 = call i64 @FUNC(i64 %3)
call void @free(i64* %2)
%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 void (i64*)* @free, { 1, 0, 2 }
uselistorder i64 (i64)* @printStructLine, { 1, 0 }
uselistorder i64* (i64*, i64*, i32)* @memcpy, { 1, 0, 2 }
uselistorder i32 ptrtoint (i32* @gv_0 to i32), { 0, 1, 3, 2 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_dest_char_cat_10-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, 0
store i8* null, i8** %sv_0.0.reg2mem
br i1 %2, label LBL_4, label LBL_1
LBL_1:
%3 = call i64* @malloc(i32 100)
%4 = icmp eq i64* %3, null
%5 = icmp eq i1 %4, false
br i1 %5, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%6 = bitcast i64* %3 to i8*
store i8 0, i8* %6, align 1
store i8* %6, i8** %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem
%7 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%8 = bitcast i64* %sv_1 to i8*
%9 = call i8* @strcat(i8* %sv_0.0.reload, i8* nonnull %8)
%10 = ptrtoint i8* %sv_0.0.reload to i64
%11 = call i64 @FUNC(i64 %10)
%12 = bitcast i8* %sv_0.0.reload to i64*
call void @free(i64* %12)
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %3, { 1, 0 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__src_char_alloca_cpy_08-bad
|
CWE121_Stack_Based_Buffer_Overflow__src_char_alloca_cpy_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = 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 = call i64 @FUNC()
%5 = trunc i64 %4 to i32
%6 = icmp eq i32 %5, 0
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 = bitcast i64* %sv_0 to i8*
%13 = call i8* @strcpy(i8* nonnull %12, i8* %11)
%14 = call i64 @FUNC(i64 %3)
%15 = call i64 @FUNC(i64 40)
%16 = icmp eq i64 %1, %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 i64 %3, { 0, 3, 1, 2, 4 }
}
|
1
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__short_fscanf_multiply_32-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i16, align 2
%0 = call i64 @FUNC(i64 40)
store i16 0, i16* %sv_0, align 2
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i16* nonnull %sv_0)
%3 = load i16, i16* %sv_0, align 2
%4 = icmp slt i16 %3, 0
%5 = icmp eq i1 %4, false
br i1 %5, label LBL_4, label LBL_1
LBL_1:
%6 = icmp slt i16 %3, -16383
br i1 %6, label LBL_3, label LBL_2
LBL_2:
%7 = zext i16 %3 to i32
%sext = mul i32 %7, 131072
%8 = ashr exact i32 %sext, 16
%9 = zext i32 %8 to i64
%10 = call i64 @FUNC(i64 %9)
br label LBL_4
LBL_3:
%11 = call i64 @FUNC(i64 ptrtoint ([51 x i8]* @gv_2 to i64))
br label LBL_4
LBL_4:
%12 = call i64 @FUNC(i64 40)
%13 = icmp eq i64 %0, %12
store i64 0, i64* %rax.0.reg2mem
br i1 %13, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i16* %sv_0, { 1, 0, 2 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE617_Reachable_Assertion__rand_07-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.1.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 5
store i64 5, i64* %rax.1.reg2mem
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
call void @__assert_fail(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @gv_2, i64 0, i64 0), i8* getelementptr inbounds ([126 x i8], [126 x i8]* @gv_3, i64 0, i64 0), i32 66, i8* getelementptr inbounds ([9 x i8], [9 x i8]* @gv_4, i64 0, i64 0))
store i64 ptrtoint (i32* @1 to i64), i64* %rax.1.reg2mem
br label LBL_2
LBL_2:
%rax.1.reload = load i64, i64* %rax.1.reg2mem
ret i64 %rax.1.reload
uselistorder i64* %rax.1.reg2mem, { 0, 2, 1 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_connect_socket_execlp_01-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 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
}
|
0
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_console_execlp_11-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 = 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 = 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_2
LBL_2:
%10 = 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))
%11 = call i64 @FUNC(i64 40)
%12 = icmp eq i64 %0, %11
store i64 0, i64* %rax.0.reg2mem
br i1 %12, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 (i8*, i8*, ...)* @execlp, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__unsigned_int_max_multiply_08-bad
|
CWE190_Integer_Overflow__unsigned_int_max_multiply_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
%3 = call i64 @FUNC()
%4 = trunc i64 %3 to i32
%5 = icmp eq i32 %4, 0
%or.cond = or i1 %2, %5
store i64 %3, i64* %rax.0.reg2mem
br i1 %or.cond, label LBL_2, label LBL_1
LBL_1:
%6 = call i64 @FUNC(i64 4294967294)
store i64 %6, i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 ()* @staticReturnsTrue, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE590_Free_Memory_Not_on_Heap__free_int64_t_declare_08-bad
|
CWE590_Free_Memory_Not_on_Heap__free_int64_t_declare_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = ptrtoint i64* %sv_1 to i64
%1 = call i64 @FUNC(i64 40)
%2 = call i64 @FUNC()
%3 = add i64 %0, -816
store i64 0, i64* %storemerge1.reg2mem
br label LBL_1
LBL_1:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%4 = mul i64 %storemerge1.reload, 8
%5 = add i64 %3, %4
%6 = inttoptr i64 %5 to i64*
store i64 5, i64* %6, align 8
%7 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %7, 100
store i64 %7, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_2, label LBL_1
LBL_2:
%8 = load i64, i64* %sv_0, align 8
%9 = call i64 @FUNC(i64 %8)
call void @free(i64* nonnull %sv_0)
%10 = call i64 @FUNC(i64 40)
%11 = icmp eq i64 %1, %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* %storemerge1.reg2mem, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE401_Memory_Leak__struct_twoIntsStruct_malloc_14-bad
|
CWE401_Memory_Leak__struct_twoIntsStruct_malloc_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%1 = zext i32 %0 to i64
%2 = icmp eq i32 %0, 5
%3 = icmp eq i1 %2, false
store i64 %1, i64* %rax.0.reg2mem
br i1 %3, label LBL_4, label LBL_1
LBL_1:
%4 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32))
%5 = icmp eq i64* %4, null
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%7 = bitcast i64* %4 to i32*
store i32 0, i32* %7, align 4
%8 = ptrtoint i64* %4 to i64
%9 = add i64 %8, 4
%10 = inttoptr i64 %9 to i32*
store i32 0, i32* %10, align 4
%11 = call i64 @FUNC(i64 %8)
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 }
}
|
1
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.