dataset
stringclasses 3
values | file
stringlengths 7
83
| fun_name
stringlengths 2
83
| llvm_ir_function
stringlengths 61
121k
| label
stringclasses 2
values |
|---|---|---|---|---|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__int_zero_divide_32-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_0 to i64))
%2 = call i64 @FUNC(i64 40)
%3 = icmp eq i64 %0, %2
store i64 0, i64* %rax.0.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
0
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_listen_socket_execl_13-bad
|
CWE78_OS_Command_Injection__char_listen_socket_execl_13_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 2126700, i64* %sv_1, align 8
%1 = load i32, i32* inttoptr (i64 8348 to i32*), align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_12, label LBL_1
LBL_1:
%4 = bitcast i64* %sv_1 to i8*
%5 = call i32 @strlen(i8* nonnull %4)
%6 = call i32 @socket(i32 2, i32 1, i32 6)
%7 = icmp eq i32 %6, -1
br i1 %7, label LBL_12, label LBL_2
LBL_2:
%8 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16)
store i64 2, i64* %sv_0, align 8
%9 = call i16 @htons(i16 27015)
%10 = bitcast i64* %sv_0 to %sockaddr*
%11 = call i32 @bind(i32 %6, %sockaddr* nonnull %10, i32 16)
%12 = icmp eq i32 %11, -1
br i1 %12, label LBL_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_1 to i64
%19 = add i64 %17, %18
%20 = inttoptr i64 %19 to i64*
%21 = sub i32 99, %5
%22 = call i32 @recv(i32 %15, i64* %20, i32 %21, i32 0)
%23 = add i32 %22, 1
%24 = icmp ult i32 %23, 2
br i1 %24, label LBL_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 %4, 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 %4, 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 i32 (i8*, i8*, ...) @execl(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @gv_0, i64 0, i64 0))
%36 = call i64 @FUNC(i64 40)
%37 = icmp eq i64 %0, %36
store i64 0, i64* %rax.0.reg2mem
br i1 %37, 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 %22, { 1, 0 }
uselistorder i32 %6, { 4, 0, 1, 2, 3, 5 }
uselistorder i64* %sv_0, { 0, 2, 1 }
uselistorder i32 (i32)* @close, { 2, 1, 0, 3 }
uselistorder i8* (i8*, i32)* @strchr, { 1, 0, 2 }
uselistorder i32 5, { 1, 0 }
uselistorder label LBL_12, { 2, 1, 0, 3 }
}
|
1
|
juliet-test-suite-c
|
CWE590_Free_Memory_Not_on_Heap__free_int64_t_static_32-bad
|
CWE590_Free_Memory_Not_on_Heap__free_int64_t_static_32_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %storemerge1.reg2mem
br label LBL_1
LBL_1:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%1 = mul i64 %storemerge1.reload, 8
%2 = add i64 %1, ptrtoint (i64* @gv_0 to i64)
%3 = inttoptr i64 %2 to i64*
store i64 5, i64* %3, align 8
%4 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %4, 100
store i64 %4, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_2, label LBL_1
LBL_2:
%5 = load i64, i64* @gv_0, align 8
%6 = call i64 @FUNC(i64 %5)
call void @free(i64* nonnull @gv_0)
%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* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder i64* @gv_0, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE401_Memory_Leak__twoIntsStruct_malloc_06-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64* @malloc(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 = ptrtoint i64* %0 to i64
%4 = bitcast i64* %0 to i32*
store i32 0, i32* %4, align 4
%5 = add i64 %3, 4
%6 = inttoptr i64 %5 to i32*
store i32 0, i32* %6, align 4
%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 i64* (i32)* @malloc, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE400_Resource_Exhaustion__fscanf_sleep_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 -1, i32* %sv_0, align 4
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_5, label LBL_1
LBL_1:
%3 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%4 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %3, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i32* nonnull %sv_0)
%.pr = load i32, i32* @gv_0, align 4
%5 = icmp eq i32 %.pr, 0
br i1 %5, label LBL_5, label LBL_2
LBL_2:
%6 = load i32, i32* %sv_0, align 4
%7 = icmp slt i32 %6, 1
%8 = icmp sgt i32 %6, ptrtoint (i1* @gv_3 to i32)
%or.cond = or i1 %7, %8
br i1 %or.cond, label LBL_4, label LBL_3
LBL_3:
%9 = call i32 @usleep(i32 %6)
%10 = call i64 @FUNC(i64 ptrtoint ([14 x i8]* @gv_4 to i64))
br label LBL_5
LBL_4:
%11 = call i64 @FUNC(i64 ptrtoint ([20 x i8]* @gv_5 to i64))
br label LBL_5
LBL_5:
%12 = call i64 @FUNC(i64 40)
%13 = icmp eq i64 %0, %12
store i64 0, i64* %rax.0.reg2mem
br i1 %13, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %sv_0, { 1, 0, 2 }
uselistorder 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
|
CWE191_Integer_Underflow__int64_t_fscanf_multiply_17-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64 @FUNC(i64 -4)
ret i64 %0
uselistorder i64 (i64)* @printLongLongLine, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE401_Memory_Leak__malloc_realloc_int_12-bad
|
CWE401_Memory_Leak__malloc_realloc_int_12_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.in.reg2mem = alloca i64*
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
%3 = call i64* @malloc(i32 400)
%4 = icmp eq i64* %3, null
%5 = icmp eq i1 %4, false
br i1 %2, label LBL_5, 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 = bitcast i64* %3 to i32*
store i32 5, i32* %6, align 4
%7 = call i64 @FUNC(i64 5)
%8 = call i64* @realloc(i64* %3, i32 520000)
%9 = ptrtoint i64* %8 to i64
%10 = icmp eq i64* %8, null
store i64 %9, i64* %rax.0.reg2mem
br i1 %10, label LBL_10, label LBL_4
LBL_4:
%11 = bitcast i64* %8 to i32*
store i32 10, i32* %11, align 4
%12 = call i64 @FUNC(i64 10)
call void @free(i64* nonnull %8)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_10
LBL_5:
br i1 %5, label LBL_7, label LBL_6
LBL_6:
call void @exit(i32 -1)
unreachable
LBL_7:
%13 = bitcast i64* %3 to i32*
store i32 5, i32* %13, align 4
%14 = call i64 @FUNC(i64 5)
%15 = call i64* @realloc(i64* %3, i32 520000)
%16 = icmp eq i64* %15, null
store i64* %3, i64** %sv_0.0.in.reg2mem
br i1 %16, label LBL_9, label LBL_8
LBL_8:
%17 = bitcast i64* %15 to i32*
store i32 10, i32* %17, align 4
%18 = call i64 @FUNC(i64 10)
store i64* %15, i64** %sv_0.0.in.reg2mem
br label LBL_9
LBL_9:
%sv_0.0.in.reload = load i64*, i64** %sv_0.0.in.reg2mem
call void @free(i64* nonnull %sv_0.0.in.reload)
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 i1 %5, { 1, 0 }
uselistorder i64* %rax.0.reg2mem, { 0, 3, 1, 2 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i64 10, { 1, 0 }
uselistorder i64* (i64*, i32)* @realloc, { 1, 0, 2 }
uselistorder i64 (i64)* @printIntLine, { 3, 2, 1, 0 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* null, { 0, 2, 1 }
}
|
1
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__CWE129_fgets_14-bad
|
CWE126_Buffer_Overread__CWE129_fgets_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 -1, i32* %sv_0.0.reg2mem
br i1 %3, label LBL_4, label LBL_1
LBL_1:
store i64 0, i64* %sv_1, align 8
%4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%5 = bitcast i64* %sv_1 to i8*
%6 = call i8* @fgets(i8* nonnull %5, i32 14, %_IO_FILE* %4)
%7 = icmp eq i8* %6, null
br i1 %7, label LBL_3, label LBL_2
LBL_2:
%8 = call i32 @atoi(i8* nonnull %5)
store i32 %8, i32* %sv_0.0.reg2mem
br label LBL_4
LBL_3:
%9 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64))
store i32 -1, i32* %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%10 = load i32, i32* @gv_2, align 4
%11 = icmp eq i32 %10, 5
%12 = icmp eq i1 %11, false
br i1 %12, label LBL_8, label LBL_5
LBL_5:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%13 = icmp slt i32 %sv_0.0.reload, 0
br i1 %13, label LBL_7, label LBL_6
LBL_6:
%14 = ptrtoint i64* %sv_2 to i64
%15 = sext i32 %sv_0.0.reload to i64
%16 = mul i64 %15, 4
%17 = add i64 %14, -64
%18 = add i64 %17, %16
%19 = inttoptr i64 %18 to i32*
%20 = load i32, i32* %19, align 4
%21 = zext i32 %20 to i64
%22 = call i64 @FUNC(i64 %21)
br label LBL_8
LBL_7:
%23 = call i64 @FUNC(i64 ptrtoint ([31 x i8]* @gv_3 to i64))
br label LBL_8
LBL_8:
%24 = call i64 @FUNC(i64 40)
%25 = icmp eq i64 %0, %24
store i64 0, i64* %rax.0.reg2mem
br i1 %25, label LBL_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.0.reg2mem, { 0, 2, 1, 3 }
}
|
1
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__int64_t_malloc_14-bad
|
CWE690_NULL_Deref_From_Return__int64_t_malloc_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64* @malloc(i32 8)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = zext i32 %1 to i64
%3 = icmp eq i32 %1, 5
%4 = icmp eq i1 %3, false
store i64 %2, i64* %rax.0.reg2mem
br i1 %4, label LBL_2, label LBL_1
LBL_1:
store i64 5, i64* %0, align 8
%5 = call i64 @FUNC(i64 5)
call void @free(i64* %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
}
|
1
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__char_declare_ncpy_14-bad
|
CWE124_Buffer_Underwrite__char_declare_ncpy_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i8*, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @memset(i64* nonnull %sv_2, i32 65, i32 99)
%2 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%3 = icmp eq i32 %2, 5
%4 = icmp eq i1 %3, false
br i1 %4, label LBL_2, label LBL_1
LBL_1:
%5 = bitcast i8** %sv_1 to i8*
store i8* %5, i8** %sv_1, align 8
br label LBL_2
LBL_2:
%6 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%7 = load i8*, i8** %sv_1, align 8
%8 = bitcast i64* %sv_0 to i8*
%9 = call i8* @strncpy(i8* %7, i8* nonnull %8, i32 99)
%10 = load i8*, i8** %sv_1, align 8
%11 = ptrtoint i8* %10 to i64
%12 = add i64 %11, 99
%13 = inttoptr i64 %12 to i8*
store i8 0, i8* %13, align 1
%14 = load i8*, i8** %sv_1, align 8
%15 = ptrtoint i8* %14 to i64
%16 = call i64 @FUNC(i64 %15)
%17 = call i64 @FUNC(i64 40)
%18 = icmp eq i64 %0, %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 i8** %sv_1, { 4, 3, 2, 1, 0 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__short_fscanf_sub_08-bad
|
CWE191_Integer_Underflow__short_fscanf_sub_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i16, align 2
%0 = call i64 @FUNC(i64 40)
store i16 0, i16* %sv_0, align 2
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i16* nonnull %sv_0)
br label LBL_2
LBL_2:
%6 = call i64 @FUNC()
%7 = trunc i64 %6 to i32
%8 = icmp eq i32 %7, 0
br i1 %8, label LBL_4, label LBL_3
LBL_3:
%9 = load i16, i16* %sv_0, align 2
%10 = add i16 %9, -1
%11 = sext i16 %10 to i64
%12 = and i64 %11, 4294967295
%13 = call i64 @FUNC(i64 %12)
br label LBL_4
LBL_4:
%14 = call i64 @FUNC(i64 40)
%15 = icmp eq i64 %0, %14
store i64 0, i64* %rax.0.reg2mem
br i1 %15, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i16* %sv_0, { 1, 0, 2 }
uselistorder i64 ()* @staticReturnsTrue, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int64_t_fscanf_postinc_10-bad
|
CWE190_Integer_Overflow__int64_t_fscanf_postinc_10_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_3, label LBL_1
LBL_1:
%3 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%4 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %3, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_2, i64 0, i64 0), i64* nonnull %sv_0)
%.pr = load i32, i32* @gv_0, align 4
%5 = icmp eq i32 %.pr, 0
br i1 %5, label LBL_3, label LBL_2
LBL_2:
%6 = load i64, i64* %sv_0, align 8
%7 = add i64 %6, 1
store i64 %7, i64* %sv_0, align 8
%8 = call i64 @FUNC(i64 %7)
br label LBL_3
LBL_3:
%9 = call i64 @FUNC(i64 40)
%10 = icmp eq i64 %0, %9
store i64 0, i64* %rax.0.reg2mem
br i1 %10, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_0, { 1, 2, 0, 3 }
uselistorder label LBL_3, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE194_Unexpected_Sign_Extension__listen_socket_malloc_01-bad
|
CWE194_Unexpected_Sign_Extension__listen_socket_malloc_01_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.091214.reg2mem = alloca i32
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i32 @socket(i32 2, i32 1, i32 6)
%2 = icmp eq i32 %1, -1
store i32 0, i32* %sv_0.091214.reg2mem
br i1 %2, label LBL_9, 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_7, label LBL_2
LBL_2:
%8 = call i32 @listen(i32 %1, i32 5)
%9 = icmp eq i32 %8, -1
br i1 %9, label LBL_7, 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_7, label LBL_4
LBL_4:
%12 = call i32 @recv(i32 %10, i64* nonnull %sv_1, i32 7, 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_8, label LBL_5
LBL_5:
%15 = ptrtoint i64* %sv_3 to i64
%16 = sext i32 %12 to i64
%17 = add i64 %15, -16
%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)
%.off = add i32 %21, 32768
%22 = icmp ult i32 %.off, 65536
store i32 -1, i32* %sv_0.0.ph.reg2mem
br i1 %22, label LBL_6, label LBL_8
LBL_6:
%sext4 = mul i32 %21, 65536
%23 = ashr exact i32 %sext4, 16
store i32 %23, i32* %sv_0.0.ph.reg2mem
br label LBL_8
LBL_7:
%24 = call i32 @close(i32 %1)
store i32 0, i32* %sv_0.091214.reg2mem
br label LBL_9
LBL_8:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%25 = call i32 @close(i32 %1)
%26 = call i32 @close(i32 %10)
%27 = trunc i32 %sv_0.0.ph.reload to i16
%28 = icmp sgt i16 %27, 99
store i32 %sv_0.0.ph.reload, i32* %sv_0.091214.reg2mem
br i1 %28, label LBL_12, label LBL_9
LBL_9:
%sv_0.091214.reload = load i32, i32* %sv_0.091214.reg2mem
%29 = call i64* @malloc(i32 %sv_0.091214.reload)
%30 = icmp eq i64* %29, null
%31 = icmp eq i1 %30, false
br i1 %31, label LBL_11, label LBL_10
LBL_10:
call void @exit(i32 -1)
unreachable
LBL_11:
%32 = ptrtoint i64* %29 to i64
%33 = add nsw i32 %sv_0.091214.reload, -1
%34 = call i64* @memset(i64* %29, i32 65, i32 %33)
%35 = zext i32 %sv_0.091214.reload to i64
%sext3 = mul i64 %35, 281474976710656
%36 = ashr exact i64 %sext3, 48
%37 = add i64 %32, -1
%38 = add i64 %37, %36
%39 = inttoptr i64 %38 to i8*
store i8 0, i8* %39, align 1
%40 = call i64 @FUNC(i64 %32)
call void @free(i64* %29)
br label LBL_12
LBL_12:
%41 = call i64 @FUNC(i64 40)
%42 = icmp eq i64 %0, %41
store i64 0, i64* %rax.0.reg2mem
br i1 %42, label LBL_14, label LBL_13
LBL_13:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_14
LBL_14:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %32, { 1, 0 }
uselistorder i64* %29, { 0, 1, 3, 2 }
uselistorder i32 %12, { 1, 0 }
uselistorder i32 %1, { 4, 0, 1, 2, 3, 5 }
uselistorder i64* %sv_2, { 0, 2, 1 }
uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 3, 1 }
uselistorder i32* %sv_0.091214.reg2mem, { 0, 3, 2, 1 }
uselistorder i32 (i32)* @close, { 2, 1, 0, 3 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder i32 -1, { 1, 6, 0, 2, 3, 4, 5 }
uselistorder label LBL_9, { 2, 1, 0 }
uselistorder label LBL_8, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE685_Function_Call_With_Incorrect_Number_of_Arguments__basic_05-bad
|
CWE685_Function_Call_With_Incorrect_Number_of_Arguments__basic_05_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = bitcast i64* %sv_0 to i8*
%4 = call i32 (i8*, i8*, ...) @sprintf(i8* nonnull %3, i8* getelementptr inbounds ([6 x i8], [6 x i8]* @gv_1, i64 0, i64 0), i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_2, i64 0, i64 0), i8* getelementptr inbounds ([6 x i8], [6 x i8]* @gv_1, i64 0, i64 0))
%5 = call i64 @FUNC(i64* nonnull %sv_0)
br label LBL_2
LBL_2:
%6 = call i64 @FUNC(i64 40)
%7 = icmp eq i64 %0, %6
store i64 0, i64* %rax.0.reg2mem
br i1 %7, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
1
|
juliet-test-suite-c
|
CWE590_Free_Memory_Not_on_Heap__free_char_alloca_02-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64* @malloc(i32 100)
%1 = icmp eq i64* %0, null
%2 = icmp eq i1 %1, false
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_0 to i64))
call void @exit(i32 1)
unreachable
LBL_2:
%4 = ptrtoint i64* %0 to i64
%5 = call i64* @memset(i64* %0, i32 65, i32 99)
%6 = add i64 %4, 99
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 1
%8 = call i64 @FUNC(i64 %4)
call void @free(i64* %0)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64* %0, { 0, 1, 3, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__int_pointer_11-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32*
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_4, label LBL_1
LBL_1:
%3 = call i64* @malloc(i32 4)
%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 i32*
store i32 5, i32* %6, align 4
store i32* %6, i32** %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
store i64 %7, i64* %rax.0.reg2mem
br i1 %9, label LBL_6, label LBL_5
LBL_5:
%sv_0.0.reload = load i32*, i32** %sv_0.0.reg2mem
%10 = load i32, i32* %sv_0.0.reload, align 4
%11 = zext i32 %10 to i64
%12 = call i64 @FUNC(i64 %11)
store i64 %12, 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 i64 (i64)* @printIntLine, { 3, 2, 1, 0 }
uselistorder void (i32)* @exit, { 3, 2, 1, 0, 4 }
uselistorder i64* (i32)* @malloc, { 0, 3, 2, 1, 4 }
uselistorder i64 ()* @globalReturnsTrue, { 5, 4, 3, 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE253_Incorrect_Check_of_Function_Return_Value__char_rename_13-bad
|
CWE253_Incorrect_Check_of_Function_Return_Value__char_rename_13_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = load i32, i32* inttoptr (i64 8392 to i32*), align 8
%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 @rename(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([19 x i8], [19 x i8]* @gv_1, i64 0, i64 0))
%5 = sext i32 %4 to i64
%6 = icmp eq i32 %4, 0
%7 = icmp eq i1 %6, false
store i64 %5, i64* %rax.0.reg2mem
br i1 %7, label LBL_3, label LBL_2
LBL_2:
%8 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 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
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_ncat_08-good
|
goodG2B2
|
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 = call i64 @FUNC()
%5 = trunc i64 %4 to i32
%6 = icmp eq i32 %5, 0
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 49)
%8 = ptrtoint i64* %1 to i64
%9 = add i64 %8, 49
%10 = inttoptr i64 %9 to i8*
store i8 0, i8* %10, align 1
store i64 %8, i64* %.pre-phi.reg2mem
br label LBL_5
LBL_5:
%11 = bitcast i64* %1 to i8*
%.pre-phi.reload = load i64, i64* %.pre-phi.reg2mem
store i64 0, i64* %sv_0, align 8
%12 = call i32 @strlen(i8* %11)
%13 = bitcast i64* %sv_0 to i8*
%14 = call i8* @strncat(i8* nonnull %13, i8* %11, i32 %12)
%15 = call i64 @FUNC(i64 %.pre-phi.reload)
call void @free(i64* %1)
%16 = call i64 @FUNC(i64 40)
%17 = icmp eq i64 %0, %16
store i64 0, i64* %rax.0.reg2mem
br i1 %17, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %11, { 1, 0 }
uselistorder i64* %1, { 1, 5, 2, 3, 0, 4 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i8* (i8*, i8*, i32)* @strncat, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
uselistorder label LBL_5, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__malloc_char_memcpy_32-bad
|
CWE124_Buffer_Underwrite__malloc_char_memcpy_32_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 100)
%2 = icmp eq i64* %1, null
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%4 = ptrtoint i64* %1 to i64
%5 = call i64* @memset(i64* %1, i32 65, i32 99)
%6 = add i64 %4, 99
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 1
%8 = add i64 %4, -8
%9 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%10 = load i64, i64* %sv_0, align 8
%11 = inttoptr i64 %8 to i64*
store i64 %10, i64* %11, align 8
%12 = add i64 %4, 8
%13 = inttoptr i64 %12 to i64*
%14 = add i64 %4, 16
%15 = inttoptr i64 %14 to i64*
%16 = add i64 %4, 24
%17 = inttoptr i64 %16 to i64*
%18 = add i64 %4, 32
%19 = inttoptr i64 %18 to i64*
%20 = add i64 %4, 40
%21 = inttoptr i64 %20 to i64*
%22 = add i64 %4, 48
%23 = inttoptr i64 %22 to i64*
%24 = add i64 %4, 56
%25 = inttoptr i64 %24 to i64*
%26 = add i64 %4, 64
%27 = inttoptr i64 %26 to i64*
%28 = add i64 %4, 72
%29 = inttoptr i64 %28 to i64*
%30 = add i64 %4, 80
%31 = inttoptr i64 %30 to i64*
%32 = add i64 %4, 88
%33 = inttoptr i64 %32 to i32*
%34 = add i64 %4, 91
%35 = inttoptr i64 %34 to i8*
store i8 0, i8* %35, align 1
%36 = call i64 @FUNC(i64 %8)
%37 = call i64 @FUNC(i64 40)
%38 = icmp eq i64 %0, %37
store i64 0, i64* %rax.0.reg2mem
br i1 %38, 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 %8, { 1, 0 }
uselistorder i64* %1, { 0, 2, 1 }
uselistorder i64* %sv_0, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__short_max_add_13-bad
|
CWE190_Integer_Overflow__short_max_add_13_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = load i32, i32* inttoptr (i64 8336 to i32*), align 16
%1 = icmp eq i32 %0, 5
%2 = icmp eq i1 %1, false
%3 = select i1 %2, i64 1, i64 4294934528
%4 = call i64 @FUNC(i64 %3)
ret i64 %4
}
|
1
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__float_rand_07-bad
|
CWE369_Divide_by_Zero__float_rand_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i128
%rax.0.reg2mem = alloca i64
%sv_0.0.in.reg2mem = alloca i64
%.reg2mem = alloca i32
%storemerge.reg2mem = 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 = load i32, i32* @gv_0, align 4
%6 = icmp eq i32 %5, 5
%7 = icmp eq i1 %6, false
store i32 %5, i32* %.reg2mem
store i64 %4, i64* %sv_0.0.in.reg2mem
br i1 %7, label LBL_5, label LBL_1
LBL_1:
%8 = call i32 @rand()
%9 = urem i32 %8, 2
%10 = icmp eq i32 %9, 0
%11 = call i32 @rand()
%12 = mul i32 %11, 1073741824
%13 = call i32 @rand()
%14 = mul i32 %13, 32768
%15 = xor i32 %14, %12
%16 = call i32 @rand()
%17 = xor i32 %15, %16
br i1 %10, label LBL_3, label LBL_2
LBL_2:
%18 = call i128 @FUNC(i128 %3, i128 %3)
%19 = call i128 @FUNC(i32 %17)
store i128 %19, i128* %storemerge.reg2mem
br label LBL_4
LBL_3:
%20 = sub i32 0, %17
%21 = sub i32 %20, 1
%22 = call i128 @FUNC(i128 %3, i128 %3)
%23 = call i128 @FUNC(i32 %21)
store i128 %23, i128* %storemerge.reg2mem
br label LBL_4
LBL_4:
%storemerge.reload = load i128, i128* %storemerge.reg2mem
%24 = call i64 @FUNC(i128 %storemerge.reload)
%.pre = load i32, i32* @gv_0, align 4
store i32 %.pre, i32* %.reg2mem
store i64 %24, i64* %sv_0.0.in.reg2mem
br label LBL_5
LBL_5:
%.reload = load i32, i32* %.reg2mem
%25 = zext i32 %.reload to i64
%26 = icmp eq i32 %.reload, 5
%27 = icmp eq i1 %26, false
store i64 %25, i64* %rax.0.reg2mem
br i1 %27, label LBL_7, label LBL_6
LBL_6:
%sv_0.0.in.reload = load i64, i64* %sv_0.0.in.reg2mem
%sv_0.0 = trunc i64 %sv_0.0.in.reload to i32
%28 = call i128 @FUNC(i128 %1, i128 %1)
%29 = call i128 @FUNC(i32 %sv_0.0)
%30 = call i128 @FUNC(i64 4636737291354636288)
%31 = call i128 @FUNC(i128 %30, i128 %29)
%32 = call i32 @FUNC(i128 %31)
%33 = zext i32 %32 to i64
%34 = call i64 @FUNC(i64 %33)
store i64 %34, i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i128 %3, { 3, 2, 1, 0, 4 }
uselistorder i128* %storemerge.reg2mem, { 0, 2, 1 }
uselistorder i128* %0, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_fgets_multiply_04-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = bitcast i64* %sv_0 to i8*
%3 = call i8* @fgets(i8* nonnull %2, i32 14, %_IO_FILE* %1)
%4 = icmp eq i8* %3, null
br i1 %4, label LBL_1, label LBL_2
LBL_1:
%5 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64))
br label LBL_6
LBL_2:
%6 = call i32 @atoi(i8* nonnull %2)
%7 = icmp slt i32 %6, 1
br i1 %7, label LBL_6, label LBL_3
LBL_3:
%8 = icmp sgt i32 %6, 1073741822
br i1 %8, label LBL_5, label LBL_4
LBL_4:
%9 = mul i32 %6, 2
%10 = zext i32 %9 to i64
%11 = call i64 @FUNC(i64 %10)
br label LBL_6
LBL_5:
%12 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64))
br label LBL_6
LBL_6:
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, 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 %6, { 0, 2, 1 }
uselistorder label LBL_6, { 1, 2, 3, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE675_Duplicate_Operations_on_Resource__freopen_02-bad
|
CWE675_Duplicate_Operations_on_Resource__freopen_02_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%1 = call %_IO_FILE* @freopen(i8* getelementptr inbounds ([22 x i8], [22 x i8]* @gv_1, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), %_IO_FILE* %0)
%2 = call i32 @fclose(%_IO_FILE* %1)
%3 = call i32 @fclose(%_IO_FILE* %1)
%4 = sext i32 %3 to i64
ret i64 %4
uselistorder i32 (%_IO_FILE*)* @fclose, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE476_NULL_Pointer_Dereference__int64_t_11-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)
store i64 5, i64* %sv_1, align 8
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
br label LBL_3
LBL_2:
%5 = ptrtoint i64* %sv_1 to i64
store i64 %5, i64* %sv_0.0.reg2mem
br label LBL_3
LBL_3:
%6 = call i64 @FUNC()
%7 = trunc i64 %6 to i32
%8 = icmp eq i32 %7, 0
br i1 %8, label LBL_5, label LBL_4
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%9 = inttoptr i64 %sv_0.0.reload to i64*
%10 = load i64, i64* %9, align 8
%11 = call i64 @FUNC(i64 %10)
br label LBL_5
LBL_5:
%12 = call i64 @FUNC(i64 40)
%13 = icmp eq i64 %0, %12
store i64 0, i64* %rax.0.reg2mem
br i1 %13, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 ()* @globalReturnsFalse, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int_fscanf_predec_14-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_0)
br label LBL_2
LBL_2:
%6 = load i32, i32* @gv_2, align 4
%7 = icmp eq i32 %6, 5
br i1 %7, label LBL_4, label LBL_3
LBL_3:
%8 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_3 to i64))
br label LBL_7
LBL_4:
%9 = load i64, i64* %sv_0, align 8
%10 = trunc i64 %9 to i32
%11 = icmp eq i32 %10, -2147483648
br i1 %11, label LBL_6, label LBL_5
LBL_5:
%12 = mul i64 %9, 4294967296
%sext = add i64 %12, -4294967296
%13 = ashr exact i64 %sext, 32
store i64 %13, i64* %sv_0, align 8
%14 = and i64 %13, 4294967295
%15 = call i64 @FUNC(i64 %14)
br label LBL_7
LBL_6:
%16 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_4 to i64))
br label LBL_7
LBL_7:
%17 = call i64 @FUNC(i64 40)
%18 = icmp eq i64 %0, %17
store i64 0, i64* %rax.0.reg2mem
br i1 %18, label LBL_9, label LBL_8
LBL_8:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_9
LBL_9:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_0, { 1, 2, 0, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE253_Incorrect_Check_of_Function_Return_Value__char_fgets_13-bad
|
CWE253_Incorrect_Check_of_Function_Return_Value__char_fgets_13_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 8360 to i32*), align 8
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
store i64 0, i64* %sv_0, align 8
%4 = ptrtoint i64* %sv_0 to i64
%5 = call i64 @FUNC(i64 ptrtoint ([24 x i8]* @gv_0 to i64))
%6 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%7 = bitcast i64* %sv_0 to i8*
%8 = call i8* @fgets(i8* nonnull %7, i32 100, %_IO_FILE* %6)
%9 = call i64 @FUNC(i64 %4)
br label LBL_2
LBL_2:
%10 = call i64 @FUNC(i64 40)
%11 = icmp eq i64 %0, %10
store i64 0, i64* %rax.0.reg2mem
br i1 %11, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
1
|
juliet-test-suite-c
|
CWE617_Reachable_Assertion__listen_socket_32-bad
|
CWE617_Reachable_Assertion__listen_socket_32_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%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_8, 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 i16 @htons(i16 27015)
%5 = bitcast i64* %sv_1 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_0, i32 13, i32 0)
%13 = add i32 %12, 1
%14 = icmp ult i32 %13, 2
br i1 %14, label LBL_7, label LBL_5
LBL_5:
%15 = ptrtoint i64* %sv_2 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_0 to i8*
%21 = call i32 @atoi(i8* nonnull %20)
%phitmp = icmp sgt i32 %21, 5
%22 = call i32 @close(i32 %1)
%23 = call i32 @close(i32 %10)
br i1 %phitmp, label LBL_9, label LBL_8
LBL_6:
%24 = call i32 @close(i32 %1)
br label LBL_8
LBL_7:
%25 = call i32 @close(i32 %1)
%26 = call i32 @close(i32 %10)
br label LBL_8
LBL_8:
call void @__assert_fail(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([135 x i8], [135 x i8]* @gv_1, i64 0, i64 0), i32 130, i8* getelementptr inbounds ([49 x i8], [49 x i8]* @gv_2, i64 0, i64 0))
br label LBL_9
LBL_9:
%27 = call i64 @FUNC(i64 40)
%28 = icmp eq i64 %0, %27
store i64 0, i64* %rax.0.reg2mem
br i1 %28, label LBL_11, label LBL_10
LBL_10:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_11
LBL_11:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %12, { 1, 0 }
uselistorder i32 %1, { 0, 1, 5, 2, 3, 4, 6 }
uselistorder i64* %sv_1, { 0, 2, 1 }
uselistorder i32 (i32)* @close, { 0, 1, 2, 4, 3, 5 }
uselistorder label LBL_8, { 0, 2, 3, 1 }
}
|
1
|
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__unsigned_int_rand_sub_14-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* inttoptr (i64 16404 to i32*), align 4
%1 = icmp eq i32 %0, 5
%2 = icmp eq i1 %1, false
store i32 0, i32* %sv_0.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i32 @rand()
%4 = urem i32 %3, 2
%5 = icmp eq i32 %4, 0
%6 = call i32 @rand()
%7 = mul i32 %6, 1073741824
%8 = call i32 @rand()
%9 = mul i32 %8, 32768
%10 = xor i32 %9, %7
%11 = call i32 @rand()
%12 = xor i32 %10, %11
%13 = sext i1 %5 to i32
%storemerge.in = xor i32 %12, %13
store i32 %storemerge.in, i32* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%14 = load i32, i32* @gv_0, align 4
%15 = icmp eq i32 %14, 5
br i1 %15, label LBL_4, label LBL_3
LBL_3:
%16 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
store i64 %16, i64* %rax.0.reg2mem
br label LBL_7
LBL_4:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%17 = icmp eq i32 %sv_0.0.reload, 0
br i1 %17, label LBL_6, label LBL_5
LBL_5:
%18 = add i32 %sv_0.0.reload, -1
%19 = zext i32 %18 to i64
%20 = call i64 @FUNC(i64 %19)
store i64 %20, i64* %rax.0.reg2mem
br label LBL_7
LBL_6:
%21 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_2 to i64))
store i64 %21, i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %rax.0.reg2mem, { 0, 3, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int64_t_fscanf_multiply_04-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_0)
%3 = load i64, i64* %sv_0, align 8
%4 = icmp slt i64 %3, 1
br i1 %4, label LBL_4, label LBL_1
LBL_1:
%5 = icmp sgt i64 %3, 4611686018427387902
br i1 %5, label LBL_3, label LBL_2
LBL_2:
%6 = mul i64 %3, 2
%7 = call i64 @FUNC(i64 %6)
br label LBL_4
LBL_3:
%8 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64))
br label LBL_4
LBL_4:
%9 = call i64 @FUNC(i64 40)
%10 = icmp eq i64 %0, %9
store i64 0, i64* %rax.0.reg2mem
br i1 %10, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_0, { 1, 0, 2 }
uselistorder %_IO_FILE** @gv_0, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_alloca_loop_07-bad
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_alloca_loop_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge3.reg2mem = alloca i64
%.in.reg2mem = alloca i8*
%sv_0 = alloca i64, align 8
%sv_1 = alloca i8*, 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 i8** %sv_1 to i64
%5 = add i64 %4, -49
%6 = and i64 %5, -16
%7 = inttoptr i64 %6 to i8*
%8 = bitcast i8** %sv_1 to i64*
store i64 %6, i64* %8, align 8
store i8 0, i8* %7, align 16
br label LBL_2
LBL_2:
%9 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%10 = load i8*, i8** %sv_1, align 8
%11 = ptrtoint i64* %sv_0 to i64
store i8* %10, i8** %.in.reg2mem
store i64 0, i64* %storemerge3.reg2mem
br label LBL_3
LBL_3:
%storemerge3.reload = load i64, i64* %storemerge3.reg2mem
%.in.reload = load i8*, i8** %.in.reg2mem
%12 = ptrtoint i8* %.in.reload to i64
%13 = add i64 %storemerge3.reload, %12
%14 = add i64 %storemerge3.reload, %11
%15 = inttoptr i64 %14 to i8*
%16 = load i8, i8* %15, align 1
%17 = inttoptr i64 %13 to i8*
store i8 %16, i8* %17, align 1
%18 = add nuw nsw i64 %storemerge3.reload, 1
%19 = load i8*, i8** %sv_1, align 8
%exitcond = icmp eq i64 %18, 100
store i8* %19, i8** %.in.reg2mem
store i64 %18, i64* %storemerge3.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
%20 = ptrtoint i8* %19 to i64
%21 = add i64 %20, 99
%22 = inttoptr i64 %21 to i8*
store i8 0, i8* %22, align 1
%23 = load i8*, i8** %sv_1, align 8
%24 = ptrtoint i8* %23 to i64
%25 = call i64 @FUNC(i64 %24)
%26 = call i64 @FUNC(i64 40)
%27 = icmp eq i64 %0, %26
store i64 0, i64* %rax.0.reg2mem
br i1 %27, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %19, { 1, 0 }
uselistorder i64 %storemerge3.reload, { 0, 2, 1 }
uselistorder i8** %sv_1, { 4, 3, 0, 1, 2 }
uselistorder i64* %sv_0, { 1, 0 }
uselistorder i8** %.in.reg2mem, { 1, 0, 2 }
uselistorder i64* %storemerge3.reg2mem, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE401_Memory_Leak__strdup_char_13-bad
|
CWE401_Memory_Leak__strdup_char_13_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 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:
store i64 7453010373643565421, i64* %sv_0, align 8
%4 = bitcast i64* %sv_0 to i8*
%5 = call i8* @strdup(i8* nonnull %4)
%6 = ptrtoint i8* %5 to i64
%7 = call i64 @FUNC(i64 %6)
br label LBL_2
LBL_2:
%8 = call i64 @FUNC(i64 40)
%9 = icmp eq i64 %0, %8
store i64 0, i64* %rax.0.reg2mem
br i1 %9, label LBL_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
|
CWE134_Uncontrolled_Format_String__char_listen_socket_fprintf_14-bad
|
CWE134_Uncontrolled_Format_String__char_listen_socket_fprintf_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_1, align 8
%1 = bitcast i64* %sv_1 to i8*
%2 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%3 = icmp eq i32 %2, 5
%4 = icmp eq i1 %3, false
br i1 %4, label LBL_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_0, i32 0, i32 16)
store i64 2, i64* %sv_0, align 8
%9 = call i16 @htons(i16 27015)
%10 = bitcast i64* %sv_0 to %sockaddr*
%11 = call i32 @bind(i32 %6, %sockaddr* nonnull %10, i32 16)
%12 = icmp eq i32 %11, -1
br i1 %12, label LBL_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_1 to i64
%19 = add i64 %17, %18
%20 = inttoptr i64 %19 to i64*
%21 = sub i32 99, %5
%22 = call i32 @recv(i32 %15, i64* %20, i32 %21, i32 0)
%23 = add i32 %22, 1
%24 = icmp ult i32 %23, 2
br i1 %24, label LBL_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 = load i32, i32* @gv_0, align 4
%36 = icmp eq i32 %35, 5
%37 = icmp eq i1 %36, false
br i1 %37, label LBL_14, label LBL_13
LBL_13:
%38 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%39 = call i32 (%_IO_FILE*, i8*, ...) @fprintf(%_IO_FILE* %38, i8* nonnull %1)
br label LBL_14
LBL_14:
%40 = call i64 @FUNC(i64 40)
%41 = icmp eq i64 %0, %40
store i64 0, i64* %rax.0.reg2mem
br i1 %41, label LBL_16, label LBL_15
LBL_15:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_16
LBL_16:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %22, { 1, 0 }
uselistorder i32 %6, { 4, 0, 1, 2, 3, 5 }
uselistorder i8* %1, { 3, 0, 1, 2 }
uselistorder i64* %sv_0, { 0, 2, 1 }
uselistorder %_IO_FILE** @gv_1, { 1, 0 }
uselistorder i32 (i32)* @close, { 2, 1, 0, 3 }
uselistorder i8* (i8*, i32)* @strchr, { 1, 0, 2 }
uselistorder i8 0, { 1, 2, 3, 4, 0 }
uselistorder i32 5, { 0, 2, 1, 3 }
uselistorder label LBL_12, { 2, 1, 0, 3 }
}
|
1
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_file_snprintf_07-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.reg2mem = alloca i32
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_1, align 8
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 %1, i32* %.reg2mem
br i1 %3, label LBL_7, label LBL_1
LBL_1:
%4 = bitcast i64* %sv_1 to i8*
%5 = call i32 @strlen(i8* nonnull %4)
%6 = sext i32 %5 to i64
%7 = sub nsw i64 100, %6
%8 = icmp ult i64 %7, 2
br i1 %8, label LBL_6, label LBL_2
LBL_2:
%9 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @gv_1, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_2, i64 0, i64 0))
%10 = icmp eq %_IO_FILE* %9, null
br i1 %10, label LBL_6, label LBL_3
LBL_3:
%11 = sub i32 100, %5
%12 = ptrtoint i64* %sv_1 to i64
%13 = add i64 %6, %12
%14 = inttoptr i64 %13 to i8*
%15 = call i8* @fgets(i8* %14, i32 %11, %_IO_FILE* nonnull %9)
%16 = icmp eq i8* %15, null
%17 = icmp eq i1 %16, false
br i1 %17, label LBL_5, label LBL_4
LBL_4:
%18 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_3 to i64))
store i8 0, i8* %14, align 1
br label LBL_5
LBL_5:
%19 = call i32 @fclose(%_IO_FILE* nonnull %9)
br label LBL_6
LBL_6:
%.pr = load i32, i32* @gv_0, align 4
store i32 %.pr, i32* %.reg2mem
br label LBL_7
LBL_7:
%.reload = load i32, i32* %.reg2mem
%20 = icmp eq i32 %.reload, 5
br i1 %20, label LBL_9, label LBL_8
LBL_8:
%21 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_4 to i64))
br label LBL_10
LBL_9:
store i64 0, i64* %sv_0, align 8
%22 = bitcast i64* %sv_0 to i8*
%23 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %22, i32 99, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_5, i64 0, i64 0), i64* nonnull %sv_1)
%24 = ptrtoint i64* %sv_0 to i64
%25 = call i64 @FUNC(i64 %24)
br label LBL_10
LBL_10:
%26 = call i64 @FUNC(i64 40)
%27 = icmp eq i64 %0, %26
store i64 0, i64* %rax.0.reg2mem
br i1 %27, label LBL_12, label LBL_11
LBL_11:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_12
LBL_12:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_0, { 1, 0, 2 }
uselistorder i32* %.reg2mem, { 0, 2, 1 }
uselistorder label LBL_6, { 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_loop_17-bad
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_loop_17_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge3.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 = ptrtoint i64* %1 to i64
%6 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%7 = ptrtoint i64* %sv_0 to i64
store i64 0, i64* %storemerge3.reg2mem
br label LBL_3
LBL_3:
%storemerge3.reload = load i64, i64* %storemerge3.reg2mem
%8 = add i64 %storemerge3.reload, %5
%9 = add i64 %storemerge3.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 %storemerge3.reload, 1
%exitcond = icmp eq i64 %13, 100
store i64 %13, i64* %storemerge3.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
%14 = add i64 %5, 99
%15 = inttoptr i64 %14 to i8*
store i8 0, i8* %15, align 1
%16 = call i64 @FUNC(i64 %5)
call void @free(i64* %1)
%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 %storemerge3.reload, { 0, 2, 1 }
uselistorder i64 %5, { 1, 2, 0 }
uselistorder i64* %sv_0, { 1, 0 }
uselistorder i64* %storemerge3.reg2mem, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_declare_snprintf_14-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i8*
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
br label LBL_3
LBL_2:
%4 = bitcast i64* %sv_2 to i8*
store i8 0, i8* %4, align 8
store i8* %4, i8** %sv_0.0.reg2mem
br label LBL_3
LBL_3:
%sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem
%5 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%6 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* %sv_0.0.reload, i32 100, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_1)
%7 = ptrtoint i8* %sv_0.0.reload to i64
%8 = call i64 @FUNC(i64 %7)
%9 = call i64 @FUNC(i64 40)
%10 = icmp eq i64 %0, %9
store i64 0, i64* %rax.0.reg2mem
br i1 %10, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__CWE135_09-bad
|
CWE122_Heap_Based_Buffer_Overflow__CWE135_09_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%sv_0 = alloca i32*, align 8
%0 = call i64* @malloc(i32 200)
%1 = bitcast i64* %0 to i32*
store i32* %1, i32** %sv_0, align 8
%2 = icmp eq i64* %0, null
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%4 = call i32* @wmemset(i32* %1, i32 65, i32 49)
%5 = ptrtoint i64* %0 to i64
%6 = add i64 %5, 196
%7 = inttoptr i64 %6 to i32*
store i32 0, i32* %7, align 4
%8 = load i32*, i32** %sv_0, align 8
%9 = bitcast i32* %8 to i8*
%10 = call i32 @strlen(i8* %9)
%11 = add i32 %10, 1
%12 = call i64* @calloc(i32 %11, i32 4)
%13 = icmp eq i64* %12, null
%14 = icmp eq i1 %13, false
br i1 %14, label LBL_4, label LBL_3
LBL_3:
call void @exit(i32 -1)
unreachable
LBL_4:
%15 = bitcast i64* %12 to i32*
%16 = call i32* @wcscpy(i32* %15, i32* %8)
%17 = ptrtoint i64* %12 to i64
%18 = call i64 @FUNC(i64 %17)
call void @free(i64* %12)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64* %12, { 1, 0, 3, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__float_fscanf_05-bad
|
CWE369_Divide_by_Zero__float_fscanf_05_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i128
%rax.0.reg2mem = alloca i64
%1 = load i128, i128* %0
%2 = load i128, i128* %0
%sv_0 = alloca i32, align 4
%3 = call i64 @FUNC(i64 40)
%4 = call i128 @FUNC(i128 %2, i128 %2)
%5 = call i64 @FUNC(i128 %4)
%6 = trunc i64 %5 to i32
store i32 %6, i32* %sv_0, align 4
%7 = load i32, i32* @gv_0, align 4
%8 = icmp eq i32 %7, 0
br i1 %8, label LBL_3, label LBL_1
LBL_1:
%9 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%10 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %9, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i32* nonnull %sv_0)
%.pr = load i32, i32* @gv_0, align 4
%11 = icmp eq i32 %.pr, 0
br i1 %11, label LBL_3, label LBL_2
LBL_2:
%12 = load i32, i32* %sv_0, align 4
%13 = call i128 @__asm_movss.1(i32 %12)
%14 = call i128 @FUNC(i128 %1, i128 %1)
%15 = call i128 @FUNC(i128 %13)
%16 = call i128 @FUNC(i64 4636737291354636288)
%17 = call i128 @FUNC(i128 %16, i128 %15)
%18 = call i32 @FUNC(i128 %17)
%19 = zext i32 %18 to i64
%20 = call i64 @FUNC(i64 %19)
br label LBL_3
LBL_3:
%21 = call i64 @FUNC(i64 40)
%22 = icmp eq i64 %3, %21
store i64 0, i64* %rax.0.reg2mem
br i1 %22, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %sv_0, { 2, 0, 1 }
uselistorder i128* %0, { 1, 0 }
uselistorder %_IO_FILE** @gv_1, { 1, 0 }
uselistorder label LBL_3, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__src_char_alloca_cat_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 i8*, align 8
%0 = ptrtoint i8** %sv_1 to i64
%1 = call i64 @FUNC(i64 40)
%2 = add i64 %0, -97
%3 = and i64 %2, -16
%4 = inttoptr i64 %3 to i8*
store i8* %4, i8** %sv_1, align 8
%5 = inttoptr i64 %3 to i64*
%6 = call i64* @memset(i64* %5, i32 65, i32 49)
%7 = add i64 %3, 49
%8 = inttoptr i64 %7 to i8*
store i8 0, i8* %8, align 1
store i64 0, i64* %sv_0, align 8
%9 = bitcast i64* %sv_0 to i8*
%10 = call i8* @strcat(i8* nonnull %9, i8* %4)
%11 = call i64 @FUNC(i64 %3)
%12 = call i64 @FUNC(i64 40)
%13 = icmp eq i64 %1, %12
store i64 0, i64* %rax.0.reg2mem
br i1 %13, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %3, { 2, 1, 0, 3 }
uselistorder i8** %sv_1, { 1, 0 }
uselistorder i8* (i8*, i8*)* @strcat, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__int_fscanf_modulo_07-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.reg2mem = alloca i32
%sv_0 = alloca i32, align 4
%0 = call i64 @FUNC(i64 40)
store i32 -1, i32* %sv_0, align 4
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 %1, i32* %.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i32* nonnull %sv_0)
%.pr = load i32, i32* @gv_0, align 4
store i32 %.pr, i32* %.reg2mem
br label LBL_2
LBL_2:
%.reload = load i32, i32* %.reg2mem
%6 = icmp eq i32 %.reload, 5
br i1 %6, label LBL_4, label LBL_3
LBL_3:
%7 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_3 to i64))
br label LBL_7
LBL_4:
%8 = load i32, i32* %sv_0, align 4
%9 = icmp eq i32 %8, 0
br i1 %9, label LBL_6, label LBL_5
LBL_5:
%10 = urem i32 100, %8
%11 = zext i32 %10 to i64
%12 = call i64 @FUNC(i64 %11)
br label LBL_7
LBL_6:
%13 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_4 to i64))
br label LBL_7
LBL_7:
%14 = call i64 @FUNC(i64 40)
%15 = icmp eq i64 %0, %14
store i64 0, i64* %rax.0.reg2mem
br i1 %15, label LBL_9, label LBL_8
LBL_8:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_9
LBL_9:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %sv_0, { 1, 0, 2 }
uselistorder i32* %.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__unsigned_int_rand_postdec_14-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%.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 i32 0, i32* %sv_0.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i32 @rand()
%4 = urem i32 %3, 2
%5 = icmp eq i32 %4, 0
%6 = call i32 @rand()
%7 = mul i32 %6, 1073741824
%8 = call i32 @rand()
%9 = mul i32 %8, 32768
%10 = xor i32 %9, %7
%11 = call i32 @rand()
%12 = xor i32 %10, %11
%13 = sext i1 %5 to i32
%storemerge.in = xor i32 %12, %13
%.pre = load i32, i32* @gv_0, align 4
store i32 %.pre, i32* %.reg2mem
store i32 %storemerge.in, i32* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%.reload = load i32, i32* %.reg2mem
%14 = zext i32 %.reload to i64
%15 = icmp eq i32 %.reload, 5
%16 = icmp eq i1 %15, false
store i64 %14, i64* %rax.0.reg2mem
br i1 %16, label LBL_6, label LBL_3
LBL_3:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%17 = icmp eq i32 %sv_0.0.reload, 0
br i1 %17, label LBL_5, label LBL_4
LBL_4:
%18 = add i32 %sv_0.0.reload, -1
%19 = zext i32 %18 to i64
%20 = call i64 @FUNC(i64 %19)
store i64 %20, i64* %rax.0.reg2mem
br label LBL_6
LBL_5:
%21 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_1 to i64))
store i64 %21, i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %rax.0.reg2mem, { 0, 2, 1, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE484_Omitted_Break_Statement_in_Switch__basic_05-bad
|
CWE484_Omitted_Break_Statement_in_Switch__basic_05_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
store i64 0, i64* %rax.0.reg2mem
br i1 %1, label LBL_8, label LBL_1
LBL_1:
%2 = call i32 @rand()
%3 = srem i32 %2, 3
%4 = icmp eq i32 %3, 2
br i1 %4, label LBL_6, label LBL_2
LBL_2:
br i1 false, label LBL_7, label LBL_3
LBL_3:
switch i32 %3, label LBL_7 [
i32 0, label LBL_4
i32 1, label LBL_5
]
LBL_4:
%5 = call i64 @FUNC(i64 ptrtoint (i64* @gv_1 to i64))
br label LBL_5
LBL_5:
%6 = call i64 @FUNC(i64 ptrtoint (i64* @gv_2 to i64))
store i64 %6, i64* %rax.0.reg2mem
br label LBL_8
LBL_6:
%7 = call i64 @FUNC(i64 ptrtoint (i64* @gv_3 to i64))
store i64 %7, i64* %rax.0.reg2mem
br label LBL_8
LBL_7:
%8 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_4 to i64))
store i64 %8, 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 %3, { 1, 0 }
uselistorder i64* %rax.0.reg2mem, { 0, 2, 3, 1, 4 }
uselistorder label LBL_5, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__int_fscanf_divide_03-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i32, align 4
%0 = call i64 @FUNC(i64 40)
store i32 -1, i32* %sv_0, align 4
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0)
%3 = load i32, i32* %sv_0, align 4
%4 = icmp eq i32 %3, 0
br i1 %4, label LBL_2, label LBL_1
LBL_1:
%5 = udiv i32 100, %3
%6 = zext i32 %5 to i64
%7 = call i64 @FUNC(i64 %6)
br label LBL_3
LBL_2:
%8 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_2 to i64))
br label LBL_3
LBL_3:
%9 = call i64 @FUNC(i64 40)
%10 = icmp eq i64 %0, %9
store i64 0, i64* %rax.0.reg2mem
br i1 %10, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %sv_0, { 1, 0, 2 }
uselistorder %_IO_FILE** @gv_0, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE194_Unexpected_Sign_Extension__fscanf_strncpy_13-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
%sv_2 = alloca i64, align 8
%0 = ptrtoint i64* %sv_2 to i64
%1 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_1, align 8
%2 = call i64* @memset(i64* nonnull %sv_0, i32 65, i32 99)
%3 = bitcast i64* %sv_1 to i8*
%4 = bitcast i64* %sv_0 to i8*
%5 = call i8* @strncpy(i8* nonnull %3, i8* nonnull %4, i32 99)
%6 = add i64 %0, -13
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 1
%8 = ptrtoint i64* %sv_1 to i64
%9 = call i64 @FUNC(i64 %8)
%10 = call i64 @FUNC(i64 40)
%11 = icmp eq i64 %1, %10
store i64 0, i64* %rax.0.reg2mem
br i1 %11, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_1, { 1, 0, 2 }
uselistorder i8* (i8*, i8*, i32)* @strncpy, { 1, 0, 2 }
uselistorder i32 99, { 1, 2, 3, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__struct_array_malloc_partial_init_05-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.2.reg2mem = alloca i64
%indvars.iv.reg2mem = alloca i64
%indvars.iv7.reg2mem = alloca i64
%indvars.iv10.reg2mem = alloca i64
%0 = call i64* @malloc(i32 80)
%1 = icmp eq i64* %0, null
%2 = icmp eq i1 %1, false
br i1 %2, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%3 = ptrtoint i64* %0 to i64
%4 = load i32, i32* @gv_0, align 4
%5 = icmp eq i32 %4, 0
store i64 0, i64* %indvars.iv10.reg2mem
store i64 0, i64* %rax.2.reg2mem
br i1 %5, label LBL_7, label LBL_3
LBL_3:
%indvars.iv10.reload = load i64, i64* %indvars.iv10.reg2mem
%6 = mul i64 %indvars.iv10.reload, 8
%7 = add i64 %6, %3
%8 = inttoptr i64 %7 to i32*
%9 = trunc i64 %indvars.iv10.reload to i32
store i32 %9, i32* %8, align 4
%10 = add i64 %7, 4
%11 = inttoptr i64 %10 to i32*
store i32 %9, i32* %11, align 4
%indvars.iv.next11 = add nuw nsw i64 %indvars.iv10.reload, 1
%exitcond12 = icmp eq i64 %indvars.iv.next11, 5
store i64 %indvars.iv.next11, i64* %indvars.iv10.reg2mem
br i1 %exitcond12, label LBL_4, label LBL_3
LBL_4:
%.pr = load i32, i32* @gv_0, align 4
%12 = icmp eq i32 %.pr, 0
store i64 0, i64* %indvars.iv7.reg2mem
store i64 0, i64* %rax.2.reg2mem
br i1 %12, label LBL_7, label LBL_5
LBL_5:
%indvars.iv7.reload = load i64, i64* %indvars.iv7.reg2mem
%13 = mul i64 %indvars.iv7.reload, 8
%14 = add i64 %13, %3
%15 = inttoptr i64 %14 to i32*
%16 = trunc i64 %indvars.iv7.reload to i32
store i32 %16, i32* %15, align 4
%17 = add i64 %14, 4
%18 = inttoptr i64 %17 to i32*
store i32 %16, i32* %18, align 4
%indvars.iv.next8 = add nuw nsw i64 %indvars.iv7.reload, 1
%exitcond9 = icmp eq i64 %indvars.iv.next8, 10
store i64 %indvars.iv.next8, i64* %indvars.iv7.reg2mem
store i64 0, i64* %indvars.iv.reg2mem
br i1 %exitcond9, label LBL_6, label LBL_5
LBL_6:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%19 = mul i64 %indvars.iv.reload, 8
%20 = add i64 %19, %3
%21 = inttoptr i64 %20 to i32*
%22 = load i32, i32* %21, align 4
%23 = zext i32 %22 to i64
%24 = call i64 @FUNC(i64 %23)
%25 = add i64 %20, 4
%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)
%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 %29, i64* %rax.2.reg2mem
br i1 %exitcond, label LBL_7, label LBL_6
LBL_7:
%rax.2.reload = load i64, i64* %rax.2.reg2mem
ret i64 %rax.2.reload
uselistorder i64* %0, { 1, 0 }
uselistorder i64* %indvars.iv10.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv7.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 }
uselistorder i64* %rax.2.reg2mem, { 0, 1, 3, 2 }
uselistorder label LBL_7, { 0, 2, 1 }
uselistorder label LBL_6, { 1, 0 }
uselistorder label LBL_5, { 1, 0 }
uselistorder label LBL_3, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__struct_array_malloc_no_init_08-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.2.reg2mem = alloca i64
%indvars.iv.reg2mem = alloca i64
%indvars.iv5.reg2mem = alloca i64
%0 = call i64* @malloc(i32 80)
%1 = icmp eq i64* %0, null
%2 = icmp eq i1 %1, false
br i1 %2, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%3 = ptrtoint i64* %0 to i64
%4 = call i64 @FUNC()
%5 = call i64 @FUNC()
%6 = trunc i64 %5 to i32
%7 = icmp eq i32 %6, 0
store i64 0, i64* %indvars.iv5.reg2mem
br i1 %7, label LBL_4, label LBL_3
LBL_3:
%8 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
store i64 %8, i64* %rax.2.reg2mem
br label LBL_6
LBL_4:
%indvars.iv5.reload = load i64, i64* %indvars.iv5.reg2mem
%9 = mul i64 %indvars.iv5.reload, 8
%10 = add i64 %9, %3
%11 = inttoptr i64 %10 to i32*
%12 = trunc i64 %indvars.iv5.reload to i32
store i32 %12, i32* %11, align 4
%13 = add i64 %10, 4
%14 = inttoptr i64 %13 to i32*
store i32 %12, i32* %14, align 4
%indvars.iv.next6 = add nuw nsw i64 %indvars.iv5.reload, 1
%exitcond7 = icmp eq i64 %indvars.iv.next6, 10
store i64 %indvars.iv.next6, i64* %indvars.iv5.reg2mem
store i64 0, i64* %indvars.iv.reg2mem
br i1 %exitcond7, label LBL_5, label LBL_4
LBL_5:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%15 = mul i64 %indvars.iv.reload, 8
%16 = add i64 %15, %3
%17 = inttoptr i64 %16 to i32*
%18 = load i32, i32* %17, align 4
%19 = zext i32 %18 to i64
%20 = call i64 @FUNC(i64 %19)
%21 = add i64 %16, 4
%22 = inttoptr i64 %21 to i32*
%23 = load i32, i32* %22, align 4
%24 = zext i32 %23 to i64
%25 = call i64 @FUNC(i64 %24)
%indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1
%exitcond = icmp eq i64 %indvars.iv.next, 10
store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem
store i64 %25, i64* %rax.2.reg2mem
br i1 %exitcond, label LBL_6, label LBL_5
LBL_6:
%rax.2.reload = load i64, i64* %rax.2.reg2mem
ret i64 %rax.2.reload
uselistorder i64* %0, { 1, 0 }
uselistorder i64* %indvars.iv5.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 }
uselistorder label LBL_5, { 1, 0 }
uselistorder label LBL_4, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int64_t_fscanf_square_08-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
store i64 %1, i64* %rax.0.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = trunc i64 %0 to i32
%5 = icmp eq i32 %4, 0
%6 = select i1 %5, i64 0, i64 4
%7 = call i64 @FUNC(i64 %6)
store i64 %7, 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 ()* @staticReturnsTrue, { 5, 4, 3, 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE590_Free_Memory_Not_on_Heap__free_struct_alloca_14-bad
|
CWE590_Free_Memory_Not_on_Heap__free_struct_alloca_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i64 0, i64* %.reg2mem
br i1 %3, label LBL_4, label LBL_1
LBL_1:
%4 = ptrtoint i64* %sv_0 to i64
%5 = add i64 %4, 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 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)))
%6 = and i64 %5, -16
store i64 0, i64* %storemerge1.reg2mem
br label LBL_2
LBL_2:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%7 = mul i64 %storemerge1.reload, 8
%8 = add i64 %7, %6
%9 = inttoptr i64 %8 to i32*
store i32 1, i32* %9, align 8
%10 = or i64 %8, 4
%11 = inttoptr i64 %10 to i32*
store i32 1, 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:
store i64 %6, i64* %sv_0, align 8
store i64 %6, i64* %.reg2mem
br label LBL_4
LBL_4:
%.reload = load i64, i64* %.reg2mem
%13 = call i64 @FUNC(i64 %.reload)
%14 = load i64, i64* %sv_0, align 8
%15 = inttoptr i64 %14 to i64*
call void @free(i64* %15)
%16 = call i64 @FUNC(i64 40)
%17 = icmp eq i64 %0, %16
store i64 0, i64* %rax.0.reg2mem
br i1 %17, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %6, { 0, 2, 1 }
uselistorder i64* %sv_0, { 0, 1, 3, 2 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder i64* %.reg2mem, { 0, 2, 1 }
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
|
CWE666_Operation_on_Resource_in_Wrong_Phase_of_Lifetime__listen_bind_accept_08-bad
|
CWE666_Operation_on_Resource_in_Wrong_Phase_of_Lifetime__listen_bind_accept_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = 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 i64 0, i64* %sv_1, align 8
%4 = bitcast i64* %sv_1 to i8*
%5 = call i32 @strlen(i8* nonnull %4)
%6 = call i32 @socket(i32 2, i32 1, i32 6)
%7 = icmp eq i32 %6, -1
br i1 %7, label LBL_12, label LBL_2
LBL_2:
%8 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16)
store i64 2, i64* %sv_0, align 8
%9 = call i16 @htons(i16 27015)
%10 = call i32 @listen(i32 %6, i32 5)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_10, label LBL_3
LBL_3:
%12 = bitcast i64* %sv_0 to %sockaddr*
%13 = call i32 @bind(i32 %6, %sockaddr* nonnull %12, i32 16)
%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 = sub i32 99, %5
%18 = ptrtoint i64* %sv_1 to i64
%19 = sext i32 %5 to i64
%20 = add i64 %19, %18
%21 = inttoptr i64 %20 to i64*
%22 = call i32 @recv(i32 %15, i64* %21, i32 %17, 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 = ptrtoint i64* %sv_2 to i64
%26 = sext i32 %22 to i64
%27 = add i64 %25, -112
%28 = add i64 %27, %26
%29 = inttoptr i64 %28 to i8*
store i8 0, i8* %29, align 1
%30 = call i8* @strchr(i8* nonnull %4, i32 13)
%31 = icmp eq i8* %30, null
br i1 %31, label LBL_8, label LBL_7
LBL_7:
store i8 0, i8* %30, align 1
br label LBL_8
LBL_8:
%32 = call i8* @strchr(i8* nonnull %4, i32 10)
%33 = icmp eq i8* %32, null
br i1 %33, label LBL_11, label LBL_9
LBL_9:
store i8 0, i8* %32, align 1
br label LBL_11
LBL_10:
%34 = call i32 @close(i32 %6)
br label LBL_12
LBL_11:
%35 = call i32 @close(i32 %6)
%36 = call i32 @close(i32 %15)
br label LBL_12
LBL_12:
%37 = call i64 @FUNC(i64* nonnull %sv_1)
br label LBL_13
LBL_13:
%38 = call i64 @FUNC(i64 40)
%39 = icmp eq i64 %0, %38
store i64 0, i64* %rax.0.reg2mem
br i1 %39, label LBL_15, label LBL_14
LBL_14:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_15
LBL_15:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %22, { 1, 0 }
uselistorder i32 %6, { 4, 0, 1, 2, 3, 5 }
uselistorder i32 %5, { 1, 0 }
uselistorder i64* %sv_1, { 0, 2, 1, 3 }
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 }
}
|
1
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__char_alloca_ncpy_04-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i8*, align 8
%sv_2 = alloca i8*, align 8
%0 = ptrtoint i8** %sv_2 to i64
%1 = call i64 @FUNC(i64 40)
%2 = add i64 %0, -97
%3 = and i64 %2, -16
%4 = inttoptr i64 %3 to i8*
store i8* %4, i8** %sv_1, align 8
%5 = inttoptr i64 %3 to i64*
%6 = call i64* @memset(i64* %5, i32 65, i32 99)
%7 = add i64 %3, 99
%8 = inttoptr i64 %7 to i8*
store i8 0, i8* %8, align 1
%9 = load i8*, i8** %sv_1, align 8
%10 = ptrtoint i8* %9 to i64
%11 = bitcast i8** %sv_2 to i64*
store i64 %10, i64* %11, align 8
%12 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%13 = load i8*, i8** %sv_2, align 8
%14 = bitcast i64* %sv_0 to i8*
%15 = call i8* @strncpy(i8* %13, i8* nonnull %14, i32 99)
%16 = load i8*, i8** %sv_2, align 8
%17 = ptrtoint i8* %16 to i64
%18 = add i64 %17, 99
%19 = inttoptr i64 %18 to i8*
store i8 0, i8* %19, align 1
%20 = load i8*, i8** %sv_2, align 8
%21 = ptrtoint i8* %20 to i64
%22 = call i64 @FUNC(i64 %21)
%23 = call i64 @FUNC(i64 40)
%24 = icmp eq i64 %1, %23
store i64 0, i64* %rax.0.reg2mem
br i1 %24, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %3, { 1, 0, 2 }
uselistorder i8** %sv_2, { 4, 3, 2, 0, 1 }
uselistorder i8* (i8*, i8*, i32)* @strncpy, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 3, 2, 1, 0, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int_fgets_sub_11-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
store i32 0, i32* %sv_0.0.reg2mem
br i1 %3, label LBL_4, label LBL_1
LBL_1:
store i64 0, i64* %sv_1, align 8
%4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%5 = bitcast i64* %sv_1 to i8*
%6 = call i8* @fgets(i8* nonnull %5, i32 14, %_IO_FILE* %4)
%7 = icmp eq i8* %6, null
br i1 %7, label LBL_3, label LBL_2
LBL_2:
%8 = call i32 @atoi(i8* nonnull %5)
store i32 %8, i32* %sv_0.0.reg2mem
br label LBL_4
LBL_3:
%9 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64))
store i32 0, i32* %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%10 = call i64 @FUNC()
%11 = trunc i64 %10 to i32
%12 = icmp eq i32 %11, 0
br i1 %12, label LBL_6, label LBL_5
LBL_5:
%13 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64))
br label LBL_9
LBL_6:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%14 = icmp eq i32 %sv_0.0.reload, -2147483648
br i1 %14, label LBL_8, label LBL_7
LBL_7:
%15 = add i32 %sv_0.0.reload, -1
%16 = zext i32 %15 to i64
%17 = call i64 @FUNC(i64 %16)
br label LBL_9
LBL_8:
%18 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_3 to i64))
br label LBL_9
LBL_9:
%19 = call i64 @FUNC(i64 40)
%20 = icmp eq i64 %0, %19
store i64 0, i64* %rax.0.reg2mem
br i1 %20, label LBL_11, label LBL_10
LBL_10:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_11
LBL_11:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %sv_0.0.reg2mem, { 0, 2, 1, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_alloca_memmove_08-bad
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_alloca_memmove_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
%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 = add i64 %4, -49
%6 = and i64 %5, -16
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 16
store i64 %6, i64* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%8 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%9 = inttoptr i64 %sv_0.0.reload to i64*
%10 = call i64* @memmove(i64* %9, i64* nonnull %sv_1, i32 100)
%11 = add i64 %sv_0.0.reload, 99
%12 = inttoptr i64 %11 to i8*
store i8 0, i8* %12, align 1
%13 = call i64 @FUNC(i64 %sv_0.0.reload)
%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 %sv_0.0.reload, { 2, 0, 1 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_declare_loop_14-bad
|
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_declare_loop_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
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 = sext i32 %7 to i64
%9 = add nsw i64 %8, 1
%10 = icmp eq i64 %9, 0
br i1 %10, label LBL_5, label LBL_3
LBL_3:
%11 = ptrtoint i64* %sv_1 to i64
store i64 0, i64* %storemerge1.reg2mem
br label LBL_4
LBL_4:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%12 = add i64 %storemerge1.reload, %sv_0.0.reload
%13 = add i64 %storemerge1.reload, %11
%14 = inttoptr i64 %13 to i8*
%15 = load i8, i8* %14, align 1
%16 = inttoptr i64 %12 to i8*
store i8 %15, i8* %16, align 1
%17 = add nuw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %17, %9
store i64 %17, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_5, label LBL_4
LBL_5:
%18 = call i64 @FUNC(i64 %sv_0.0.reload)
%19 = call i64 @FUNC(i64 40)
%20 = icmp eq i64 %0, %19
store i64 0, i64* %rax.0.reg2mem
br i1 %20, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %storemerge1.reload, { 0, 2, 1 }
uselistorder i64* %sv_1, { 1, 0, 2 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_int64_t_loop_15-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* @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 = ptrtoint i64* %1 to i64
%5 = ptrtoint i64* %sv_1 to i64
%6 = bitcast i64* %sv_0 to i8*
call void @FUNC(i8* nonnull %6, i64 0, i64 100)
%7 = add i64 %5, -816
store i64 0, i64* %storemerge1.reg2mem
br label LBL_3
LBL_3:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%8 = mul i64 %storemerge1.reload, 8
%9 = add i64 %8, %4
%10 = add i64 %7, %8
%11 = inttoptr i64 %10 to i64*
%12 = load i64, i64* %11, align 8
%13 = inttoptr i64 %9 to i64*
store i64 %12, i64* %13, align 8
%14 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %14, 100
store i64 %14, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
%15 = load i64, i64* %1, align 8
%16 = call i64 @FUNC(i64 %15)
call void @free(i64* %1)
%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* %1, { 0, 1, 3, 2 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i64 (i64)* @printLongLongLine, { 1, 0 }
uselistorder i64 100, { 0, 2, 1, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__fopen_14-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0))
%1 = load i32, i32* @gv_2, align 4
%2 = zext i32 %1 to i64
%3 = icmp eq i32 %1, 5
%4 = icmp eq i1 %3, false
%5 = icmp eq %_IO_FILE* %0, null
%or.cond = or i1 %5, %4
store i64 %2, i64* %rax.0.reg2mem
br i1 %or.cond, label LBL_2, label LBL_1
LBL_1:
%6 = call i32 @fclose(%_IO_FILE* nonnull %0)
%7 = sext i32 %6 to i64
store i64 %7, i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder %_IO_FILE* %0, { 1, 0 }
uselistorder i32 (%_IO_FILE*)* @fclose, { 1, 0, 2 }
uselistorder %_IO_FILE* (i8*, i8*)* @fopen, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE194_Unexpected_Sign_Extension__negative_malloc_02-bad
|
CWE194_Unexpected_Sign_Extension__negative_malloc_02_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64* @malloc(i32 -1)
%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* @memset(i64* %0, i32 65, i32 -2)
%5 = add i64 %3, -2
%6 = inttoptr i64 %5 to i8*
store i8 0, i8* %6, align 1
%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 i32 -1, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE758_Undefined_Behavior__struct_malloc_use_14-bad
|
CWE758_Undefined_Behavior__struct_malloc_use_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i32
%rax.0.reg2mem = alloca i64
%1 = load i32, i32* %0
%2 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%3 = zext i32 %2 to i64
%4 = icmp eq i32 %2, 5
%5 = icmp eq i1 %4, false
store i64 %3, i64* %rax.0.reg2mem
br i1 %5, label LBL_4, label LBL_1
LBL_1:
%6 = call i64* @malloc(i32 8)
%7 = icmp eq i64* %6, null
%8 = icmp eq i1 %7, false
br i1 %8, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%9 = load i64, i64* %6, align 8
call void @free(i64* %6)
%10 = and i64 %9, 4294967295
%11 = call i64 @FUNC(i64 %10)
%12 = zext i32 %1 to i64
%13 = call i64 @FUNC(i64 %12)
store i64 %13, i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int64_t_fscanf_multiply_10-bad
|
CWE190_Integer_Overflow__int64_t_fscanf_multiply_10_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_3, label LBL_1
LBL_1:
%3 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%4 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %3, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_2, i64 0, i64 0), i64* nonnull %sv_0)
%.pre = load i32, i32* @gv_0, align 4
%.pre2 = load i64, i64* %sv_0, align 8
%phitmp = icmp eq i32 %.pre, 0
%5 = icmp slt i64 %.pre2, 1
%or.cond = or i1 %phitmp, %5
br i1 %or.cond, label LBL_3, label LBL_2
LBL_2:
%6 = mul i64 %.pre2, 2
%7 = call i64 @FUNC(i64 %6)
br label LBL_3
LBL_3:
%8 = call i64 @FUNC(i64 40)
%9 = icmp eq i64 %0, %8
store i64 0, i64* %rax.0.reg2mem
br i1 %9, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder label LBL_3, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__dest_char_declare_cpy_13-bad
|
CWE121_Stack_Based_Buffer_Overflow__dest_char_declare_cpy_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 = 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 = bitcast i64* %sv_1 to i8*
%7 = call i8* @strcpy(i8* %sv_0.0.reload, i8* nonnull %6)
%8 = ptrtoint i8* %sv_0.0.reload to i64
%9 = call i64 @FUNC(i64 %8)
%10 = call i64 @FUNC(i64 40)
%11 = icmp eq i64 %0, %10
store i64 0, i64* %rax.0.reg2mem
br i1 %11, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int64_t_fscanf_postinc_14-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = zext i32 %0 to i64
%2 = icmp eq i32 %0, 5
%3 = icmp eq i1 %2, false
store i64 %1, i64* %rax.0.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 3)
store i64 %4, i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 (i64)* @printLongLongLine, { 3, 2, 1, 0 }
uselistorder i64 3, { 1, 0 }
uselistorder i32* @gv_0, { 5, 0, 4, 1, 3, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE400_Resource_Exhaustion__rand_sleep_01-bad
|
CWE400_Resource_Exhaustion__rand_sleep_01_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i32 @rand()
%1 = urem i32 %0, 2
%2 = icmp eq i32 %1, 0
%3 = call i32 @rand()
%4 = mul i32 %3, 1073741824
%5 = call i32 @rand()
%6 = mul i32 %5, 32768
%7 = xor i32 %6, %4
%8 = call i32 @rand()
%9 = xor i32 %7, %8
%10 = sext i1 %2 to i32
%storemerge.in = xor i32 %9, %10
%11 = call i32 @usleep(i32 %storemerge.in)
%12 = call i64 @FUNC(i64 ptrtoint ([29 x i8]* @gv_0 to i64))
ret i64 %12
}
|
1
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__char_pointer_14-bad
|
CWE457_Use_of_Uninitialized_Variable__char_pointer_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i64
%rax.0.reg2mem = alloca i64
%1 = load i64, i64* %0
%2 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%3 = zext i32 %2 to i64
%4 = icmp eq i32 %2, 5
%5 = icmp eq i1 %4, false
store i64 %3, i64* %rax.0.reg2mem
br i1 %5, label LBL_2, label LBL_1
LBL_1:
%6 = call i64 @FUNC(i64 %1)
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
}
|
1
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__char_alloca_memmove_13-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i64
%rax.0.reg2mem = alloca i64
%.pre-phi.reg2mem = alloca i64*
%sv_0 = alloca i64, align 8
%1 = load i64, i64* %0
%sv_1 = alloca i64, align 8
%2 = ptrtoint i64* %sv_1 to i64
%3 = call i64 @FUNC(i64 40)
%4 = add i64 %2, -49
%5 = and i64 %4, -16
%6 = add i64 %2, -161
%7 = and i64 %6, -16
%8 = inttoptr i64 %5 to i64*
%9 = call i64* @memset(i64* %8, i32 65, i32 49)
%10 = add i64 %5, 49
%11 = inttoptr i64 %10 to i8*
store i8 0, i8* %11, align 1
%12 = inttoptr i64 %7 to i64*
%13 = call i64* @memset(i64* %12, i32 65, i32 99)
%14 = add i64 %7, 99
%15 = inttoptr i64 %14 to i8*
store i8 0, i8* %15, align 1
%16 = load i32, i32* inttoptr (i64 8360 to i32*), align 8
%17 = icmp eq i32 %16, 5
store i64* %12, i64** %.pre-phi.reg2mem
br i1 %17, label LBL_2, label LBL_1
LBL_1:
%18 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
%.pre = inttoptr i64 %1 to i64*
store i64* %.pre, i64** %.pre-phi.reg2mem
br label LBL_2
LBL_2:
%.pre-phi.reload = load i64*, i64** %.pre-phi.reg2mem
%19 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%20 = bitcast i64* %sv_0 to i8*
%21 = call i32 @strlen(i8* nonnull %20)
%22 = call i64* @memmove(i64* nonnull %sv_0, i64* %.pre-phi.reload, i32 %21)
%23 = ptrtoint i64* %sv_0 to i64
%24 = call i64 @FUNC(i64 %23)
%25 = call i64 @FUNC(i64 40)
%26 = icmp eq i64 %3, %25
store i64 0, i64* %rax.0.reg2mem
br i1 %26, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %7, { 1, 0 }
uselistorder i64 %5, { 1, 0 }
uselistorder i64* %sv_0, { 3, 0, 1, 2 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE252_Unchecked_Return_Value__char_fscanf_07-bad
|
CWE252_Unchecked_Return_Value__char_fscanf_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_2, label LBL_1
LBL_1:
store i64 0, i64* %sv_0, align 8
%4 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([5 x i8], [5 x i8]* @gv_2, i64 0, i64 0), i64* nonnull %sv_0)
br label LBL_2
LBL_2:
%6 = call i64 @FUNC(i64 40)
%7 = icmp eq i64 %0, %6
store i64 0, i64* %rax.0.reg2mem
br i1 %7, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder %_IO_FILE** @gv_1, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE415_Double_Free__malloc_free_long_07-bad
|
CWE415_Double_Free__malloc_free_long_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64*
%.reg2mem = alloca i32
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 5
%2 = icmp eq i1 %1, false
store i32 %0, i32* %.reg2mem
store i64* null, i64** %sv_0.0.reg2mem
br i1 %2, label LBL_4, label LBL_1
LBL_1:
%3 = call i64* @malloc(i32 ptrtoint (i32* @gv_1 to i32))
%4 = icmp eq i64* %3, null
%5 = icmp eq i1 %4, false
br i1 %5, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
call void @free(i64* %3)
%.pre = load i32, i32* @gv_0, align 4
store i32 %.pre, i32* %.reg2mem
store i64* %3, i64** %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%.reload = load i32, i32* %.reg2mem
%6 = zext i32 %.reload to i64
%7 = icmp eq i32 %.reload, 5
%8 = icmp eq i1 %7, false
store i64 %6, i64* %rax.0.reg2mem
br i1 %8, label LBL_6, label LBL_5
LBL_5:
%sv_0.0.reload = load i64*, i64** %sv_0.0.reg2mem
call void @free(i64* %sv_0.0.reload)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* null, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_declare_memmove_12-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = bitcast i64* %sv_1 to i8*
%2 = call i64 @FUNC()
%3 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 49)
%4 = ptrtoint i64* %sv_1 to i64
%5 = add i64 %4, 49
%6 = inttoptr i64 %5 to i8*
store i8 0, i8* %6, align 1
store i64 0, i64* %sv_0, align 8
%7 = call i32 @strlen(i8* nonnull %1)
%8 = call i64* @memmove(i64* nonnull %sv_0, i64* nonnull %sv_1, i32 %7)
%9 = call i64 @FUNC(i64 %4)
%10 = call i64 @FUNC(i64 40)
%11 = icmp eq i64 %0, %10
store i64 0, i64* %rax.0.reg2mem
br i1 %11, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
0
|
juliet-test-suite-c
|
CWE401_Memory_Leak__int_malloc_02-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64* @malloc(i32 400)
%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 5, i32* %3, align 4
%4 = call i64 @FUNC(i64 5)
call void @free(i64* %0)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__int_malloc_13-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64* @malloc(i32 4)
%1 = load i32, i32* inttoptr (i64 8360 to i32*), align 8
%2 = icmp eq i32 %1, 5
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
store i64 %3, i64* %rax.0.reg2mem
br label LBL_4
LBL_2:
%4 = icmp eq i64* %0, null
store i64 5, i64* %rax.0.reg2mem
br i1 %4, label LBL_4, label LBL_3
LBL_3:
%5 = bitcast i64* %0 to i32*
store i32 5, i32* %5, align 4
%6 = call i64 @FUNC(i64 5)
call void @free(i64* nonnull %0)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %rax.0.reg2mem, { 0, 2, 3, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__char_fscanf_sub_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 4294967293)
store i64 %4, i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 (i64)* @printHexCharLine, { 3, 2, 1, 0 }
uselistorder i64 4294967293, { 1, 0 }
uselistorder i32* @gv_0, { 5, 0, 4, 1, 3, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__char_rand_multiply_01-good
|
goodB2G
|
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 = call i32 @rand()
%6 = sub i32 0, %5
%7 = sub i32 %6, 1
%8 = zext i32 %7 to i64
%9 = sext i32 %5 to i64
%storemerge = select i1 %2, i64 %8, i64 %9
%10 = trunc i64 %storemerge to i8
%11 = icmp slt i8 %10, 0
%12 = icmp eq i1 %11, false
store i64 %storemerge, i64* %rax.0.reg2mem
br i1 %12, label LBL_4, label LBL_1
LBL_1:
%13 = icmp slt i8 %10, -63
br i1 %13, label LBL_3, label LBL_2
LBL_2:
%14 = trunc i64 %storemerge to i32
%sext = mul i32 %14, 33554432
%15 = ashr exact i32 %sext, 24
%16 = zext i32 %15 to i64
%17 = call i64 @FUNC(i64 %16)
store i64 %17, i64* %rax.0.reg2mem
br label LBL_4
LBL_3:
%18 = call i64 @FUNC(i64 ptrtoint ([51 x i8]* @gv_0 to i64))
store i64 %18, i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %storemerge, { 1, 0, 2 }
uselistorder i32 %5, { 1, 0 }
uselistorder i64* %rax.0.reg2mem, { 0, 2, 1, 3 }
uselistorder i64 (i64)* @printHexCharLine, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__int64_t_realloc_02-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64* @realloc(i64* null, i32 8)
%1 = ptrtoint i64* %0 to i64
%2 = icmp eq i64* %0, null
store i64 %1, i64* %rax.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
store i64 5, i64* %0, align 8
%3 = call i64 @FUNC(i64 5)
call void @free(i64* nonnull %0)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i64 (i64)* @printLongLongLine, { 1, 0 }
uselistorder i64 5, { 0, 2, 1, 3 }
uselistorder i64* (i64*, i32)* @realloc, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__int_fscanf_divide_08-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i32, align 4
%0 = call i64 @FUNC(i64 40)
store i32 -1, i32* %sv_0, align 4
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0)
br label LBL_2
LBL_2:
%6 = call i64 @FUNC()
%7 = trunc i64 %6 to i32
%8 = icmp eq i32 %7, 0
br i1 %8, label LBL_4, label LBL_3
LBL_3:
%9 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64))
br label LBL_7
LBL_4:
%10 = load i32, i32* %sv_0, align 4
%11 = icmp eq i32 %10, 0
br i1 %11, label LBL_6, label LBL_5
LBL_5:
%12 = udiv i32 100, %10
%13 = zext i32 %12 to i64
%14 = call i64 @FUNC(i64 %13)
br label LBL_7
LBL_6:
%15 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_3 to i64))
br label LBL_7
LBL_7:
%16 = call i64 @FUNC(i64 40)
%17 = icmp eq i64 %0, %16
store i64 0, i64* %rax.0.reg2mem
br i1 %17, label LBL_9, label LBL_8
LBL_8:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_9
LBL_9:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %sv_0, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__malloc_char_memmove_14-bad
|
CWE124_Buffer_Underwrite__malloc_char_memmove_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i64 0, i64* %sv_0.0.reg2mem
br i1 %3, label LBL_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 = 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
%11 = add i64 %7, -8
store i64 %11, i64* %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%12 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%13 = inttoptr i64 %sv_0.0.reload to i64*
%14 = call i64* @memmove(i64* %13, i64* nonnull %sv_1, i32 100)
%15 = add i64 %sv_0.0.reload, 99
%16 = inttoptr i64 %15 to i8*
store i8 0, i8* %16, align 1
%17 = call i64 @FUNC(i64 %sv_0.0.reload)
%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 i64 %sv_0.0.reload, { 2, 0, 1 }
uselistorder i64* %4, { 0, 2, 1 }
}
|
1
|
juliet-test-suite-c
|
CWE127_Buffer_Underread__char_alloca_loop_07-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i64
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%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 i32* @gv_0, { 1, 0 }
uselistorder i64* (i64*, i32, i32)* @memset, { 3, 2, 1, 0, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE123_Write_What_Where_Condition__fgets_10-bad
|
CWE123_Write_What_Where_Condition__fgets_10_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.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_0 to i64
store i64 %1, i64* %sv_1, align 8
%2 = ptrtoint i64* %sv_1 to i64
store i64 %2, i64* %sv_0, align 8
%3 = load i32, i32* @gv_0, align 4
%4 = icmp eq i32 %3, 0
store i64 %1, i64* %.reg2mem
br i1 %4, label LBL_4, label LBL_1
LBL_1:
%5 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%6 = bitcast i64* %sv_1 to i8*
%7 = call i8* @fgets(i8* nonnull %6, i32 16, %_IO_FILE* %5)
%8 = icmp eq i8* %7, null
%9 = icmp eq i1 %8, false
br i1 %9, label LBL_1.LBL_4_crit_edge, label LBL_3
LBL_2:
%.pre = load i64, i64* %sv_1, align 8
store i64 %.pre, i64* %.reg2mem
br label LBL_4
LBL_3:
%10 = call i64 @FUNC(i64 ptrtoint ([14 x i8]* @gv_2 to i64))
call void @exit(i32 1)
unreachable
LBL_4:
%.reload = load i64, i64* %.reg2mem
store i64 %1, i64* @gv_3, align 8
store i64 %.reload, i64* @gv_4, align 8
store i64 %.reload, i64* %sv_0, align 8
%11 = add i64 %.reload, 8
%12 = inttoptr i64 %11 to i64*
store i64 %1, i64* %12, align 8
%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 %1, { 1, 2, 0, 3 }
uselistorder i64* %.reg2mem, { 0, 2, 1 }
}
|
1
|
juliet-test-suite-c
|
CWE127_Buffer_Underread__CWE839_negative_04-bad
|
CWE127_Buffer_Underread__CWE839_negative_04_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = ptrtoint i64* %sv_0 to i64
%2 = add i64 %1, -68
%3 = inttoptr i64 %2 to i32*
%4 = load i32, i32* %3, align 4
%5 = zext i32 %4 to i64
%6 = call i64 @FUNC(i64 %5)
%7 = call i64 @FUNC(i64 40)
%8 = icmp eq i64 %0, %7
store i64 0, i64* %rax.0.reg2mem
br i1 %8, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
1
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__CWE839_rand_05-bad
|
CWE124_Buffer_Underwrite__CWE839_rand_05_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%indvars.iv.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_6, label LBL_1
LBL_1:
%3 = call i32 @rand()
%4 = call i32 @rand()
%5 = call i32 @rand()
%6 = call i32 @rand()
%.pr = load i32, i32* @gv_0, align 4
%7 = icmp eq i32 %.pr, 0
br i1 %7, label LBL_6, label LBL_2
LBL_2:
%8 = urem i32 %3, 2
%9 = icmp eq i32 %8, 0
%10 = mul i32 %4, 1073741824
%11 = mul i32 %5, 32768
%12 = xor i32 %11, %10
%13 = xor i32 %12, %6
%14 = sext i1 %9 to i32
%storemerge1.in = xor i32 %13, %14
%15 = icmp sgt i32 %storemerge1.in, 9
br i1 %15, label LBL_5, label LBL_3
LBL_3:
%16 = ptrtoint i64* %sv_0 to i64
%17 = sext i32 %storemerge1.in to i64
%18 = mul i64 %17, 4
%19 = add i64 %16, -64
%20 = add i64 %18, %19
%21 = inttoptr i64 %20 to i32*
store i32 1, i32* %21, align 4
store i64 0, i64* %indvars.iv.reg2mem
br label LBL_4
LBL_4:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%22 = mul i64 %indvars.iv.reload, 4
%23 = add i64 %22, %19
%24 = inttoptr i64 %23 to i32*
%25 = load i32, i32* %24, align 4
%26 = zext i32 %25 to i64
%27 = call i64 @FUNC(i64 %26)
%indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1
%exitcond = icmp eq i64 %indvars.iv.next, 10
store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem
br i1 %exitcond, label LBL_6, label LBL_4
LBL_5:
%28 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_1 to i64))
br label LBL_6
LBL_6:
%29 = call i64 @FUNC(i64 40)
%30 = icmp eq i64 %0, %29
store i64 0, i64* %rax.0.reg2mem
br i1 %30, 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* %indvars.iv.reg2mem, { 1, 0, 2 }
uselistorder label LBL_6, { 2, 0, 3, 1 }
}
|
1
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__double_array_declare_partial_init_07-bad
|
CWE457_Use_of_Uninitialized_Variable__double_array_declare_partial_init_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%indvars.iv.reg2mem = alloca i64
%.reg2mem = alloca i32
%xmm0.04.reg2mem = alloca i128
%indvars.iv6.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = ptrtoint i64* %sv_0 to i64
%2 = load i32, i32* @gv_0, align 4
%3 = icmp eq i32 %2, 5
%4 = icmp eq i1 %3, false
store i64 0, i64* %indvars.iv6.reg2mem
store i32 %2, i32* %.reg2mem
br i1 %4, label LBL_3, label LBL_1
LBL_1:
%xmm0.04.reload = load i128, i128* %xmm0.04.reg2mem
%indvars.iv6.reload = load i64, i64* %indvars.iv6.reg2mem
%5 = mul i64 %indvars.iv6.reload, 8
%6 = add i64 %5, %1
%7 = call i128 @FUNC(i128 %xmm0.04.reload, i128 %xmm0.04.reload)
%8 = trunc i64 %indvars.iv6.reload to i32
%9 = call i128 @FUNC(i32 %8)
%10 = call i64 @FUNC(i128 %9)
%11 = inttoptr i64 %6 to i64*
store i64 %10, i64* %11, align 8
%indvars.iv.next7 = add nuw nsw i64 %indvars.iv6.reload, 1
%exitcond8 = icmp eq i64 %indvars.iv.next7, 5
store i64 %indvars.iv.next7, i64* %indvars.iv6.reg2mem
store i128 %9, i128* %xmm0.04.reg2mem
br i1 %exitcond8, label LBL_2, label LBL_1
LBL_2:
%.pre = load i32, i32* @gv_0, align 4
store i32 %.pre, i32* %.reg2mem
br label LBL_3
LBL_3:
%.reload = load i32, i32* %.reg2mem
%12 = icmp eq i32 %.reload, 5
%13 = icmp eq i1 %12, false
store i64 0, i64* %indvars.iv.reg2mem
br i1 %13, label LBL_5, label LBL_4
LBL_4:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%14 = mul i64 %indvars.iv.reload, 8
%15 = add i64 %14, %1
%16 = inttoptr i64 %15 to i64*
%17 = load i64, i64* %16, align 8
%18 = call i128 @FUNC(i64 %17)
%19 = call i64 @FUNC()
%indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1
%exitcond = icmp eq i64 %indvars.iv.next, 10
store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem
br i1 %exitcond, label LBL_5, label LBL_4
LBL_5:
%20 = call i64 @FUNC(i64 40)
%21 = icmp eq i64 %0, %20
store i64 0, i64* %rax.0.reg2mem
br i1 %21, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i128 %xmm0.04.reload, { 1, 0 }
uselistorder i64* %indvars.iv6.reg2mem, { 2, 0, 1 }
uselistorder i128* %xmm0.04.reg2mem, { 1, 0 }
uselistorder i32* %.reg2mem, { 0, 2, 1 }
uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 }
uselistorder label LBL_4, { 1, 0 }
uselistorder label LBL_1, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int64_t_min_multiply_11-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
%3 = call i64 @FUNC()
%4 = trunc i64 %3 to i32
%5 = icmp eq i32 %4, 0
%or.cond = or i1 %2, %5
store i64 %3, i64* %rax.0.reg2mem
br i1 %or.cond, label LBL_2, label LBL_1
LBL_1:
%6 = call i64 @FUNC(i64 -4)
store i64 %6, i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 (i64)* @printLongLongLine, { 1, 0 }
uselistorder i64 ()* @globalReturnsTrue, { 5, 4, 3, 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_file_fprintf_17-bad
|
CWE134_Uncontrolled_Format_String__char_file_fprintf_17_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = bitcast i64* %sv_0 to i8*
%2 = call i32 @strlen(i8* nonnull %1)
%3 = sext i32 %2 to i64
%4 = sub nsw i64 100, %3
%5 = icmp ult i64 %4, 2
br i1 %5, label LBL_5, label LBL_1
LBL_1:
%6 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_1, i64 0, i64 0))
%7 = icmp eq %_IO_FILE* %6, null
br i1 %7, label LBL_5, label LBL_2
LBL_2:
%8 = ptrtoint i64* %sv_0 to i64
%9 = sub i32 100, %2
%10 = add i64 %3, %8
%11 = inttoptr i64 %10 to i8*
%12 = call i8* @fgets(i8* %11, i32 %9, %_IO_FILE* nonnull %6)
%13 = icmp eq i8* %12, null
%14 = icmp eq i1 %13, false
br i1 %14, label LBL_4, label LBL_3
LBL_3:
%15 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 to i64))
store i8 0, i8* %11, align 1
br label LBL_4
LBL_4:
%16 = call i32 @fclose(%_IO_FILE* nonnull %6)
br label LBL_5
LBL_5:
%17 = load %_IO_FILE*, %_IO_FILE** @gv_3, align 8
%18 = call i32 (%_IO_FILE*, i8*, ...) @fprintf(%_IO_FILE* %17, i8* nonnull %1)
%19 = call i64 @FUNC(i64 40)
%20 = icmp eq i64 %0, %19
store i64 0, i64* %rax.0.reg2mem
br i1 %20, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder %_IO_FILE** @gv_3, { 1, 0 }
uselistorder i8 0, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int_listen_socket_sub_13-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.17.reg2mem = alloca i32
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 8416 to i32*), align 32
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 0, i32* %sv_0.17.reg2mem
br i1 %3, label LBL_9, label LBL_1
LBL_1:
%4 = call i32 @socket(i32 2, i32 1, i32 6)
%5 = icmp eq i32 %4, -1
store i32 0, i32* %sv_0.17.reg2mem
br i1 %5, label LBL_9, label LBL_2
LBL_2:
%6 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%7 = call i16 @htons(i16 27015)
%8 = bitcast i64* %sv_2 to %sockaddr*
%9 = call i32 @bind(i32 %4, %sockaddr* nonnull %8, i32 16)
%10 = icmp eq i32 %9, -1
br i1 %10, label LBL_7, label LBL_3
LBL_3:
%11 = call i32 @listen(i32 %4, i32 5)
%12 = icmp eq i32 %11, -1
br i1 %12, label LBL_7, label LBL_4
LBL_4:
%13 = call i32 @accept(i32 %4, %sockaddr* null, i32* null)
%14 = icmp eq i32 %13, -1
br i1 %14, label LBL_7, label LBL_5
LBL_5:
%15 = call i32 @recv(i32 %13, i64* nonnull %sv_1, i32 13, i32 0)
%16 = add i32 %15, 1
%17 = icmp ult i32 %16, 2
store i32 0, i32* %sv_0.0.ph.reg2mem
br i1 %17, label LBL_8, label LBL_6
LBL_6:
%18 = ptrtoint i64* %sv_3 to i64
%19 = sext i32 %15 to i64
%20 = add i64 %18, -22
%21 = add i64 %20, %19
%22 = inttoptr i64 %21 to i8*
store i8 0, i8* %22, align 1
%23 = bitcast i64* %sv_1 to i8*
%24 = call i32 @atoi(i8* nonnull %23)
store i32 %24, i32* %sv_0.0.ph.reg2mem
br label LBL_8
LBL_7:
%25 = call i32 @close(i32 %4)
store i32 0, i32* %sv_0.17.reg2mem
br label LBL_9
LBL_8:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%26 = call i32 @close(i32 %4)
%27 = call i32 @close(i32 %13)
%28 = icmp eq i32 %sv_0.0.ph.reload, -2147483648
store i32 %sv_0.0.ph.reload, i32* %sv_0.17.reg2mem
br i1 %28, label LBL_10, label LBL_9
LBL_9:
%sv_0.17.reload = load i32, i32* %sv_0.17.reg2mem
%29 = add i32 %sv_0.17.reload, -1
%30 = zext i32 %29 to i64
%31 = call i64 @FUNC(i64 %30)
br label LBL_11
LBL_10:
%32 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_0 to i64))
br label LBL_11
LBL_11:
%33 = call i64 @FUNC(i64 40)
%34 = icmp eq i64 %0, %33
store i64 0, i64* %rax.0.reg2mem
br i1 %34, label LBL_13, label LBL_12
LBL_12:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_13
LBL_13:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %15, { 1, 0 }
uselistorder i32 %4, { 4, 0, 1, 2, 3, 5 }
uselistorder i64* %sv_2, { 0, 2, 1 }
uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 1 }
uselistorder i32* %sv_0.17.reg2mem, { 0, 4, 2, 1, 3 }
uselistorder label LBL_9, { 3, 1, 0, 2 }
uselistorder label LBL_8, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_alloca_memcpy_17-bad
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_alloca_memcpy_17_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge2.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i32
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = ptrtoint i64* %sv_2 to i64
%1 = call i64 @FUNC(i64 40)
%2 = add i64 %0, -401
%3 = and i64 %2, -16
store i32 0, i32* %storemerge1.reg2mem
br label LBL_1
LBL_1:
%storemerge1.reload = load i32, i32* %storemerge1.reg2mem
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%4 = add nuw nsw i32 %storemerge1.reload, 1
%exitcond3 = icmp eq i32 %4, 2
store i64 %3, i64* %sv_0.0.reg2mem
store i32 %4, i32* %storemerge1.reg2mem
br i1 %exitcond3, label LBL_2, label LBL_1
LBL_2:
%5 = ptrtoint i64* %sv_3 to i64
store i64 0, i64* %storemerge2.reg2mem
br label LBL_3
LBL_3:
%storemerge2.reload = load i64, i64* %storemerge2.reg2mem
%6 = mul i64 %storemerge2.reload, 8
%7 = add i64 %6, %5
%8 = add i64 %7, -816
%9 = inttoptr i64 %8 to i32*
store i32 0, i32* %9, align 8
%10 = add i64 %7, -812
%11 = inttoptr i64 %10 to i32*
store i32 0, i32* %11, align 4
%12 = add nuw nsw i64 %storemerge2.reload, 1
%exitcond = icmp eq i64 %12, 100
store i64 %12, i64* %storemerge2.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
%13 = inttoptr i64 %sv_0.0.reload to i64*
%14 = call i64* @memcpy(i64* %13, i64* nonnull %sv_1, i32 ptrtoint (i32* @gv_0 to i32))
%15 = call i64 @FUNC(i64 %sv_0.0.reload)
%16 = call i64 @FUNC(i64 40)
%17 = icmp eq i64 %1, %16
store i64 0, i64* %rax.0.reg2mem
br i1 %17, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_0.0.reg2mem, { 1, 0 }
uselistorder i32* %storemerge1.reg2mem, { 2, 0, 1 }
uselistorder i64* %storemerge2.reg2mem, { 2, 0, 1 }
uselistorder label LBL_3, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE197_Numeric_Truncation_Error__int_connect_socket_to_short_14-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 5
%2 = icmp eq i1 %1, false
%3 = select i1 %2, i64 4294967295, i64 122
%4 = call i64 @FUNC(i64 %3)
ret i64 %4
uselistorder i64 (i64)* @printShortLine, { 1, 0 }
uselistorder i64 122, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE416_Use_After_Free__malloc_free_int_17-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge24.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* %storemerge24.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%storemerge24.reload = load i64, i64* %storemerge24.reg2mem
%4 = mul i64 %storemerge24.reload, 4
%5 = add i64 %4, %1
%6 = inttoptr i64 %5 to i32*
store i32 5, i32* %6, align 4
%7 = add nuw nsw i64 %storemerge24.reload, 1
%exitcond6 = icmp eq i64 %7, 100
store i64 %7, i64* %storemerge24.reg2mem
br i1 %exitcond6, label LBL_3, label LBL_2
LBL_3:
call void @free(i64* %0)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64* %storemerge24.reg2mem, { 2, 0, 1 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE469_Use_of_Pointer_Subtraction_to_Determine_Size__char_17-bad
|
CWE469_Use_of_Pointer_Subtraction_to_Determine_Size__char_17_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = bitcast i64* %sv_1 to i8*
store i64 8246496015530812001, i64* %sv_1, align 8
store i64 8246496015530812001, i64* %sv_0, align 8
%2 = call i8* @strchr(i8* nonnull %1, i32 47)
%3 = icmp eq i8* %2, null
%4 = icmp eq i1 %3, false
br i1 %4, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 1)
unreachable
LBL_2:
%5 = ptrtoint i64* %sv_0 to i64
%6 = ptrtoint i8* %2 to i64
%7 = sub i64 %6, %5
%8 = and i64 %7, 4294967295
%9 = call i64 @FUNC(i64 %8)
%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* %2, { 1, 0 }
uselistorder i64* %sv_1, { 1, 0 }
uselistorder i64 8246496015530812001, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_listen_socket_snprintf_12-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)
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
%5 = call i32 @strlen(i8* nonnull %1)
%6 = sext i32 %5 to i64
%7 = call i32 @socket(i32 2, i32 1, i32 6)
%8 = icmp eq i32 %7, -1
br i1 %4, label LBL_12, label LBL_1
LBL_1:
br i1 %8, label LBL_23, label LBL_2
LBL_2:
%9 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16)
store i64 2, i64* %sv_1, align 8
%10 = call i16 @htons(i16 27015)
%11 = bitcast i64* %sv_1 to %sockaddr*
%12 = call i32 @bind(i32 %7, %sockaddr* nonnull %11, i32 16)
%13 = icmp eq i32 %12, -1
br i1 %13, label LBL_10, label LBL_3
LBL_3:
%14 = call i32 @listen(i32 %7, i32 5)
%15 = icmp eq i32 %14, -1
br i1 %15, label LBL_10, label LBL_4
LBL_4:
%16 = call i32 @accept(i32 %7, %sockaddr* null, i32* null)
%17 = icmp eq i32 %16, -1
br i1 %17, label LBL_10, label LBL_5
LBL_5:
%18 = ptrtoint i64* %sv_2 to i64
%19 = add i64 %6, %18
%20 = inttoptr i64 %19 to i64*
%21 = sub i32 99, %5
%22 = call i32 @recv(i32 %16, 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 %7)
br label LBL_23
LBL_11:
%33 = call i32 @close(i32 %7)
%34 = call i32 @close(i32 %16)
br label LBL_23
LBL_12:
br i1 %8, label LBL_23, label LBL_13
LBL_13:
%35 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16)
store i64 2, i64* %sv_1, align 8
%36 = call i16 @htons(i16 27015)
%37 = bitcast i64* %sv_1 to %sockaddr*
%38 = call i32 @bind(i32 %7, %sockaddr* nonnull %37, i32 16)
%39 = icmp eq i32 %38, -1
br i1 %39, label LBL_21, label LBL_14
LBL_14:
%40 = call i32 @listen(i32 %7, i32 5)
%41 = icmp eq i32 %40, -1
br i1 %41, label LBL_21, label LBL_15
LBL_15:
%42 = call i32 @accept(i32 %7, %sockaddr* null, i32* null)
%43 = icmp eq i32 %42, -1
br i1 %43, label LBL_21, label LBL_16
LBL_16:
%44 = ptrtoint i64* %sv_2 to i64
%45 = add i64 %6, %44
%46 = inttoptr i64 %45 to i64*
%47 = sub i32 99, %5
%48 = call i32 @recv(i32 %42, i64* %46, i32 %47, i32 0)
%49 = add i32 %48, 1
%50 = icmp ult i32 %49, 2
br i1 %50, label LBL_22, label LBL_17
LBL_17:
%51 = sext i32 %48 to i64
%52 = add i64 %45, %51
%53 = inttoptr i64 %52 to i8*
store i8 0, i8* %53, align 1
%54 = call i8* @strchr(i8* nonnull %1, i32 13)
%55 = icmp eq i8* %54, null
br i1 %55, label LBL_19, label LBL_18
LBL_18:
store i8 0, i8* %54, align 1
br label LBL_19
LBL_19:
%56 = call i8* @strchr(i8* nonnull %1, i32 10)
%57 = icmp eq i8* %56, null
br i1 %57, label LBL_22, label LBL_20
LBL_20:
store i8 0, i8* %56, align 1
br label LBL_22
LBL_21:
%58 = call i32 @close(i32 %7)
br label LBL_23
LBL_22:
%59 = call i32 @close(i32 %7)
%60 = call i32 @close(i32 %42)
br label LBL_23
LBL_23:
%61 = call i64 @FUNC()
store i64 0, i64* %sv_0, align 8
%62 = bitcast i64* %sv_0 to i8*
%63 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %62, i32 99, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0), i64* nonnull %sv_2)
%64 = call i64 @FUNC(i64* nonnull %sv_0)
%65 = call i64 @FUNC(i64 40)
%66 = icmp eq i64 %0, %65
store i64 0, i64* %rax.0.reg2mem
br i1 %66, label LBL_25, label LBL_24
LBL_24:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_25
LBL_25:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %48, { 1, 0 }
uselistorder i32 %22, { 1, 0 }
uselistorder i1 %8, { 1, 0 }
uselistorder i32 %7, { 9, 0, 6, 7, 8, 2, 1, 5, 4, 3, 10 }
uselistorder i32 %5, { 1, 0, 2 }
uselistorder i8* %1, { 2, 3, 0, 1, 4 }
uselistorder i64* %sv_2, { 1, 0, 2, 3, 4 }
uselistorder i64* %sv_1, { 0, 4, 1, 2, 5, 3 }
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 -1, { 0, 1, 2, 4, 5, 6, 3 }
uselistorder label LBL_23, { 4, 2, 0, 5, 3, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE789_Uncontrolled_Mem_Alloc__malloc_char_rand_14-bad
|
CWE789_Uncontrolled_Mem_Alloc__malloc_char_rand_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%0 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%1 = icmp eq i32 %0, 5
%2 = icmp eq i1 %1, false
store i32 0, i32* %sv_0.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i32 @rand()
store i32 %3, i32* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%4 = load i32, i32* @gv_0, align 4
%5 = zext i32 %4 to i64
%6 = icmp eq i32 %4, 5
%7 = icmp eq i1 %6, false
store i64 %5, i64* %rax.0.reg2mem
br i1 %7, label LBL_8, label LBL_3
LBL_3:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%8 = icmp ult i32 %sv_0.0.reload, 6
br i1 %8, label LBL_7, label LBL_4
LBL_4:
%9 = call i64* @malloc(i32 %sv_0.0.reload)
%10 = icmp eq i64* %9, null
%11 = icmp eq i1 %10, false
br i1 %11, label LBL_6, label LBL_5
LBL_5:
call void @exit(i32 -1)
unreachable
LBL_6:
%12 = ptrtoint i64* %9 to i64
%13 = bitcast i64* %9 to i32*
store i32 1819043176, i32* %13, align 4
%14 = add i64 %12, 4
%15 = inttoptr i64 %14 to i16*
store i16 111, i16* %15, align 2
%16 = call i64 @FUNC(i64 %12)
call void @free(i64* %9)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_8
LBL_7:
%17 = call i64 @FUNC(i64 ptrtoint ([51 x i8]* @gv_1 to i64))
store i64 %17, 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* %9, { 0, 1, 3, 2 }
uselistorder i64* %rax.0.reg2mem, { 0, 2, 1, 3 }
}
|
1
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_ncat_02-bad
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_ncat_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 100)
%2 = icmp eq i64* %1, null
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%4 = bitcast i64* %1 to i8*
%5 = call i64* @memset(i64* %1, i32 65, i32 99)
%6 = ptrtoint i64* %1 to i64
%7 = add i64 %6, 99
%8 = inttoptr i64 %7 to i8*
store i8 0, i8* %8, align 1
store i64 0, i64* %sv_0, align 8
%9 = call i32 @strlen(i8* %4)
%10 = bitcast i64* %sv_0 to i8*
%11 = call i8* @strncat(i8* nonnull %10, i8* %4, i32 %9)
%12 = call i64 @FUNC(i64 %6)
call void @free(i64* %1)
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %4, { 1, 0 }
uselistorder i64* %1, { 0, 1, 2, 4, 3 }
}
|
1
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__CWE129_rand_14-bad
|
CWE126_Buffer_Overread__CWE129_rand_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 -1, i32* %sv_0.0.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i32 @rand()
%5 = urem i32 %4, 2
%6 = icmp eq i32 %5, 0
%7 = call i32 @rand()
%8 = 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 i32 %storemerge.in, i32* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%15 = load i32, i32* @gv_0, align 4
%16 = icmp eq i32 %15, 5
%17 = icmp eq i1 %16, false
br i1 %17, label LBL_6, label LBL_3
LBL_3:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%18 = icmp slt i32 %sv_0.0.reload, 0
br i1 %18, label LBL_5, label LBL_4
LBL_4:
%19 = ptrtoint i64* %sv_1 to i64
%20 = sext i32 %sv_0.0.reload to i64
%21 = mul i64 %20, 4
%22 = add i64 %19, -64
%23 = add i64 %22, %21
%24 = inttoptr i64 %23 to i32*
%25 = load i32, i32* %24, align 4
%26 = zext i32 %25 to i64
%27 = call i64 @FUNC(i64 %26)
br label LBL_6
LBL_5:
%28 = call i64 @FUNC(i64 ptrtoint ([31 x i8]* @gv_1 to i64))
br label LBL_6
LBL_6:
%29 = call i64 @FUNC(i64 40)
%30 = icmp eq i64 %0, %29
store i64 0, i64* %rax.0.reg2mem
br i1 %30, 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
}
|
1
|
juliet-test-suite-c
|
CWE590_Free_Memory_Not_on_Heap__free_struct_alloca_32-bad
|
CWE590_Free_Memory_Not_on_Heap__free_struct_alloca_32_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = ptrtoint i64* %sv_0 to i64
%1 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%2 = add i64 %0, 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 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)))
%3 = and i64 %2, -16
store i64 0, i64* %storemerge1.reg2mem
br label LBL_1
LBL_1:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%4 = mul i64 %storemerge1.reload, 8
%5 = add i64 %4, %3
%6 = inttoptr i64 %5 to i32*
store i32 1, i32* %6, align 8
%7 = or i64 %5, 4
%8 = inttoptr i64 %7 to i32*
store i32 1, i32* %8, align 4
%9 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %9, 100
store i64 %9, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_2, label LBL_1
LBL_2:
store i64 %3, i64* %sv_0, align 8
%10 = call i64 @FUNC(i64 %3)
%11 = inttoptr i64 %3 to i64*
call void @free(i64* %11)
%12 = call i64 @FUNC(i64 40)
%13 = icmp eq i64 %1, %12
store i64 0, i64* %rax.0.reg2mem
br i1 %13, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %3, { 2, 1, 3, 0 }
uselistorder i64* %storemerge1.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
|
CWE400_Resource_Exhaustion__rand_for_loop_05-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge3.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 -1, 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 = mul i32 %5, 1073741824
%7 = call i32 @rand()
%8 = mul i32 %7, 32768
%9 = xor i32 %8, %6
%10 = call i32 @rand()
%11 = xor i32 %9, %10
%12 = sext i1 %4 to i32
%storemerge1.in = xor i32 %11, %12
store i32 %storemerge1.in, i32* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%13 = load i32, i32* @gv_1, align 4
%14 = icmp eq i32 %13, 0
br i1 %14, label LBL_4, label LBL_3
LBL_3:
%15 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64))
store i64 %15, i64* %rax.0.reg2mem
br label LBL_7
LBL_4:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%sv_0.0.off = add i32 %sv_0.0.reload, -1
%16 = icmp ugt i32 %sv_0.0.off, 19
store i64 0, i64* %rax.0.reg2mem
br i1 %16, label LBL_7, label LBL_5
LBL_5:
%17 = sext i32 %sv_0.0.reload to i64
store i64 0, i64* %storemerge3.reg2mem
br label LBL_6
LBL_6:
%storemerge3.reload = load i64, i64* %storemerge3.reg2mem
%18 = call i64 @FUNC(i64 ptrtoint ([6 x i8]* @gv_3 to i64))
%19 = add nuw i64 %storemerge3.reload, 1
%20 = icmp ult i64 %19, %17
store i64 %19, i64* %storemerge3.reg2mem
store i64 %17, i64* %rax.0.reg2mem
br i1 %20, label LBL_6, label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %storemerge3.reg2mem, { 1, 0, 2 }
uselistorder i64* %rax.0.reg2mem, { 0, 1, 3, 2 }
uselistorder label LBL_6, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_alloca_memcpy_11-bad
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_alloca_memcpy_11_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
%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_1 to i64
%5 = add i64 %4, -401
%6 = and i64 %5, -16
store i64 %6, i64* %sv_1, align 8
br label LBL_2
LBL_2:
%7 = ptrtoint i64* %sv_2 to i64
store i64 0, i64* %storemerge1.reg2mem
br label LBL_3
LBL_3:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%8 = mul i64 %storemerge1.reload, 8
%9 = add i64 %8, %7
%10 = add i64 %9, -816
%11 = inttoptr i64 %10 to i32*
store i32 0, i32* %11, align 8
%12 = add i64 %9, -812
%13 = inttoptr i64 %12 to i32*
store i32 0, i32* %13, align 4
%14 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %14, 100
store i64 %14, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
%15 = load i64, i64* %sv_1, align 8
%16 = inttoptr i64 %15 to i64*
%17 = call i64* @memcpy(i64* %16, i64* nonnull %sv_0, i32 ptrtoint (i32* @gv_0 to i32))
%18 = load i64, i64* %sv_1, align 8
%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_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_connect_socket_popen_02-bad
|
CWE78_OS_Command_Injection__char_connect_socket_popen_02_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 2126700, i64* %sv_1, align 8
%1 = bitcast i64* %sv_1 to i8*
%2 = call i32 @strlen(i8* nonnull %1)
%3 = call i32 @socket(i32 2, i32 1, i32 6)
%cond = icmp eq i32 %3, -1
br i1 %cond, label LBL_8, label LBL_1
LBL_1:
%4 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16)
store i64 2, i64* %sv_0, align 8
%5 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%6 = call i16 @htons(i16 27015)
%7 = bitcast i64* %sv_0 to %sockaddr*
%8 = call i32 @connect(i32 %3, %sockaddr* nonnull %7, i32 16)
%9 = icmp eq i32 %8, -1
br i1 %9, label LBL_7, label LBL_2
LBL_2:
%10 = sext i32 %2 to i64
%11 = ptrtoint i64* %sv_1 to i64
%12 = add i64 %10, %11
%13 = inttoptr i64 %12 to i64*
%14 = sub i32 99, %2
%15 = call i32 @recv(i32 %3, i64* %13, i32 %14, i32 0)
%16 = add i32 %15, 1
%17 = icmp ult i32 %16, 2
br i1 %17, label LBL_7, label LBL_3
LBL_3:
%18 = sext i32 %15 to i64
%19 = add i64 %12, %18
%20 = inttoptr i64 %19 to i8*
store i8 0, i8* %20, align 1
%21 = call i8* @strchr(i8* nonnull %1, i32 13)
%22 = icmp eq i8* %21, null
br i1 %22, label LBL_5, label LBL_4
LBL_4:
store i8 0, i8* %21, align 1
br label LBL_5
LBL_5:
%23 = call i8* @strchr(i8* nonnull %1, i32 10)
%24 = icmp eq i8* %23, null
br i1 %24, label LBL_7, label LBL_6
LBL_6:
store i8 0, i8* %23, align 1
br label LBL_7
LBL_7:
%25 = call i32 @close(i32 %3)
br label LBL_8
LBL_8:
%26 = call %_IO_FILE* @popen(i8* nonnull %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_1, i64 0, i64 0))
%27 = icmp eq %_IO_FILE* %26, null
br i1 %27, label LBL_10, label LBL_9
LBL_9:
%28 = call i32 @pclose(%_IO_FILE* nonnull %26)
br label LBL_10
LBL_10:
%29 = call i64 @FUNC(i64 40)
%30 = icmp eq i64 %0, %29
store i64 0, i64* %rax.0.reg2mem
br i1 %30, label LBL_12, label LBL_11
LBL_11:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_12
LBL_12:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %15, { 1, 0 }
uselistorder i32 %3, { 3, 1, 2, 0 }
uselistorder i8* %1, { 2, 0, 1, 3 }
uselistorder i64* %sv_0, { 0, 2, 1 }
uselistorder i8* (i8*, i32)* @strchr, { 1, 0, 2 }
uselistorder i32 -1, { 1, 0 }
uselistorder label LBL_8, { 1, 0 }
uselistorder label LBL_7, { 2, 1, 0, 3 }
}
|
1
|
juliet-test-suite-c
|
CWE415_Double_Free__malloc_free_char_10-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
store i64 0, i64* %rax.0.reg2mem
br i1 %1, label LBL_5, label LBL_1
LBL_1:
%2 = call i64* @malloc(i32 100)
%3 = icmp eq i64* %2, null
%4 = icmp eq i1 %3, false
br i1 %4, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%.pr = load i32, i32* @gv_0, align 4
%5 = icmp eq i32 %.pr, 0
store i64 0, i64* %rax.0.reg2mem
br i1 %5, label LBL_5, label LBL_4
LBL_4:
call void @free(i64* %2)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %rax.0.reg2mem, { 0, 2, 3, 1 }
uselistorder void (i64*)* @free, { 3, 2, 1, 0, 4 }
uselistorder void (i32)* @exit, { 0, 3, 2, 1, 4 }
uselistorder i64* (i32)* @malloc, { 3, 0, 2, 1, 4 }
uselistorder i32* @gv_0, { 0, 4, 3, 2, 1 }
uselistorder label LBL_5, { 1, 2, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_console_snprintf_12-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = bitcast i64* %sv_1 to i8*
%2 = call i64 @FUNC()
%3 = ptrtoint i64* %sv_1 to i64
store i64 8247343692658534758, i64* %sv_1, align 8
%4 = add i64 %3, 8
%5 = inttoptr i64 %4 to i64*
store i64 32777976880262761, i64* %5, align 8
%6 = call i64 @FUNC()
store i64 0, i64* %sv_0, align 8
%7 = bitcast i64* %sv_0 to i8*
%8 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %7, i32 99, i8* nonnull %1)
%9 = ptrtoint i64* %sv_0 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_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, { 1, 0, 2 }
uselistorder i32 (i8*, i32, i8*, ...)* @snprintf, { 1, 0, 2 }
uselistorder i64 ()* @globalReturnsTrueOrFalse, { 3, 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_file_fprintf_08-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_6, 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 = sub nsw i64 100, %6
%8 = icmp ult i64 %7, 2
br i1 %8, label LBL_6, label LBL_2
LBL_2:
%9 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_1, i64 0, i64 0))
%10 = icmp eq %_IO_FILE* %9, null
br i1 %10, label LBL_6, label LBL_3
LBL_3:
%11 = sub i32 100, %5
%12 = ptrtoint i64* %sv_0 to i64
%13 = add i64 %6, %12
%14 = inttoptr i64 %13 to i8*
%15 = call i8* @fgets(i8* %14, i32 %11, %_IO_FILE* nonnull %9)
%16 = icmp eq i8* %15, null
%17 = icmp eq i1 %16, false
br i1 %17, label LBL_5, label LBL_4
LBL_4:
%18 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 to i64))
store i8 0, i8* %14, align 1
br label LBL_5
LBL_5:
%19 = call i32 @fclose(%_IO_FILE* nonnull %9)
br label LBL_6
LBL_6:
%20 = call i64 @FUNC()
%21 = trunc i64 %20 to i32
%22 = icmp eq i32 %21, 0
br i1 %22, label LBL_8, label LBL_7
LBL_7:
%23 = load %_IO_FILE*, %_IO_FILE** @gv_3, align 8
%24 = call i32 (%_IO_FILE*, i8*, ...) @fprintf(%_IO_FILE* %23, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_4, i64 0, i64 0), i64* nonnull %sv_0)
br label LBL_8
LBL_8:
%25 = call i64 @FUNC(i64 40)
%26 = icmp eq i64 %0, %25
store i64 0, i64* %rax.0.reg2mem
br i1 %26, 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 (%_IO_FILE*)* @fclose, { 1, 0, 2 }
uselistorder i8 0, { 1, 2, 3, 0 }
uselistorder i8* (i8*, i32, %_IO_FILE*)* @fgets, { 1, 0, 2 }
uselistorder %_IO_FILE* (i8*, i8*)* @fopen, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__struct_realloc_01-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64* @realloc(i64* null, i32 8)
%1 = ptrtoint i64* %0 to i64
%2 = icmp eq i64* %0, null
store i64 %1, i64* %rax.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = bitcast i64* %0 to i32*
store i32 1, i32* %3, align 4
%4 = add i64 %1, 4
%5 = inttoptr i64 %4 to i32*
store i32 1, i32* %5, align 4
%6 = call i64 @FUNC(i64 %1)
call void @free(i64* nonnull %0)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %1, { 1, 2, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_int_loop_17-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge3.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @malloc(i32 400)
%2 = icmp eq i64* %1, null
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%4 = ptrtoint i64* %sv_1 to i64
%5 = ptrtoint i64* %1 to i64
%6 = bitcast i64* %sv_0 to i8*
call void @FUNC(i8* nonnull %6, i64 0, i64 50)
%7 = add i64 %4, -416
store i64 0, i64* %storemerge3.reg2mem
br label LBL_3
LBL_3:
%storemerge3.reload = load i64, i64* %storemerge3.reg2mem
%8 = mul i64 %storemerge3.reload, 4
%9 = add i64 %8, %5
%10 = add i64 %7, %8
%11 = inttoptr i64 %10 to i32*
%12 = load i32, i32* %11, align 4
%13 = inttoptr i64 %9 to i32*
store i32 %12, i32* %13, align 4
%14 = add nuw nsw i64 %storemerge3.reload, 1
%exitcond = icmp eq i64 %14, 100
store i64 %14, i64* %storemerge3.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
%15 = bitcast i64* %1 to i32*
%16 = load i32, i32* %15, align 4
%17 = zext i32 %16 to i64
%18 = call i64 @FUNC(i64 %17)
call void @free(i64* %1)
%19 = call i64 @FUNC(i64 40)
%20 = icmp eq i64 %0, %19
store i64 0, i64* %rax.0.reg2mem
br i1 %20, label LBL_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* %storemerge3.reg2mem, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE510_Trapdoor__network_connection_14-bad
|
CWE510_Trapdoor__network_connection_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_3, label LBL_1
LBL_1:
%4 = call i32 @socket(i32 2, i32 1, i32 6)
%cond = icmp eq i32 %4, -1
br i1 %cond, label LBL_3, label LBL_2
LBL_2:
%5 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16)
store i64 2, i64* %sv_0, align 8
%6 = call i32 @inet_addr(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @gv_0, i64 0, i64 0))
%7 = call i16 @htons(i16 80)
%8 = bitcast i64* %sv_0 to %sockaddr*
%9 = call i32 @connect(i32 %4, %sockaddr* nonnull %8, i32 16)
%10 = call i32 @close(i32 %4)
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 i32 %4, { 2, 1, 0 }
uselistorder i64* %sv_0, { 0, 2, 1 }
uselistorder label LBL_3, { 1, 0, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_alloca_loop_14-good
|
goodG2B1
|
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
%0 = ptrtoint i64* %sv_1 to i64
%1 = call i64 @FUNC(i64 40)
%2 = add i64 %0, -97
%3 = and i64 %2, -16
%4 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%5 = icmp eq i32 %4, 5
br i1 %5, label LBL_2, label LBL_1
LBL_1:
%6 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
br label LBL_3
LBL_2:
%7 = inttoptr i64 %3 to i64*
%8 = call i64* @memset(i64* %7, i32 65, i32 49)
%9 = add i64 %3, 49
%10 = inttoptr i64 %9 to i8*
store i8 0, i8* %10, align 1
br label LBL_3
LBL_3:
%11 = inttoptr i64 %3 to i8*
store i64 0, i64* %sv_0, align 8
%12 = call i32 @strlen(i8* %11)
store i64 0, i64* %sv_1, align 8
%13 = icmp eq i32 %12, 0
br i1 %13, label LBL_6, label LBL_4
LBL_4:
%14 = sext i32 %12 to i64
%15 = ptrtoint i64* %sv_0 to i64
store i64 0, i64* %storemerge2.reg2mem
br label LBL_5
LBL_5:
%storemerge2.reload = load i64, i64* %storemerge2.reg2mem
%16 = add i64 %storemerge2.reload, %3
%17 = inttoptr i64 %16 to i8*
%18 = load i8, i8* %17, align 1
%19 = add i64 %storemerge2.reload, %15
%20 = inttoptr i64 %19 to i8*
store i8 %18, i8* %20, align 1
%21 = load i64, i64* %sv_1, align 8
%22 = add i64 %21, 1
store i64 %22, i64* %sv_1, align 8
%23 = icmp ult i64 %22, %14
store i64 %22, i64* %storemerge2.reg2mem
br i1 %23, label LBL_5, label LBL_6
LBL_6:
%24 = call i64 @FUNC(i64 %3)
%25 = call i64 @FUNC(i64 40)
%26 = icmp eq i64 %1, %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 i64 %22, { 0, 2, 1 }
uselistorder i64 %storemerge2.reload, { 1, 0 }
uselistorder i32 %12, { 1, 0 }
uselistorder i64 %3, { 2, 0, 4, 3, 1 }
uselistorder i64* %sv_1, { 1, 2, 0, 3 }
uselistorder i64* %storemerge2.reg2mem, { 1, 0, 2 }
uselistorder label LBL_5, { 1, 0 }
}
|
0
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.