dataset
stringclasses 1
value | file
stringlengths 27
83
| fun_name
stringlengths 7
83
| llvm_ir_function
stringlengths 61
8.29k
| label
stringclasses 2
values |
|---|---|---|---|---|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__CWE839_connect_socket_06-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%indvars.iv.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i32 @socket(i32 2, i32 1, i32 6)
%2 = icmp eq i32 %1, -1
br i1 %2, label LBL_1, label LBL_2
LBL_1:
store i64 0, i64* %sv_1, align 8
br label LBL_8
LBL_2:
%3 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16)
store i64 2, i64* %sv_1, align 8
%4 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%5 = call i16 @htons(i16 27015)
%6 = bitcast i64* %sv_1 to %sockaddr*
%7 = call i32 @connect(i32 %1, %sockaddr* nonnull %6, i32 16)
%8 = icmp eq i32 %7, -1
br i1 %8, label LBL_17, label LBL_3
LBL_3:
%9 = call i32 @recv(i32 %1, i64* nonnull %sv_0, i32 13, i32 0)
%10 = add i32 %9, 1
%11 = icmp ult i32 %10, 2
br i1 %11, label LBL_17, label LBL_5
LBL_4:
%12 = call i32 @close(i32 %1)
store i64 0, i64* %sv_1, align 8
br label LBL_8
LBL_5:
%13 = ptrtoint i64* %sv_2 to i64
%14 = sext i32 %9 to i64
%15 = add i64 %13, -22
%16 = add i64 %15, %14
%17 = inttoptr i64 %16 to i8*
store i8 0, i8* %17, align 1
%18 = bitcast i64* %sv_0 to i8*
%19 = call i32 @atoi(i8* nonnull %18)
%20 = call i32 @close(i32 %1)
store i64 0, i64* %sv_1, align 8
%21 = icmp ugt i32 %19, 9
br i1 %21, label LBL_8, label LBL_6
LBL_6:
%22 = sext i32 %19 to i64
%23 = mul i64 %22, 4
%24 = add i64 %13, -64
%25 = add i64 %23, %24
%26 = inttoptr i64 %25 to i32*
store i32 1, i32* %26, align 4
store i64 0, i64* %indvars.iv.reg2mem
br label LBL_7
LBL_7:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%27 = mul i64 %indvars.iv.reload, 4
%28 = add i64 %27, %24
%29 = inttoptr i64 %28 to i32*
%30 = load i32, i32* %29, align 4
%31 = zext i32 %30 to i64
%32 = call i64 @FUNC(i64 %31)
%indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1
%exitcond = icmp eq i64 %indvars.iv.next, 10
store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem
br i1 %exitcond, label LBL_9, label LBL_7
LBL_8:
%33 = call i64 @FUNC(i64 ptrtoint ([36 x i8]* @gv_1 to i64))
br label LBL_9
LBL_9:
%34 = call i64 @FUNC(i64 40)
%35 = icmp eq i64 %0, %34
store i64 0, i64* %rax.0.reg2mem
br i1 %35, label LBL_11, label LBL_10
LBL_10:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_11
LBL_11:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %19, { 1, 0 }
uselistorder i64 %13, { 1, 0 }
uselistorder i32 %9, { 1, 0 }
uselistorder i32 %1, { 3, 0, 1, 2, 4 }
uselistorder i64* %sv_1, { 4, 0, 2, 5, 3, 1 }
uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 }
uselistorder i32 (i8*)* @atoi, { 1, 0, 2 }
uselistorder i32 (i32)* @close, { 3, 0, 2, 1, 4 }
uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32)* @connect, { 1, 0, 2 }
uselistorder i16 (i16)* @htons, { 1, 0, 2 }
uselistorder i32 (i8*)* @inet_addr, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder label LBL_9, { 1, 0 }
uselistorder label LBL_8, { 2, 0, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__char_rand_postdec_07-bad
|
CWE191_Integer_Underflow__char_rand_postdec_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 31, i64* %sv_0.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i32 @rand()
%4 = urem i32 %3, 2
%5 = icmp eq i32 %4, 0
%6 = call i32 @rand()
%7 = call i32 @rand()
%8 = call i32 @rand()
%9 = sext i1 %5 to i32
%storemerge = xor i32 %8, %9
%sext = mul i32 %storemerge, 16777216
%phitmp = add i32 %sext, -16777216
%phitmp3 = ashr exact i32 %phitmp, 24
%phitmp4 = zext i32 %phitmp3 to i64
%.pre = load i32, i32* @gv_0, align 4
store i32 %.pre, i32* %.reg2mem
store i64 %phitmp4, i64* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%.reload = load i32, i32* %.reg2mem
%10 = zext i32 %.reload to i64
%11 = icmp eq i32 %.reload, 5
%12 = icmp eq i1 %11, false
store i64 %10, i64* %rax.0.reg2mem
br i1 %12, label LBL_4, label LBL_3
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%13 = call i64 @FUNC(i64 %sv_0.0.reload)
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
}
|
1
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__char_alloca_ncpy_14-bad
|
CWE124_Buffer_Underwrite__char_alloca_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
%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 i64*
%5 = call i64* @memset(i64* %4, i32 65, i32 99)
%6 = add i64 %3, 99
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 1
%8 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%9 = icmp eq i32 %8, 5
%10 = icmp eq i1 %9, false
br i1 %10, label LBL_2, label LBL_1
LBL_1:
%11 = add i64 %3, -8
%12 = inttoptr i64 %11 to i8*
store i8* %12, i8** %sv_1, align 8
br label LBL_2
LBL_2:
%13 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%14 = load i8*, i8** %sv_1, align 8
%15 = bitcast i64* %sv_0 to i8*
%16 = call i8* @strncpy(i8* %14, i8* nonnull %15, i32 99)
%17 = load i8*, i8** %sv_1, align 8
%18 = ptrtoint i8* %17 to i64
%19 = add i64 %18, 99
%20 = inttoptr i64 %19 to i8*
store i8 0, i8* %20, align 1
%21 = load i8*, i8** %sv_1, align 8
%22 = ptrtoint i8* %21 to i64
%23 = call i64 @FUNC(i64 %22)
%24 = call i64 @FUNC(i64 40)
%25 = icmp eq i64 %1, %24
store i64 0, i64* %rax.0.reg2mem
br i1 %25, 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, 2, 1 }
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__int64_t_fscanf_sub_07-bad
|
CWE191_Integer_Underflow__int64_t_fscanf_sub_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.reg2mem = alloca i32
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 %1, i32* %.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_2, i64 0, i64 0), i64* nonnull %sv_0)
%.pre = load i32, i32* @gv_0, align 4
store i32 %.pre, i32* %.reg2mem
br label LBL_2
LBL_2:
%.reload = load i32, i32* %.reg2mem
%6 = icmp eq i32 %.reload, 5
%7 = icmp eq i1 %6, false
br i1 %7, label LBL_4, label LBL_3
LBL_3:
%8 = load i64, i64* %sv_0, align 8
%9 = add i64 %8, -1
%10 = call i64 @FUNC(i64 %9)
br label LBL_4
LBL_4:
%11 = call i64 @FUNC(i64 40)
%12 = icmp eq i64 %0, %11
store i64 0, i64* %rax.0.reg2mem
br i1 %12, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_0, { 1, 0, 2 }
uselistorder i32* %.reg2mem, { 0, 2, 1 }
uselistorder %_IO_FILE** @gv_1, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE194_Unexpected_Sign_Extension__connect_socket_memcpy_13-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 8360 to i32*), align 8
%2 = icmp eq i32 %1, 5
store i32 99, i32* %sv_0.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
store i32 0, i32* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%4 = ptrtoint i64* %sv_3 to i64
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
store i64 0, i64* %sv_2, align 8
%5 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
%6 = call i64* @memcpy(i64* nonnull %sv_2, i64* nonnull %sv_1, i32 %sv_0.0.reload)
%7 = zext i32 %sv_0.0.reload to i64
%8 = add i64 %4, -112
%9 = add i64 %8, %7
%10 = inttoptr i64 %9 to i8*
store i8 0, i8* %10, align 1
%11 = ptrtoint i64* %sv_2 to i64
%12 = call i64 @FUNC(i64 %11)
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %sv_0.0.reload, { 1, 0 }
uselistorder i64* %sv_2, { 1, 0, 2 }
uselistorder i32* %sv_0.0.reg2mem, { 0, 2, 1 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE789_Uncontrolled_Mem_Alloc__malloc_char_fscanf_32-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = 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 = trunc i64 %3 to i32
%5 = icmp ugt i64 %3, 5
%6 = icmp ult i32 %4, 100
%or.cond = icmp eq i1 %5, %6
br i1 %or.cond, label LBL_1, label LBL_4
LBL_1:
%7 = call i64* @malloc(i32 %4)
%8 = icmp eq i64* %7, null
%9 = icmp eq i1 %8, false
br i1 %9, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%10 = ptrtoint i64* %7 to i64
%11 = bitcast i64* %7 to i32*
store i32 1819043176, i32* %11, align 4
%12 = add i64 %10, 4
%13 = inttoptr i64 %12 to i16*
store i16 111, i16* %13, align 2
%14 = call i64 @FUNC(i64 %10)
call void @free(i64* %7)
br label LBL_5
LBL_4:
%15 = call i64 @FUNC(i64 ptrtoint ([64 x i8]* @gv_2 to i64))
br label LBL_5
LBL_5:
%16 = call i64 @FUNC(i64 40)
%17 = icmp eq i64 %0, %16
store i64 0, i64* %rax.0.reg2mem
br i1 %17, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %7, { 0, 1, 3, 2 }
uselistorder i64* %sv_0, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_connect_socket_snprintf_02-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_2, align 8
%1 = bitcast i64* %sv_2 to i8*
%2 = call i32 @strlen(i8* nonnull %1)
%3 = call i32 @socket(i32 2, i32 1, i32 6)
%cond = icmp eq i32 %3, -1
br i1 %cond, label LBL_8, label LBL_1
LBL_1:
%4 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16)
store i64 2, i64* %sv_1, 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_1 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_2 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:
store i64 0, i64* %sv_0, align 8
%26 = bitcast i64* %sv_0 to i8*
%27 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %26, i32 99, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_2)
%28 = call i64 @FUNC(i64* nonnull %sv_0)
%29 = call i64 @FUNC(i64 40)
%30 = icmp eq i64 %0, %29
store i64 0, i64* %rax.0.reg2mem
br i1 %30, label LBL_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 %15, { 1, 0 }
uselistorder i32 %3, { 3, 1, 2, 0 }
uselistorder i64* %sv_1, { 0, 2, 1 }
uselistorder i32 (i32)* @close, { 1, 0, 2 }
uselistorder i8* (i8*, i32)* @strchr, { 3, 2, 1, 0, 4 }
uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32)* @connect, { 1, 0, 2 }
uselistorder i16 (i16)* @htons, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder i32 -1, { 2, 0, 3, 1 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
uselistorder label LBL_8, { 1, 0 }
uselistorder label LBL_7, { 2, 1, 0, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_dest_char_cat_11-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i8*
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
store i8* null, i8** %sv_0.0.reg2mem
br label LBL_5
LBL_2:
%5 = call i64* @malloc(i32 100)
%6 = icmp eq i64* %5, null
%7 = icmp eq i1 %6, false
br i1 %7, label LBL_4, label LBL_3
LBL_3:
call void @exit(i32 -1)
unreachable
LBL_4:
%8 = bitcast i64* %5 to i8*
store i8 0, i8* %8, align 1
store i8* %8, i8** %sv_0.0.reg2mem
br label LBL_5
LBL_5:
%sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem
%9 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%10 = bitcast i64* %sv_1 to i8*
%11 = call i8* @strcat(i8* %sv_0.0.reload, i8* nonnull %10)
%12 = ptrtoint i8* %sv_0.0.reload to i64
%13 = call i64 @FUNC(i64 %12)
%14 = bitcast i8* %sv_0.0.reload to i64*
call void @free(i64* %14)
%15 = call i64 @FUNC(i64 40)
%16 = icmp eq i64 %0, %15
store i64 0, i64* %rax.0.reg2mem
br i1 %16, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %5, { 1, 0 }
uselistorder i8** %sv_0.0.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE789_Uncontrolled_Mem_Alloc__malloc_char_listen_socket_17-bad
|
CWE789_Uncontrolled_Mem_Alloc__malloc_char_listen_socket_17_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i32 @socket(i32 2, i32 1, i32 6)
%2 = icmp eq i32 %1, -1
br i1 %2, label LBL_11, label LBL_1
LBL_1:
%3 = bitcast i64* %sv_2 to %sockaddr*
%4 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%5 = call i16 @htons(i16 27015)
%6 = call i32 @bind(i32 %1, %sockaddr* nonnull %3, i32 16)
%7 = icmp eq i32 %6, -1
br i1 %7, label LBL_6, label LBL_2
LBL_2:
%8 = call i32 @listen(i32 %1, i32 5)
%9 = icmp eq i32 %8, -1
br i1 %9, label LBL_6, label LBL_3
LBL_3:
%10 = call i32 @accept(i32 %1, %sockaddr* null, i32* null)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_6, label LBL_4
LBL_4:
%12 = call i32 @recv(i32 %10, i64* nonnull %sv_1, i32 25, i32 0)
%13 = add i32 %12, 1
%14 = icmp ult i32 %13, 2
store i32 0, i32* %sv_0.0.ph.reg2mem
br i1 %14, label LBL_7, label LBL_5
LBL_5:
%15 = ptrtoint i64* %sv_3 to i64
%16 = add i64 %15, -48
%17 = bitcast i64* %sv_1 to i8*
%18 = sext i32 %12 to i64
%19 = add i64 %16, %18
%20 = inttoptr i64 %19 to i8*
store i8 0, i8* %20, align 1
%21 = call i32 @strtoul(i8* nonnull %17, i8** null, i32 0)
store i32 %21, i32* %sv_0.0.ph.reg2mem
br label LBL_7
LBL_6:
%22 = call i32 @close(i32 %1)
br label LBL_11
LBL_7:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%23 = call i32 @close(i32 %1)
%24 = call i32 @close(i32 %10)
%25 = icmp ult i32 %sv_0.0.ph.reload, 6
br i1 %25, label LBL_11, label LBL_8
LBL_8:
%26 = call i64* @malloc(i32 %sv_0.0.ph.reload)
%27 = icmp eq i64* %26, null
%28 = icmp eq i1 %27, false
br i1 %28, label LBL_10, label LBL_9
LBL_9:
call void @exit(i32 -1)
unreachable
LBL_10:
%29 = ptrtoint i64* %26 to i64
%30 = bitcast i64* %26 to i32*
store i32 1819043176, i32* %30, align 4
%31 = add i64 %29, 4
%32 = inttoptr i64 %31 to i16*
store i16 111, i16* %32, align 2
%33 = call i64 @FUNC(i64 %29)
call void @free(i64* %26)
br label LBL_12
LBL_11:
%34 = call i64 @FUNC(i64 ptrtoint ([51 x i8]* @gv_0 to i64))
br label LBL_12
LBL_12:
%35 = call i64 @FUNC(i64 40)
%36 = icmp eq i64 %0, %35
store i64 0, i64* %rax.0.reg2mem
br i1 %36, label LBL_14, label LBL_13
LBL_13:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_14
LBL_14:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %26, { 0, 1, 3, 2 }
uselistorder i32 %12, { 1, 0 }
uselistorder i32 %1, { 4, 0, 1, 2, 3, 5 }
uselistorder i64* %sv_2, { 2, 1, 0 }
uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 1 }
uselistorder i32 (i32)* @close, { 2, 1, 0, 3 }
uselistorder i32 -1, { 4, 0, 1, 2, 3 }
uselistorder label LBL_12, { 1, 0 }
uselistorder label LBL_11, { 2, 1, 0 }
uselistorder label LBL_7, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_int64_t_declare_memmove_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
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
br label LBL_3
LBL_2:
%5 = ptrtoint i64* %sv_2 to i64
store i64 %5, i64* %sv_0.0.reg2mem
br label LBL_3
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%6 = bitcast i64* %sv_1 to i8*
call void @FUNC(i8* nonnull %6, i64 0, i64 100)
%7 = inttoptr i64 %sv_0.0.reload to i64*
%8 = call i64* @memmove(i64* %7, i64* nonnull %sv_1, i32 ptrtoint (i32* @gv_1 to i32))
%9 = load i64, i64* %7, align 8
%10 = call i64 @FUNC(i64 %9)
%11 = call i64 @FUNC(i64 40)
%12 = icmp eq i64 %0, %11
store i64 0, i64* %rax.0.reg2mem
br i1 %12, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
0
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__struct_array_malloc_partial_init_05-bad
|
CWE457_Use_of_Uninitialized_Variable__struct_array_malloc_partial_init_05_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.1.reg2mem = alloca i64
%indvars.iv.reg2mem = alloca i64
%indvars.iv5.reg2mem = alloca i64
%0 = call i64* @malloc(i32 80)
%1 = icmp eq i64* %0, null
%2 = icmp eq i1 %1, false
br i1 %2, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%3 = ptrtoint i64* %0 to i64
%4 = load i32, i32* @gv_0, align 4
%5 = icmp eq i32 %4, 0
store i64 0, i64* %indvars.iv5.reg2mem
store i64 0, i64* %rax.1.reg2mem
br i1 %5, label LBL_6, label LBL_3
LBL_3:
%indvars.iv5.reload = load i64, i64* %indvars.iv5.reg2mem
%6 = mul i64 %indvars.iv5.reload, 8
%7 = add i64 %6, %3
%8 = inttoptr i64 %7 to i32*
%9 = trunc i64 %indvars.iv5.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.next6 = add nuw nsw i64 %indvars.iv5.reload, 1
%exitcond7 = icmp eq i64 %indvars.iv.next6, 5
store i64 %indvars.iv.next6, i64* %indvars.iv5.reg2mem
br i1 %exitcond7, 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.iv.reg2mem
store i64 0, i64* %rax.1.reg2mem
br i1 %12, label LBL_6, label LBL_5
LBL_5:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%13 = mul i64 %indvars.iv.reload, 8
%14 = add i64 %13, %3
%15 = inttoptr i64 %14 to i32*
%16 = load i32, i32* %15, align 4
%17 = zext i32 %16 to i64
%18 = call i64 @FUNC(i64 %17)
%19 = add i64 %14, 4
%20 = inttoptr i64 %19 to i32*
%21 = load i32, i32* %20, align 4
%22 = zext i32 %21 to i64
%23 = call i64 @FUNC(i64 %22)
%indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1
%exitcond = icmp eq i64 %indvars.iv.next, 10
store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem
store i64 %23, i64* %rax.1.reg2mem
br i1 %exitcond, label LBL_6, label LBL_5
LBL_6:
%rax.1.reload = load i64, i64* %rax.1.reg2mem
ret i64 %rax.1.reload
uselistorder i64* %0, { 1, 0 }
uselistorder i64* %indvars.iv5.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 }
uselistorder i64* %rax.1.reg2mem, { 0, 1, 3, 2 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
uselistorder label LBL_6, { 0, 2, 1 }
uselistorder label LBL_5, { 1, 0 }
uselistorder label LBL_3, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE401_Memory_Leak__int_malloc_02-good
|
goodB2G1
|
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)
}
|
0
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__char_alloca_loop_13-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = ptrtoint i64* %sv_2 to i64
%1 = call i64 @FUNC(i64 40)
%2 = add i64 %0, -49
%3 = and i64 %2, -16
%4 = add i64 %0, -161
%5 = and i64 %4, -16
%6 = inttoptr i64 %3 to i64*
%7 = call i64* @memset(i64* %6, i32 65, i32 49)
%8 = add i64 %3, 49
%9 = inttoptr i64 %8 to i8*
store i8 0, i8* %9, align 1
%10 = inttoptr i64 %5 to i64*
%11 = call i64* @memset(i64* %10, i32 65, i32 99)
%12 = add i64 %5, 99
%13 = inttoptr i64 %12 to i8*
store i8 0, i8* %13, align 1
%14 = load i32, i32* inttoptr (i64 8360 to i32*), align 8
%15 = icmp eq i32 %14, 5
store i64 %5, i64* %sv_0.0.reg2mem
br i1 %15, label LBL_2, label LBL_1
LBL_1:
%16 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
br label LBL_2
LBL_2:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%17 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%18 = bitcast i64* %sv_1 to i8*
%19 = call i32 @strlen(i8* nonnull %18)
%20 = sext i32 %19 to i64
%21 = icmp eq i32 %19, 0
%.pre = ptrtoint i64* %sv_1 to i64
store i64 0, i64* %storemerge1.reg2mem
br i1 %21, label LBL_4, label LBL_3
LBL_3:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%22 = add i64 %storemerge1.reload, %sv_0.0.reload
%23 = inttoptr i64 %22 to i8*
%24 = load i8, i8* %23, align 1
%25 = add i64 %storemerge1.reload, %.pre
%26 = inttoptr i64 %25 to i8*
store i8 %24, i8* %26, align 1
%27 = add nuw i64 %storemerge1.reload, 1
%28 = icmp ult i64 %27, %20
store i64 %27, i64* %storemerge1.reg2mem
br i1 %28, label LBL_3, label LBL_4
LBL_4:
%29 = call i64 @FUNC(i64 %.pre)
%30 = call i64 @FUNC(i64 40)
%31 = icmp eq i64 %1, %30
store i64 0, i64* %rax.0.reg2mem
br i1 %31, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %storemerge1.reload, { 0, 2, 1 }
uselistorder i64 %.pre, { 1, 0 }
uselistorder i64 %5, { 0, 2, 1 }
uselistorder i64 %3, { 1, 0 }
uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 }
uselistorder label LBL_3, { 1, 0 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__short_fscanf_predec_10-bad
|
CWE191_Integer_Underflow__short_fscanf_predec_10_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 = 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), i16* 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 i16, i16* %sv_0, align 2
%7 = add i16 %6, -1
store i16 %7, i16* %sv_0, align 2
%8 = sext i16 %7 to i64
%9 = and i64 %8, 4294967295
%10 = call i64 @FUNC(i64 %9)
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 i16* %sv_0, { 1, 2, 0, 3 }
uselistorder label LBL_3, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE511_Logic_Time_Bomb__rand_12-bad
|
CWE511_Logic_Time_Bomb__rand_12_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
%3 = call i32 @time(i32* null)
call void @srand(i32 %3)
%4 = call i32 @rand()
%5 = sext i32 %4 to i64
%6 = icmp eq i32 %4, 20000
%7 = icmp eq i1 %6, false
br i1 %2, label LBL_3, label LBL_1
LBL_1:
store i64 %5, i64* %rax.0.reg2mem
br i1 %7, label LBL_5, label LBL_2
LBL_2:
%8 = call i32 @unlink(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @gv_0, i64 0, i64 0))
%9 = sext i32 %8 to i64
store i64 %9, i64* %rax.0.reg2mem
br label LBL_5
LBL_3:
store i64 %5, i64* %rax.0.reg2mem
br i1 %7, label LBL_5, label LBL_4
LBL_4:
%10 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64))
store i64 %10, i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i1 %7, { 1, 0 }
uselistorder i64 %5, { 1, 0 }
uselistorder i64* %rax.0.reg2mem, { 0, 3, 4, 1, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE129_rand_32-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%indvars.iv.reg2mem = alloca i64
%indvars.iv8.reg2mem = alloca i64
%0 = call i64 @FUNC(i64 40)
%1 = call i32 @rand()
%2 = urem i32 %1, 2
%3 = icmp eq i32 %2, 0
%4 = call i32 @rand()
%5 = mul i32 %4, 1073741824
%6 = call i32 @rand()
%7 = mul i32 %6, 32768
%8 = xor i32 %7, %5
%9 = call i32 @rand()
%10 = xor i32 %8, %9
%11 = sext i1 %3 to i32
%storemerge4.in = xor i32 %10, %11
%12 = call i64* @malloc(i32 40)
%13 = ptrtoint i64* %12 to i64
%14 = icmp eq i64* %12, null
%15 = icmp eq i1 %14, false
store i64 0, i64* %indvars.iv8.reg2mem
br i1 %15, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%indvars.iv8.reload = load i64, i64* %indvars.iv8.reg2mem
%16 = mul i64 %indvars.iv8.reload, 4
%17 = add i64 %16, %13
%18 = inttoptr i64 %17 to i32*
store i32 0, i32* %18, align 4
%indvars.iv.next9 = add nuw nsw i64 %indvars.iv8.reload, 1
%exitcond10 = icmp eq i64 %indvars.iv.next9, 10
store i64 %indvars.iv.next9, i64* %indvars.iv8.reg2mem
br i1 %exitcond10, label LBL_3, label LBL_2
LBL_3:
%19 = icmp ugt i32 %storemerge4.in, 9
br i1 %19, label LBL_6, label LBL_4
LBL_4:
%20 = sext i32 %storemerge4.in to i64
%21 = mul i64 %20, 4
%22 = add i64 %21, %13
%23 = inttoptr i64 %22 to i32*
store i32 1, i32* %23, align 4
store i64 0, i64* %indvars.iv.reg2mem
br label LBL_5
LBL_5:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%24 = mul i64 %indvars.iv.reload, 4
%25 = add i64 %24, %13
%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
br i1 %exitcond, label LBL_7, label LBL_5
LBL_6:
%30 = call i64 @FUNC(i64 ptrtoint ([36 x i8]* @gv_0 to i64))
br label LBL_7
LBL_7:
call void @free(i64* %12)
%31 = call i64 @FUNC(i64 40)
%32 = icmp eq i64 %0, %31
store i64 0, i64* %rax.0.reg2mem
br i1 %32, label LBL_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 %storemerge4.in, { 1, 0 }
uselistorder i64* %indvars.iv8.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
uselistorder i64 10, { 1, 0, 3, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder label LBL_7, { 1, 0 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__int_realloc_17-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64* @realloc(i64* null, i32 4)
%1 = ptrtoint i64* %0 to i64
%2 = icmp eq i64* %0, null
store i64 %1, i64* %rax.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = bitcast i64* %0 to i32*
store i32 5, i32* %3, align 4
%4 = call i64 @FUNC(i64 5)
call void @free(i64* nonnull %0)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_connect_socket_system_05-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 2126700, i64* %sv_0, align 8
%1 = bitcast i64* %sv_0 to i8*
%2 = load i32, i32* @gv_0, align 4
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
br label LBL_3
LBL_2:
%5 = call i32 @strlen(i8* nonnull %1)
%6 = sext i32 %5 to i64
%7 = ptrtoint i64* %sv_0 to i64
%8 = add i64 %6, %7
%9 = inttoptr i64 %8 to i32*
store i32 2764330, i32* %9, align 4
br label LBL_3
LBL_3:
%10 = call i32 @system(i8* nonnull %1)
%11 = icmp eq i32 %10, 0
br i1 %11, label LBL_5, label LBL_4
LBL_4:
%12 = call i64 @FUNC(i64 ptrtoint ([26 x i8]* @gv_2 to i64))
call void @exit(i32 1)
unreachable
LBL_5:
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_connect_socket_add_13-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.045.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = 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.045.reg2mem
br i1 %2, label LBL_5, label LBL_1
LBL_1:
%3 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%4 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%5 = call i16 @htons(i16 27015)
%6 = bitcast i64* %sv_2 to %sockaddr*
%7 = call i32 @connect(i32 %1, %sockaddr* nonnull %6, i32 16)
%8 = icmp eq i32 %7, -1
br i1 %8, label LBL_3, label LBL_2
LBL_2:
%9 = call i32 @recv(i32 %1, i64* nonnull %sv_1, i32 13, i32 0)
%10 = add i32 %9, 1
%11 = icmp ult i32 %10, 2
br i1 %11, label LBL_3, label LBL_4
LBL_3:
%12 = call i32 @close(i32 %1)
store i32 0, i32* %sv_0.045.reg2mem
br label LBL_5
LBL_4:
%13 = ptrtoint i64* %sv_3 to i64
%14 = sext i32 %9 to i64
%15 = add i64 %13, -22
%16 = add i64 %15, %14
%17 = inttoptr i64 %16 to i8*
store i8 0, i8* %17, align 1
%18 = bitcast i64* %sv_1 to i8*
%19 = call i32 @atoi(i8* nonnull %18)
%20 = call i32 @close(i32 %1)
%21 = icmp eq i32 %19, 2147483647
store i32 %19, i32* %sv_0.045.reg2mem
br i1 %21, label LBL_6, label LBL_5
LBL_5:
%sv_0.045.reload = load i32, i32* %sv_0.045.reg2mem
%22 = add i32 %sv_0.045.reload, 1
%23 = zext i32 %22 to i64
%24 = call i64 @FUNC(i64 %23)
br label LBL_7
LBL_6:
%25 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_1 to i64))
br label LBL_7
LBL_7:
%26 = call i64 @FUNC(i64 40)
%27 = icmp eq i64 %0, %26
store i64 0, i64* %rax.0.reg2mem
br i1 %27, label LBL_9, label LBL_8
LBL_8:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_9
LBL_9:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %9, { 1, 0 }
uselistorder i32 %1, { 3, 0, 1, 2, 4 }
uselistorder i64* %sv_2, { 0, 2, 1 }
uselistorder i32* %sv_0.045.reg2mem, { 0, 3, 2, 1 }
uselistorder i32 (i8*)* @atoi, { 1, 0, 2 }
uselistorder i32 (i32)* @close, { 3, 0, 2, 1, 4 }
uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32)* @connect, { 1, 0, 2 }
uselistorder i16 (i16)* @htons, { 1, 0, 2 }
uselistorder i32 (i8*)* @inet_addr, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder label LBL_5, { 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_listen_socket_fprintf_10-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_1, align 8
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_14, label LBL_1
LBL_1:
%3 = bitcast i64* %sv_1 to i8*
%4 = call i32 @strlen(i8* nonnull %3)
%5 = call i32 @socket(i32 2, i32 1, i32 6)
%6 = icmp eq i32 %5, -1
br i1 %6, label LBL_12, label LBL_2
LBL_2:
%7 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16)
store i64 2, i64* %sv_0, align 8
%8 = call i16 @htons(i16 27015)
%9 = bitcast i64* %sv_0 to %sockaddr*
%10 = call i32 @bind(i32 %5, %sockaddr* nonnull %9, i32 16)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_10, label LBL_3
LBL_3:
%12 = call i32 @listen(i32 %5, i32 5)
%13 = icmp eq i32 %12, -1
br i1 %13, label LBL_10, label LBL_4
LBL_4:
%14 = call i32 @accept(i32 %5, %sockaddr* null, i32* null)
%15 = icmp eq i32 %14, -1
br i1 %15, label LBL_10, label LBL_5
LBL_5:
%16 = sext i32 %4 to i64
%17 = ptrtoint i64* %sv_1 to i64
%18 = add i64 %16, %17
%19 = inttoptr i64 %18 to i64*
%20 = sub i32 99, %4
%21 = call i32 @recv(i32 %14, i64* %19, i32 %20, i32 0)
%22 = add i32 %21, 1
%23 = icmp ult i32 %22, 2
br i1 %23, label LBL_11, label LBL_6
LBL_6:
%24 = sext i32 %21 to i64
%25 = add i64 %18, %24
%26 = inttoptr i64 %25 to i8*
store i8 0, i8* %26, align 1
%27 = call i8* @strchr(i8* nonnull %3, i32 13)
%28 = icmp eq i8* %27, null
br i1 %28, label LBL_8, label LBL_7
LBL_7:
store i8 0, i8* %27, align 1
br label LBL_8
LBL_8:
%29 = call i8* @strchr(i8* nonnull %3, i32 10)
%30 = icmp eq i8* %29, null
br i1 %30, label LBL_11, label LBL_9
LBL_9:
store i8 0, i8* %29, align 1
br label LBL_11
LBL_10:
%31 = call i32 @close(i32 %5)
br label LBL_12
LBL_11:
%32 = call i32 @close(i32 %5)
%33 = call i32 @close(i32 %14)
br label LBL_12
LBL_12:
%.pr = load i32, i32* @gv_0, align 4
%34 = icmp eq i32 %.pr, 0
br i1 %34, label LBL_14, label LBL_13
LBL_13:
%35 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%36 = call i32 (%_IO_FILE*, i8*, ...) @fprintf(%_IO_FILE* %35, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_2, i64 0, i64 0), i64* nonnull %sv_1)
br label LBL_14
LBL_14:
%37 = call i64 @FUNC(i64 40)
%38 = icmp eq i64 %0, %37
store i64 0, i64* %rax.0.reg2mem
br i1 %38, 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 %21, { 1, 0 }
uselistorder i32 %5, { 4, 0, 1, 2, 3, 5 }
uselistorder i64* %sv_0, { 0, 2, 1 }
uselistorder i32 (i32)* @close, { 5, 4, 0, 3, 2, 1, 6 }
uselistorder i8* (i8*, i32)* @strchr, { 3, 2, 1, 0, 4 }
uselistorder i8 0, { 1, 2, 3, 4, 5, 6, 7, 0 }
uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32*)* @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 label LBL_14, { 1, 2, 0 }
uselistorder label LBL_12, { 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_console_printf_06-bad
|
CWE134_Uncontrolled_Format_String__char_console_printf_06_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_6, label LBL_1
LBL_1:
%6 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%7 = sub i32 100, %2
%8 = ptrtoint i64* %sv_0 to i64
%9 = add i64 %3, %8
%10 = inttoptr i64 %9 to i8*
%11 = call i8* @fgets(i8* %10, i32 %7, %_IO_FILE* %6)
%12 = icmp eq i8* %11, null
br i1 %12, label LBL_5, label LBL_2
LBL_2:
%13 = call i32 @strlen(i8* nonnull %1)
%14 = icmp eq i32 %13, 0
br i1 %14, label LBL_6, label LBL_3
LBL_3:
%15 = sext i32 %13 to i64
%16 = add i64 %8, -1
%17 = add i64 %16, %15
%18 = inttoptr i64 %17 to i8*
%19 = load i8, i8* %18, align 1
%20 = icmp eq i8 %19, 10
%21 = icmp eq i1 %20, false
br i1 %21, label LBL_6, label LBL_4
LBL_4:
store i8 0, i8* %18, align 1
br label LBL_6
LBL_5:
%22 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_1 to i64))
store i8 0, i8* %10, align 1
br label LBL_6
LBL_6:
%23 = call i32 (i8*, ...) @printf(i8* nonnull %1)
%24 = call i64 @FUNC(i64 40)
%25 = icmp eq i64 %0, %24
store i64 0, i64* %rax.0.reg2mem
br i1 %25, 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 %8, { 1, 0 }
uselistorder i8* %1, { 1, 0, 2 }
uselistorder i8 0, { 1, 2, 3, 0 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
uselistorder label LBL_6, { 4, 3, 2, 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE369_Divide_by_Zero__float_fscanf_14-bad
|
CWE369_Divide_by_Zero__float_fscanf_14_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* inttoptr (i64 16404 to i32*), align 4
%8 = icmp eq i32 %7, 5
%9 = icmp eq i1 %8, false
br i1 %9, label LBL_2, label LBL_1
LBL_1:
%10 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%11 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %10, 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:
%12 = load i32, i32* @gv_2, align 4
%13 = icmp eq i32 %12, 5
%14 = icmp eq i1 %13, false
br i1 %14, label LBL_4, label LBL_3
LBL_3:
%15 = load i32, i32* %sv_0, align 4
%16 = call i128 @__asm_movss.1(i32 %15)
%17 = call i128 @FUNC(i128 %1, i128 %1)
%18 = call i128 @FUNC(i128 %16)
%19 = call i128 @FUNC(i64 4636737291354636288)
%20 = call i128 @FUNC(i128 %19, i128 %18)
%21 = call i32 @FUNC(i128 %20)
%22 = zext i32 %21 to i64
%23 = call i64 @FUNC(i64 %22)
br label LBL_4
LBL_4:
%24 = call i64 @FUNC(i64 40)
%25 = icmp eq i64 %3, %24
store i64 0, i64* %rax.0.reg2mem
br i1 %25, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %sv_0, { 2, 0, 1 }
uselistorder i128* %0, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_alloca_memcpy_03-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i8*, align 8
%0 = ptrtoint i8** %sv_1 to i64
%1 = call i64 @FUNC(i64 40)
%2 = add i64 %0, -97
%3 = and i64 %2, -16
%4 = inttoptr i64 %3 to i8*
store i8* %4, i8** %sv_1, align 8
%5 = inttoptr i64 %3 to i64*
%6 = call i64* @memset(i64* %5, i32 65, i32 49)
%7 = add i64 %3, 49
%8 = inttoptr i64 %7 to i8*
store i8 0, i8* %8, align 1
store i64 0, i64* %sv_0, align 8
%9 = call i32 @strlen(i8* %4)
%10 = call i64* @memcpy(i64* nonnull %sv_0, i64* %5, i32 %9)
%11 = call i64 @FUNC(i64 %3)
%12 = call i64 @FUNC(i64 40)
%13 = icmp eq i64 %1, %12
store i64 0, i64* %rax.0.reg2mem
br i1 %13, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %3, { 2, 1, 0, 3 }
uselistorder i8** %sv_1, { 1, 0 }
uselistorder i64* (i64*, i64*, i32)* @memcpy, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__fopen_02-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 = ptrtoint %_IO_FILE* %0 to i64
%2 = icmp eq %_IO_FILE* %0, null
store i64 %1, i64* %rax.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i32 @fclose(%_IO_FILE* nonnull %0)
%4 = sext i32 %3 to i64
store i64 %4, i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 (%_IO_FILE*)* @fclose, { 1, 0, 2 }
uselistorder %_IO_FILE* (i8*, i8*)* @fopen, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE398_Poor_Code_Quality__addition_08-bad
|
CWE398_Poor_Code_Quality__addition_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
store i64 %0, i64* %rax.0.reg2mem
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 0)
%4 = call i64 @FUNC(i64 0)
store i64 %4, i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_memcpy_12-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%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 @FUNC()
%6 = call i64* @memset(i64* %1, i32 65, i32 49)
%7 = ptrtoint i64* %1 to i64
%8 = add i64 %7, 49
%9 = inttoptr i64 %8 to i8*
store i8 0, i8* %9, align 1
store i64 0, i64* %sv_0, align 8
%10 = call i32 @strlen(i8* %4)
%11 = call i64* @memcpy(i64* nonnull %sv_0, i64* %1, i32 %10)
%12 = call i64 @FUNC(i64 %7)
call void @free(i64* %1)
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %1, { 0, 1, 2, 3, 5, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE758_Undefined_Behavior__struct_alloca_use_14-bad
|
CWE758_Undefined_Behavior__struct_alloca_use_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i32
%rax.0.reg2mem = alloca i64
%1 = load i32, i32* %0
%sv_0 = alloca i64, align 8
%2 = call i64 @FUNC(i64 40)
%3 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%4 = icmp eq i32 %3, 5
%5 = icmp eq i1 %4, false
br i1 %5, label LBL_2, label LBL_1
LBL_1:
%6 = ptrtoint i64* %sv_0 to i64
%7 = add i64 %6, -1
%8 = and i64 %7, -16
%9 = inttoptr i64 %8 to i64*
%10 = load i64, i64* %9, align 16
%11 = and i64 %10, 4294967295
%12 = call i64 @FUNC(i64 %11)
%13 = zext i32 %1 to i64
%14 = call i64 @FUNC(i64 %13)
br label LBL_2
LBL_2:
%15 = call i64 @FUNC(i64 40)
%16 = icmp eq i64 %2, %15
store i64 0, i64* %rax.0.reg2mem
br i1 %16, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_alloca_ncpy_08-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 = 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 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:
store i64 4702111234474983745, i64* %sv_0, align 8
%9 = bitcast i64* %sv_0 to i8*
%10 = call i32 @strlen(i8* nonnull %9)
%11 = add i32 %10, 1
%12 = load i8*, i8** %sv_1, align 8
%13 = call i8* @strncpy(i8* %12, i8* nonnull %9, i32 %11)
%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, { 3, 2, 0, 1 }
uselistorder i8* (i8*, i8*, i32)* @strncpy, { 1, 0, 2 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__struct_calloc_04-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64* @calloc(i32 1, i32 8)
%1 = icmp eq i64* %0, null
store i64 0, i64* %rax.0.reg2mem
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = ptrtoint i64* %0 to i64
%3 = bitcast i64* %0 to i32*
store i32 1, i32* %3, align 4
%4 = add i64 %2, 4
%5 = inttoptr i64 %4 to i32*
store i32 1, i32* %5, align 4
%6 = call i64 @FUNC(i64 %2)
call void @free(i64* nonnull %0)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %0, { 0, 1, 3, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__CWE129_listen_socket_12-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.2.reg2mem = alloca i32
%sv_0.1.ph.reg2mem = alloca i32
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = ptrtoint i64* %sv_3 to i64
%1 = call i64 @FUNC(i64 40)
%2 = call i64 @FUNC()
%3 = trunc i64 %2 to i32
%4 = icmp eq i32 %3, 0
%5 = call i32 @socket(i32 2, i32 1, i32 6)
%6 = icmp eq i32 %5, -1
br i1 %4, label LBL_9, label LBL_1
LBL_1:
store i32 -1, i32* %sv_0.2.reg2mem
br i1 %6, label LBL_17, label LBL_2
LBL_2:
%7 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%8 = call i16 @htons(i16 27015)
%9 = bitcast i64* %sv_2 to %sockaddr*
%10 = call i32 @bind(i32 %5, %sockaddr* nonnull %9, i32 16)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_7, label LBL_3
LBL_3:
%12 = call i32 @listen(i32 %5, i32 5)
%13 = icmp eq i32 %12, -1
br i1 %13, label LBL_7, label LBL_4
LBL_4:
%14 = call i32 @accept(i32 %5, %sockaddr* null, i32* null)
%15 = icmp eq i32 %14, -1
br i1 %15, label LBL_7, label LBL_5
LBL_5:
%16 = call i32 @recv(i32 %14, i64* nonnull %sv_1, i32 13, i32 0)
%17 = add i32 %16, 1
%18 = icmp ult i32 %17, 2
store i32 -1, i32* %sv_0.0.ph.reg2mem
br i1 %18, label LBL_8, label LBL_6
LBL_6:
%19 = sext i32 %16 to i64
%20 = add i64 %0, -22
%21 = add i64 %20, %19
%22 = inttoptr i64 %21 to i8*
store i8 0, i8* %22, align 1
%23 = bitcast i64* %sv_1 to i8*
%24 = call i32 @atoi(i8* nonnull %23)
store i32 %24, i32* %sv_0.0.ph.reg2mem
br label LBL_8
LBL_7:
%25 = call i32 @close(i32 %5)
store i32 -1, i32* %sv_0.2.reg2mem
br label LBL_17
LBL_8:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%26 = call i32 @close(i32 %5)
%27 = call i32 @close(i32 %14)
store i32 %sv_0.0.ph.reload, i32* %sv_0.2.reg2mem
br label LBL_17
LBL_9:
store i32 -1, i32* %sv_0.2.reg2mem
br i1 %6, label LBL_17, label LBL_10
LBL_10:
%28 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%29 = call i16 @htons(i16 27015)
%30 = bitcast i64* %sv_2 to %sockaddr*
%31 = call i32 @bind(i32 %5, %sockaddr* nonnull %30, i32 16)
%32 = icmp eq i32 %31, -1
br i1 %32, label LBL_15, label LBL_11
LBL_11:
%33 = call i32 @listen(i32 %5, i32 5)
%34 = icmp eq i32 %33, -1
br i1 %34, label LBL_15, label LBL_12
LBL_12:
%35 = call i32 @accept(i32 %5, %sockaddr* null, i32* null)
%36 = icmp eq i32 %35, -1
br i1 %36, label LBL_15, label LBL_13
LBL_13:
%37 = call i32 @recv(i32 %35, i64* nonnull %sv_1, i32 13, i32 0)
%38 = add i32 %37, 1
%39 = icmp ult i32 %38, 2
store i32 -1, i32* %sv_0.1.ph.reg2mem
br i1 %39, label LBL_16, label LBL_14
LBL_14:
%40 = sext i32 %37 to i64
%41 = add i64 %0, -22
%42 = add i64 %41, %40
%43 = inttoptr i64 %42 to i8*
store i8 0, i8* %43, align 1
%44 = bitcast i64* %sv_1 to i8*
%45 = call i32 @atoi(i8* nonnull %44)
store i32 %45, i32* %sv_0.1.ph.reg2mem
br label LBL_16
LBL_15:
%46 = call i32 @close(i32 %5)
store i32 -1, i32* %sv_0.2.reg2mem
br label LBL_17
LBL_16:
%sv_0.1.ph.reload = load i32, i32* %sv_0.1.ph.reg2mem
%47 = call i32 @close(i32 %5)
%48 = call i32 @close(i32 %35)
store i32 %sv_0.1.ph.reload, i32* %sv_0.2.reg2mem
br label LBL_17
LBL_17:
%sv_0.2.reload = load i32, i32* %sv_0.2.reg2mem
%49 = call i64 @FUNC()
%50 = trunc i64 %49 to i32
%51 = icmp eq i32 %50, 0
store i64 0, i64* %sv_2, align 8
%52 = icmp ugt i32 %sv_0.2.reload, 9
br i1 %51, label LBL_21, label LBL_18
LBL_18:
br i1 %52, label LBL_20, label LBL_19
LBL_19:
%53 = sext i32 %sv_0.2.reload to i64
%54 = mul i64 %53, 4
%55 = add i64 %0, -64
%56 = add i64 %55, %54
%57 = inttoptr i64 %56 to i32*
%58 = load i32, i32* %57, align 4
%59 = zext i32 %58 to i64
%60 = call i64 @FUNC(i64 %59)
br label LBL_24
LBL_20:
%61 = call i64 @FUNC(i64 ptrtoint ([36 x i8]* @gv_0 to i64))
br label LBL_24
LBL_21:
br i1 %52, label LBL_23, label LBL_22
LBL_22:
%62 = sext i32 %sv_0.2.reload to i64
%63 = mul i64 %62, 4
%64 = add i64 %0, -64
%65 = add i64 %64, %63
%66 = inttoptr i64 %65 to i32*
%67 = load i32, i32* %66, align 4
%68 = zext i32 %67 to i64
%69 = call i64 @FUNC(i64 %68)
br label LBL_24
LBL_23:
%70 = call i64 @FUNC(i64 ptrtoint ([36 x i8]* @gv_0 to i64))
br label LBL_24
LBL_24:
%71 = call i64 @FUNC(i64 40)
%72 = icmp eq i64 %1, %71
store i64 0, i64* %rax.0.reg2mem
br i1 %72, label LBL_26, label LBL_25
LBL_25:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_26
LBL_26:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %sv_0.2.reload, { 1, 0, 2 }
uselistorder i32 %37, { 1, 0 }
uselistorder i32 %16, { 1, 0 }
uselistorder i1 %6, { 1, 0 }
uselistorder i32 %5, { 9, 0, 6, 7, 8, 2, 1, 5, 4, 3, 10 }
uselistorder i64 %0, { 3, 2, 1, 0 }
uselistorder i64* %sv_2, { 4, 0, 5, 1, 2, 6, 3 }
uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 1 }
uselistorder i32* %sv_0.1.ph.reg2mem, { 0, 2, 1 }
uselistorder i32* %sv_0.2.reg2mem, { 0, 6, 3, 1, 5, 4, 2 }
uselistorder i32 (i32)* @close, { 5, 4, 0, 3, 2, 1, 6 }
uselistorder i32 (i8*)* @atoi, { 1, 0, 2 }
uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32*)* @accept, { 1, 0, 2 }
uselistorder i32 (i32, i32)* @listen, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32)* @bind, { 1, 0, 2 }
uselistorder i16 (i16)* @htons, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder i32 -1, { 2, 4, 6, 7, 8, 0, 3, 5, 10, 11, 12, 1, 9 }
uselistorder label LBL_17, { 4, 2, 0, 5, 3, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__malloc_char_ncpy_05-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.reg2mem = alloca i8*
%sv_0 = alloca i64, align 8
%sv_1 = alloca i8*, align 8
%sv_2 = alloca i8*, align 8
%0 = call i64 @FUNC(i64 40)
store i8* null, i8** %sv_2, align 8
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
store i8* null, i8** %.reg2mem
br label LBL_5
LBL_2:
%4 = call i64* @malloc(i32 100)
%5 = bitcast i64* %4 to i8*
store i8* %5, i8** %sv_1, align 8
%6 = icmp eq i64* %4, null
%7 = icmp eq i1 %6, false
br i1 %7, label LBL_4, label LBL_3
LBL_3:
call void @exit(i32 -1)
unreachable
LBL_4:
%8 = call i64* @memset(i64* %4, i32 65, i32 99)
%9 = ptrtoint i64* %4 to i64
%10 = add i64 %9, 99
%11 = inttoptr i64 %10 to i8*
store i8 0, i8* %11, align 1
%12 = load i8*, i8** %sv_1, align 8
%13 = ptrtoint i8* %12 to i64
%14 = bitcast i8** %sv_2 to i64*
store i64 %13, i64* %14, align 8
store i8* %12, i8** %.reg2mem
br label LBL_5
LBL_5:
%.reload = load i8*, i8** %.reg2mem
%15 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%16 = bitcast i64* %sv_0 to i8*
%17 = call i8* @strncpy(i8* %.reload, i8* nonnull %16, i32 99)
%18 = ptrtoint i8* %.reload to i64
%19 = add i64 %18, 99
%20 = inttoptr i64 %19 to i8*
store i8 0, i8* %20, align 1
%21 = load i8*, i8** %sv_2, align 8
%22 = ptrtoint i8* %21 to i64
%23 = call i64 @FUNC(i64 %22)
%24 = call i64 @FUNC(i64 40)
%25 = icmp eq i64 %0, %24
store i64 0, i64* %rax.0.reg2mem
br i1 %25, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8** %sv_2, { 2, 0, 1 }
uselistorder i8** %.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE476_NULL_Pointer_Dereference__int64_t_03-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC(i64 5)
%2 = call i64 @FUNC(i64 40)
%3 = icmp eq i64 %0, %2
store i64 0, i64* %rax.0.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 (i64)* @printLongLongLine, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE416_Use_After_Free__malloc_free_int_07-bad
|
CWE416_Use_After_Free__malloc_free_int_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32*
%.reg2mem = alloca i32
%storemerge1.reg2mem = alloca i64
%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* null, i32** %sv_0.0.reg2mem
br i1 %2, label LBL_5, label LBL_1
LBL_1:
%3 = call i64* @malloc(i32 400)
%4 = ptrtoint i64* %3 to i64
%5 = icmp eq i64* %3, null
%6 = icmp eq i1 %5, false
store i64 0, i64* %storemerge1.reg2mem
br i1 %6, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%7 = mul i64 %storemerge1.reload, 4
%8 = add i64 %7, %4
%9 = inttoptr i64 %8 to i32*
store i32 5, i32* %9, align 4
%10 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %10, 100
store i64 %10, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
call void @free(i64* %3)
%phitmp = bitcast i64* %3 to i32*
%.pre = load i32, i32* @gv_0, align 4
store i32 %.pre, i32* %.reg2mem
store i32* %phitmp, i32** %sv_0.0.reg2mem
br label LBL_5
LBL_5:
%.reload = load i32, i32* %.reg2mem
%11 = zext i32 %.reload to i64
%12 = icmp eq i32 %.reload, 5
%13 = icmp eq i1 %12, false
store i64 %11, i64* %rax.0.reg2mem
br i1 %13, label LBL_7, label LBL_6
LBL_6:
%sv_0.0.reload = load i32*, i32** %sv_0.0.reg2mem
%14 = load i32, i32* %sv_0.0.reload, align 4
%15 = zext i32 %14 to i64
%16 = call i64 @FUNC(i64 %15)
store i64 %16, i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 }
uselistorder i32 5, { 0, 3, 1, 2 }
uselistorder label LBL_3, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_file_execlp_04-bad
|
CWE78_OS_Command_Injection__char_file_execlp_04_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 2126700, i64* %sv_0, align 8
%1 = bitcast i64* %sv_0 to i8*
%2 = call i32 @strlen(i8* nonnull %1)
%3 = sext i32 %2 to i64
%4 = sub nsw i64 100, %3
%5 = icmp ult i64 %4, 2
br i1 %5, label LBL_5, label LBL_1
LBL_1:
%6 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_1, i64 0, i64 0))
%7 = icmp eq %_IO_FILE* %6, null
br i1 %7, label LBL_5, label LBL_2
LBL_2:
%8 = sub i32 100, %2
%9 = ptrtoint i64* %sv_0 to i64
%10 = add i64 %3, %9
%11 = inttoptr i64 %10 to i8*
%12 = call i8* @fgets(i8* %11, i32 %8, %_IO_FILE* nonnull %6)
%13 = icmp eq i8* %12, null
%14 = icmp eq i1 %13, false
br i1 %14, label LBL_4, label LBL_3
LBL_3:
%15 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 to i64))
store i8 0, i8* %11, align 1
br label LBL_4
LBL_4:
%16 = call i32 @fclose(%_IO_FILE* nonnull %6)
br label LBL_5
LBL_5:
%17 = call i32 (i8*, i8*, ...) @execlp(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_3, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_3, i64 0, i64 0))
%18 = call i64 @FUNC(i64 40)
%19 = icmp eq i64 %0, %18
store i64 0, i64* %rax.0.reg2mem
br i1 %19, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__short_fscanf_square_32-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i16, align 2
%0 = call i64 @FUNC(i64 40)
store i16 0, i16* %sv_0, align 2
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i16* nonnull %sv_0)
%3 = load i16, i16* %sv_0, align 2
%4 = sub i16 0, %3
%5 = icmp slt i16 %4, 0
%6 = icmp eq i1 %5, false
%.v = select i1 %6, i16 %4, i16 %3
%7 = icmp ult i16 %.v, 182
br i1 %7, label LBL_1, label LBL_2
LBL_1:
%8 = zext i16 %3 to i32
%narrow = mul i32 %8, 65536
%sext = mul i32 %narrow, %8
%9 = ashr exact i32 %sext, 16
%10 = zext i32 %9 to i64
%11 = call i64 @FUNC(i64 %10)
br label LBL_3
LBL_2:
%12 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64))
br label LBL_3
LBL_3:
%13 = call i64 @FUNC(i64 40)
%14 = icmp eq i64 %0, %13
store i64 0, i64* %rax.0.reg2mem
br i1 %14, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %8, { 1, 0 }
uselistorder i16* %sv_0, { 1, 0, 2 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE401_Memory_Leak__int_calloc_02-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i32*, align 8
%0 = ptrtoint i32** %sv_0 to i64
%1 = call i64 @FUNC(i64 40)
%2 = add i64 %0, -401
%3 = and i64 %2, -16
%4 = inttoptr i64 %3 to i32*
store i32* %4, i32** %sv_0, align 8
store i32 5, i32* %4, align 16
%5 = load i32*, i32** %sv_0, align 8
%6 = load i32, i32* %5, align 4
%7 = zext i32 %6 to i64
%8 = call i64 @FUNC(i64 %7)
%9 = call i64 @FUNC(i64 40)
%10 = icmp eq i64 %1, %9
store i64 0, i64* %rax.0.reg2mem
br i1 %10, label LBL_2, label LBL_1
LBL_1:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32** %sv_0, { 2, 1, 0 }
uselistorder i64 (i64)* @printIntLine, { 3, 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE197_Numeric_Truncation_Error__int_connect_socket_to_short_05-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
%2 = select i1 %1, i64 4294967295, i64 122
%3 = call i64 @FUNC(i64 %2)
ret i64 %3
uselistorder i64 (i64)* @printShortLine, { 1, 0 }
uselistorder i64 122, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE789_Uncontrolled_Mem_Alloc__malloc_char_listen_socket_01-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i32 @socket(i32 2, i32 1, i32 6)
%2 = icmp eq i32 %1, -1
br i1 %2, label LBL_11, label LBL_1
LBL_1:
%3 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%4 = call i16 @htons(i16 27015)
%5 = bitcast i64* %sv_2 to %sockaddr*
%6 = call i32 @bind(i32 %1, %sockaddr* nonnull %5, i32 16)
%7 = icmp eq i32 %6, -1
br i1 %7, label LBL_6, label LBL_2
LBL_2:
%8 = call i32 @listen(i32 %1, i32 5)
%9 = icmp eq i32 %8, -1
br i1 %9, label LBL_6, label LBL_3
LBL_3:
%10 = call i32 @accept(i32 %1, %sockaddr* null, i32* null)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_6, label LBL_4
LBL_4:
%12 = call i32 @recv(i32 %10, i64* nonnull %sv_1, i32 25, i32 0)
%13 = add i32 %12, 1
%14 = icmp ult i32 %13, 2
store i32 0, i32* %sv_0.0.ph.reg2mem
br i1 %14, label LBL_7, label LBL_5
LBL_5:
%15 = ptrtoint i64* %sv_3 to i64
%16 = sext i32 %12 to i64
%17 = add i64 %15, -48
%18 = add i64 %17, %16
%19 = inttoptr i64 %18 to i8*
store i8 0, i8* %19, align 1
%20 = bitcast i64* %sv_1 to i8*
%21 = call i32 @strtoul(i8* nonnull %20, i8** null, i32 0)
store i32 %21, i32* %sv_0.0.ph.reg2mem
br label LBL_7
LBL_6:
%22 = call i32 @close(i32 %1)
br label LBL_11
LBL_7:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%23 = call i32 @close(i32 %1)
%24 = call i32 @close(i32 %10)
%sv_0.0.off = add i32 %sv_0.0.ph.reload, -6
%25 = icmp ult i32 %sv_0.0.off, 94
br i1 %25, label LBL_8, label LBL_11
LBL_8:
%26 = call i64* @malloc(i32 %sv_0.0.ph.reload)
%27 = icmp eq i64* %26, null
%28 = icmp eq i1 %27, false
br i1 %28, label LBL_10, label LBL_9
LBL_9:
call void @exit(i32 -1)
unreachable
LBL_10:
%29 = ptrtoint i64* %26 to i64
%30 = bitcast i64* %26 to i32*
store i32 1819043176, i32* %30, align 4
%31 = add i64 %29, 4
%32 = inttoptr i64 %31 to i16*
store i16 111, i16* %32, align 2
%33 = call i64 @FUNC(i64 %29)
call void @free(i64* %26)
br label LBL_12
LBL_11:
%34 = call i64 @FUNC(i64 ptrtoint ([64 x i8]* @gv_0 to i64))
br label LBL_12
LBL_12:
%35 = call i64 @FUNC(i64 40)
%36 = icmp eq i64 %0, %35
store i64 0, i64* %rax.0.reg2mem
br i1 %36, label LBL_14, label LBL_13
LBL_13:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_14
LBL_14:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %26, { 0, 1, 3, 2 }
uselistorder i32 %12, { 1, 0 }
uselistorder i32 %1, { 4, 0, 1, 2, 3, 5 }
uselistorder i64* %sv_2, { 0, 2, 1 }
uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 1 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
uselistorder i32 (i32)* @close, { 2, 1, 0, 3 }
uselistorder i32 -1, { 4, 0, 1, 2, 3, 5 }
uselistorder label LBL_11, { 2, 1, 0 }
uselistorder label LBL_7, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE467_Use_of_sizeof_on_Pointer_Type__int_07-bad
|
CWE467_Use_of_sizeof_on_Pointer_Type__int_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = zext i32 %0 to i64
%2 = icmp eq i32 %0, 5
%3 = icmp eq i1 %2, false
store i64 %1, i64* %rax.0.reg2mem
br i1 %3, label LBL_4, label LBL_1
LBL_1:
%4 = call i64* @malloc(i32 8)
%5 = icmp eq i64* %4, null
%6 = icmp eq i1 %5, false
br i1 %6, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%7 = bitcast i64* %4 to i32*
store i32 5, i32* %7, align 4
%8 = call i64 @FUNC(i64 5)
call void @free(i64* %4)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 5, { 2, 0, 1 }
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE129_fscanf_08-good
|
goodG2B2
|
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 = call i64 @FUNC()
%2 = call i64 @FUNC()
%3 = trunc i64 %2 to i32
%4 = icmp eq i32 %3, 0
br i1 %4, label LBL_5, label LBL_1
LBL_1:
%5 = trunc i64 %1 to i32
%6 = icmp eq i32 %5, 0
br i1 %6, label LBL_4, label LBL_2
LBL_2:
%7 = ptrtoint i64* %sv_0 to i64
%spec.select = select i1 %6, i64 -4, i64 28
%8 = add i64 %7, -48
%9 = add i64 %spec.select, %8
%10 = inttoptr i64 %9 to i32*
store i32 1, i32* %10, align 4
store i64 0, i64* %indvars.iv.reg2mem
br label LBL_3
LBL_3:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%11 = mul i64 %indvars.iv.reload, 4
%12 = add i64 %11, %8
%13 = inttoptr i64 %12 to i32*
%14 = load i32, i32* %13, align 4
%15 = zext i32 %14 to i64
%16 = call i64 @FUNC(i64 %15)
%indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1
%exitcond = icmp eq i64 %indvars.iv.next, 10
store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem
br i1 %exitcond, label LBL_5, label LBL_3
LBL_4:
%17 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_0 to i64))
br label LBL_5
LBL_5:
%18 = call i64 @FUNC(i64 40)
%19 = icmp eq i64 %0, %18
store i64 0, i64* %rax.0.reg2mem
br i1 %19, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 }
uselistorder i64 (i64)* @printIntLine, { 3, 2, 1, 0 }
uselistorder i64 ()* @staticReturnsTrue, { 5, 4, 3, 2, 1, 0 }
uselistorder label LBL_5, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE377_Insecure_Temporary_File__char_tmpnam_17-bad
|
CWE377_Insecure_Temporary_File__char_tmpnam_17_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.in.reg2mem = alloca i64
%0 = call i8* @tmpnam(i8* null)
%1 = icmp eq i8* %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 i8* %0 to i64
%4 = call i64 @FUNC(i64 %3)
%5 = call i32 (i8*, i32, ...) @open(i8* %0, i32 66)
%6 = icmp eq i32 %5, -1
store i64 -1, i64* %rax.0.in.reg2mem
br i1 %6, label LBL_4, label LBL_3
LBL_3:
%7 = call i64 @FUNC(i64 ptrtoint ([45 x i8]* @gv_0 to i64))
%8 = call i32 @close(i32 %5)
%phitmp = sext i32 %8 to i64
store i64 %phitmp, i64* %rax.0.in.reg2mem
br label LBL_4
LBL_4:
%rax.0.in.reload = load i64, i64* %rax.0.in.reg2mem
ret i64 %rax.0.in.reload
uselistorder i8* %0, { 1, 0, 2 }
uselistorder label LBL_4, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__short_rand_add_02-bad
|
CWE190_Integer_Overflow__short_rand_add_02_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 = call i32 @rand()
%5 = mul i32 %4, 32768
%6 = call i32 @rand()
%7 = xor i32 %6, %5
%8 = sext i1 %2 to i32
%storemerge.in = xor i32 %7, %8
%9 = mul i32 %storemerge.in, 65536
%sext = add i32 %9, 65536
%10 = ashr exact i32 %sext, 16
%11 = zext i32 %10 to i64
%12 = call i64 @FUNC(i64 %11)
ret i64 %12
uselistorder i32 65536, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_console_printf_34-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i8*, 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*
store i8* %1, i8** %sv_0, align 8
%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_6, label LBL_1
LBL_1:
%6 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%7 = sub i32 100, %2
%8 = ptrtoint i64* %sv_1 to i64
%9 = add i64 %3, %8
%10 = inttoptr i64 %9 to i8*
%11 = call i8* @fgets(i8* %10, i32 %7, %_IO_FILE* %6)
%12 = icmp eq i8* %11, null
br i1 %12, label LBL_5, label LBL_2
LBL_2:
%13 = call i32 @strlen(i8* nonnull %1)
%14 = icmp eq i32 %13, 0
br i1 %14, label LBL_6, label LBL_3
LBL_3:
%15 = sext i32 %13 to i64
%16 = add i64 %8, -1
%17 = add i64 %16, %15
%18 = inttoptr i64 %17 to i8*
%19 = load i8, i8* %18, align 1
%20 = icmp eq i8 %19, 10
%21 = icmp eq i1 %20, false
br i1 %21, label LBL_6, label LBL_4
LBL_4:
store i8 0, i8* %18, align 1
br label LBL_6
LBL_5:
%22 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_1 to i64))
store i8 0, i8* %10, align 1
br label LBL_6
LBL_6:
%23 = load i8*, i8** %sv_0, align 8
%24 = call i32 @puts(i8* %23)
%25 = call i64 @FUNC(i64 40)
%26 = icmp eq i64 %0, %25
store i64 0, i64* %rax.0.reg2mem
br i1 %26, label LBL_8, label LBL_7
LBL_7:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_8
LBL_8:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8 0, { 1, 2, 3, 0 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_connect_socket_preinc_12-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.2.reg2mem = alloca i32
%sv_0.1.ph.reg2mem = alloca i32
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = ptrtoint i64* %sv_3 to i64
%1 = call i64 @FUNC(i64 40)
%2 = call i64 @FUNC()
%3 = trunc i64 %2 to i32
%4 = icmp eq i32 %3, 0
%5 = call i32 @socket(i32 2, i32 1, i32 6)
%6 = icmp eq i32 %5, -1
br i1 %4, label LBL_6, label LBL_1
LBL_1:
store i32 0, i32* %sv_0.2.reg2mem
br i1 %6, label LBL_11, label LBL_2
LBL_2:
%7 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%8 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%9 = call i16 @htons(i16 27015)
%10 = bitcast i64* %sv_2 to %sockaddr*
%11 = call i32 @connect(i32 %5, %sockaddr* nonnull %10, i32 16)
%12 = icmp eq i32 %11, -1
store i32 0, i32* %sv_0.0.ph.reg2mem
br i1 %12, label LBL_5, label LBL_3
LBL_3:
%13 = call i32 @recv(i32 %5, i64* nonnull %sv_1, i32 13, i32 0)
%14 = add i32 %13, 1
%15 = icmp ult i32 %14, 2
store i32 0, i32* %sv_0.0.ph.reg2mem
br i1 %15, label LBL_5, label LBL_4
LBL_4:
%16 = sext i32 %13 to i64
%17 = add i64 %0, -22
%18 = add i64 %17, %16
%19 = inttoptr i64 %18 to i8*
store i8 0, i8* %19, align 1
%20 = bitcast i64* %sv_1 to i8*
%21 = call i32 @atoi(i8* nonnull %20)
store i32 %21, i32* %sv_0.0.ph.reg2mem
br label LBL_5
LBL_5:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%22 = call i32 @close(i32 %5)
store i32 %sv_0.0.ph.reload, i32* %sv_0.2.reg2mem
br label LBL_11
LBL_6:
store i32 0, i32* %sv_0.2.reg2mem
br i1 %6, label LBL_11, label LBL_7
LBL_7:
%23 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%24 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%25 = call i16 @htons(i16 27015)
%26 = bitcast i64* %sv_2 to %sockaddr*
%27 = call i32 @connect(i32 %5, %sockaddr* nonnull %26, i32 16)
%28 = icmp eq i32 %27, -1
store i32 0, i32* %sv_0.1.ph.reg2mem
br i1 %28, label LBL_10, label LBL_8
LBL_8:
%29 = call i32 @recv(i32 %5, i64* nonnull %sv_1, i32 13, i32 0)
%30 = add i32 %29, 1
%31 = icmp ult i32 %30, 2
store i32 0, i32* %sv_0.1.ph.reg2mem
br i1 %31, label LBL_10, label LBL_9
LBL_9:
%32 = sext i32 %29 to i64
%33 = add i64 %0, -22
%34 = add i64 %33, %32
%35 = inttoptr i64 %34 to i8*
store i8 0, i8* %35, align 1
%36 = bitcast i64* %sv_1 to i8*
%37 = call i32 @atoi(i8* nonnull %36)
store i32 %37, i32* %sv_0.1.ph.reg2mem
br label LBL_10
LBL_10:
%sv_0.1.ph.reload = load i32, i32* %sv_0.1.ph.reg2mem
%38 = call i32 @close(i32 %5)
store i32 %sv_0.1.ph.reload, i32* %sv_0.2.reg2mem
br label LBL_11
LBL_11:
%sv_0.2.reload = load i32, i32* %sv_0.2.reg2mem
%39 = call i64 @FUNC()
%40 = trunc i64 %39 to i32
%41 = icmp eq i32 %40, 0
%42 = icmp eq i32 %sv_0.2.reload, 2147483647
br i1 %41, label LBL_15, label LBL_12
LBL_12:
br i1 %42, label LBL_14, label LBL_13
LBL_13:
%43 = add i32 %sv_0.2.reload, 1
%44 = zext i32 %43 to i64
%45 = call i64 @FUNC(i64 %44)
br label LBL_18
LBL_14:
%46 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_1 to i64))
br label LBL_18
LBL_15:
br i1 %42, label LBL_17, label LBL_16
LBL_16:
%47 = add i32 %sv_0.2.reload, 1
%48 = zext i32 %47 to i64
%49 = call i64 @FUNC(i64 %48)
br label LBL_18
LBL_17:
%50 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_1 to i64))
br label LBL_18
LBL_18:
%51 = call i64 @FUNC(i64 40)
%52 = icmp eq i64 %1, %51
store i64 0, i64* %rax.0.reg2mem
br i1 %52, label LBL_20, label LBL_19
LBL_19:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_20
LBL_20:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i1 %42, { 1, 0 }
uselistorder i32 %sv_0.2.reload, { 1, 0, 2 }
uselistorder i32 %29, { 1, 0 }
uselistorder i32 %13, { 1, 0 }
uselistorder i1 %6, { 1, 0 }
uselistorder i32 %5, { 5, 3, 4, 2, 0, 1, 6 }
uselistorder i64 %0, { 1, 0 }
uselistorder i64* %sv_2, { 0, 4, 1, 2, 5, 3 }
uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 3, 2, 1 }
uselistorder i32* %sv_0.1.ph.reg2mem, { 0, 3, 2, 1 }
uselistorder i32* %sv_0.2.reg2mem, { 0, 4, 1, 3, 2 }
uselistorder i32 (i32)* @close, { 1, 0, 2 }
uselistorder i32 (i8*)* @atoi, { 1, 0, 2 }
uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32)* @connect, { 1, 0, 2 }
uselistorder i16 (i16)* @htons, { 1, 0, 2 }
uselistorder i32 (i8*)* @inet_addr, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder i32 -1, { 0, 2, 1 }
uselistorder label LBL_11, { 2, 0, 3, 1 }
uselistorder label LBL_10, { 1, 2, 0 }
uselistorder label LBL_5, { 1, 2, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_alloca_loop_11-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.lcssa.reg2mem = alloca i64
%storemerge3.reg2mem = alloca i64
%.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i8*, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
br label LBL_3
LBL_2:
%5 = ptrtoint i8** %sv_1 to i64
%6 = add i64 %5, -49
%7 = and i64 %6, -16
%8 = inttoptr i64 %7 to i8*
%9 = bitcast i8** %sv_1 to i64*
store i64 %7, i64* %9, align 8
store i8 0, i8* %8, align 16
br label LBL_3
LBL_3:
store i64 4702111234474983745, i64* %sv_0, align 8
%10 = bitcast i64* %sv_0 to i8*
%11 = call i32 @strlen(i8* nonnull %10)
%12 = sext i32 %11 to i64
%13 = add nsw i64 %12, 1
%14 = icmp eq i64 %13, 0
%15 = load i8*, i8** %sv_1, align 8
%16 = ptrtoint i8* %15 to i64
store i64 %16, i64* %.lcssa.reg2mem
br i1 %14, label LBL_6, label LBL_4
LBL_4:
%17 = ptrtoint i64* %sv_0 to i64
store i64 %16, i64* %.reg2mem
store i64 0, i64* %storemerge3.reg2mem
br label LBL_5
LBL_5:
%storemerge3.reload = load i64, i64* %storemerge3.reg2mem
%.reload = load i64, i64* %.reg2mem
%18 = add i64 %storemerge3.reload, %.reload
%19 = add i64 %storemerge3.reload, %17
%20 = inttoptr i64 %19 to i8*
%21 = load i8, i8* %20, align 1
%22 = inttoptr i64 %18 to i8*
store i8 %21, i8* %22, align 1
%23 = add nuw i64 %storemerge3.reload, 1
%24 = load i8*, i8** %sv_1, align 8
%25 = ptrtoint i8* %24 to i64
%exitcond = icmp eq i64 %23, %13
store i64 %25, i64* %.reg2mem
store i64 %23, i64* %storemerge3.reg2mem
store i64 %25, i64* %.lcssa.reg2mem
br i1 %exitcond, label LBL_6, label LBL_5
LBL_6:
%.lcssa.reload = load i64, i64* %.lcssa.reg2mem
%26 = call i64 @FUNC(i64 %.lcssa.reload)
%27 = call i64 @FUNC(i64 40)
%28 = icmp eq i64 %0, %27
store i64 0, i64* %rax.0.reg2mem
br i1 %28, 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 %storemerge3.reload, { 0, 2, 1 }
uselistorder i64 %16, { 1, 0 }
uselistorder i8** %sv_1, { 3, 0, 1, 2 }
uselistorder i64* %sv_0, { 1, 0, 2 }
uselistorder i64* %.reg2mem, { 1, 0, 2 }
uselistorder i64* %storemerge3.reg2mem, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_connect_socket_execl_07-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 2126700, i64* %sv_0, align 8
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 5
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
br label LBL_3
LBL_2:
%4 = bitcast i64* %sv_0 to i8*
%5 = call i32 @strlen(i8* nonnull %4)
%6 = sext i32 %5 to i64
%7 = ptrtoint i64* %sv_0 to i64
%8 = add i64 %6, %7
%9 = inttoptr i64 %8 to i32*
store i32 2764330, i32* %9, align 4
br label LBL_3
LBL_3:
%10 = call i32 (i8*, i8*, ...) @execl(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @gv_2, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @gv_2, i64 0, i64 0))
%11 = call i64 @FUNC(i64 40)
%12 = icmp eq i64 %0, %11
store i64 0, i64* %rax.0.reg2mem
br i1 %12, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__CWE131_memmove_02-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @malloc(i32 40)
%2 = icmp eq i64* %1, null
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
store i64 0, i64* %sv_0, align 8
%4 = call i64* @memmove(i64* %1, i64* nonnull %sv_0, i32 40)
%5 = bitcast i64* %1 to i32*
%6 = load i32, i32* %5, align 4
%7 = zext i32 %6 to i64
%8 = call i64 @FUNC(i64 %7)
call void @free(i64* %1)
%9 = call i64 @FUNC(i64 40)
%10 = icmp eq i64 %0, %9
store i64 0, i64* %rax.0.reg2mem
br i1 %10, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
uselistorder i64* (i64*, i64*, i32)* @memmove, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE617_Reachable_Assertion__fgets_13-bad
|
CWE617_Reachable_Assertion__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 8600 to i32*), align 8
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_4, label LBL_1
LBL_1:
store i64 0, i64* %sv_0, align 8
%4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%5 = bitcast i64* %sv_0 to i8*
%6 = call i8* @fgets(i8* nonnull %5, i32 14, %_IO_FILE* %4)
%7 = icmp eq i8* %6, null
br i1 %7, label LBL_3, label LBL_2
LBL_2:
%8 = call i32 @atoi(i8* nonnull %5)
%phitmp = icmp sgt i32 %8, 5
br i1 %phitmp, label LBL_5, label LBL_4
LBL_3:
%9 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64))
br label LBL_4
LBL_4:
call void @__assert_fail(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @gv_2, i64 0, i64 0), i8* getelementptr inbounds ([127 x i8], [127 x i8]* @gv_3, i64 0, i64 0), i32 49, i8* getelementptr inbounds ([41 x i8], [41 x i8]* @gv_4, i64 0, i64 0))
br label LBL_5
LBL_5:
%10 = call i64 @FUNC(i64 40)
%11 = icmp eq i64 %0, %10
store i64 0, i64* %rax.0.reg2mem
br i1 %11, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder label LBL_4, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE416_Use_After_Free__malloc_free_struct_02-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge1.reg2mem = alloca i64
%0 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32))
%1 = ptrtoint i64* %0 to i64
%2 = icmp eq i64* %0, null
%3 = icmp eq i1 %2, false
store i64 0, i64* %storemerge1.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%4 = mul i64 %storemerge1.reload, 8
%5 = add i64 %4, %1
%6 = inttoptr i64 %5 to i32*
store i32 1, i32* %6, align 4
%7 = add i64 %5, 4
%8 = inttoptr i64 %7 to i32*
store i32 2, i32* %8, align 4
%9 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %9, 100
store i64 %9, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_3, label LBL_2
LBL_3:
call void @free(i64* %0)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE415_Double_Free__malloc_free_struct_11-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
store i64 0, i64* %sv_0.0.reg2mem
br i1 %2, label LBL_3, label LBL_1
LBL_1:
%3 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32))
%4 = ptrtoint i64* %3 to i64
%5 = icmp eq i64* %3, null
%6 = icmp eq i1 %5, false
store i64 %4, i64* %sv_0.0.reg2mem
br i1 %6, label LBL_3, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%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_5, label LBL_4
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%10 = inttoptr i64 %sv_0.0.reload to i64*
call void @free(i64* %10)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder void (i64*)* @free, { 3, 2, 1, 0, 4 }
uselistorder void (i32)* @exit, { 3, 2, 1, 0, 4 }
uselistorder i64* (i32)* @malloc, { 3, 0, 1, 2, 4 }
uselistorder i64 ()* @globalReturnsTrue, { 5, 4, 3, 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_rand_square_07-bad
|
CWE190_Integer_Overflow__int_rand_square_07_bad
|
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_4, label LBL_3
LBL_3:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%17 = mul i32 %sv_0.0.reload, %sv_0.0.reload
%18 = zext i32 %17 to i64
%19 = call i64 @FUNC(i64 %18)
store i64 %19, 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
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_snprintf_01-bad
|
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_snprintf_01_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @malloc(i32 50)
%2 = icmp eq i64* %1, null
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%4 = bitcast i64* %1 to i8*
store i8 0, i8* %4, align 1
%5 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%6 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* %4, i32 100, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0), i64* nonnull %sv_0)
%7 = ptrtoint i64* %1 to i64
%8 = call i64 @FUNC(i64 %7)
call void @free(i64* %1)
%9 = call i64 @FUNC(i64 40)
%10 = icmp eq i64 %0, %9
store i64 0, i64* %rax.0.reg2mem
br i1 %10, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %4, { 1, 0 }
uselistorder i64* %1, { 1, 0, 3, 2 }
}
|
1
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__char_declare_loop_07-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @memset(i64* nonnull %sv_2, i32 65, i32 99)
%2 = load i32, i32* @gv_0, align 4
%3 = icmp eq i32 %2, 5
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
br label LBL_3
LBL_2:
%5 = ptrtoint i64* %sv_2 to i64
store i64 %5, i64* %sv_0.0.reg2mem
br label LBL_3
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%6 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%7 = 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
%8 = add i64 %storemerge1.reload, %sv_0.0.reload
%9 = add i64 %storemerge1.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 %storemerge1.reload, 1
%exitcond = icmp eq i64 %13, 100
store i64 %13, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_5, label LBL_4
LBL_5:
%14 = add i64 %sv_0.0.reload, 99
%15 = inttoptr i64 %14 to i8*
store i8 0, i8* %15, align 1
%16 = call i64 @FUNC(i64 %sv_0.0.reload)
%17 = call i64 @FUNC(i64 40)
%18 = icmp eq i64 %0, %17
store i64 0, i64* %rax.0.reg2mem
br i1 %18, label LBL_7, label LBL_6
LBL_6:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %storemerge1.reload, { 0, 2, 1 }
uselistorder i64 %sv_0.0.reload, { 1, 0, 2 }
uselistorder i64* %sv_2, { 1, 0 }
uselistorder i64* %sv_1, { 1, 0 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int64_t_fscanf_square_10-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
store i64 0, i64* %rax.0.reg2mem
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = call i64 @FUNC(i64 4)
store i64 %2, i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 (i64)* @printLongLongLine, { 3, 2, 1, 0 }
uselistorder i32* @gv_0, { 4, 3, 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int64_t_rand_postdec_05-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
store i64 0, i64* %sv_0.0.reg2mem
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = call i32 @rand()
%3 = urem i32 %2, 2
%4 = icmp eq i32 %3, 0
%5 = call i32 @rand()
%6 = zext i32 %5 to i64
%7 = mul i64 %6, 1152921504606846976
%8 = call i32 @rand()
%9 = zext i32 %8 to i64
%10 = mul i64 %9, 35184372088832
%11 = call i32 @rand()
%12 = sext i32 %11 to i64
%13 = mul i64 %12, 1073741824
%14 = call i32 @rand()
%15 = sext i32 %14 to i64
%16 = mul i64 %15, 32768
%17 = call i32 @rand()
%18 = sext i32 %17 to i64
%19 = sext i1 %4 to i64
%20 = xor i64 %7, %19
%21 = xor i64 %20, %10
%22 = xor i64 %21, %13
%23 = xor i64 %22, %16
%storemerge = xor i64 %23, %18
store i64 %storemerge, i64* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%24 = load i32, i32* @gv_1, align 4
%25 = icmp eq i32 %24, 0
br i1 %25, label LBL_4, label LBL_3
LBL_3:
%26 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64))
store i64 %26, i64* %rax.0.reg2mem
br label LBL_7
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%27 = icmp eq i64 %sv_0.0.reload, -9223372036854775808
br i1 %27, label LBL_6, label LBL_5
LBL_5:
%28 = add i64 %sv_0.0.reload, -1
%29 = call i64 @FUNC(i64 %28)
store i64 %29, i64* %rax.0.reg2mem
br label LBL_7
LBL_6:
%30 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_3 to i64))
store i64 %30, 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
|
CWE191_Integer_Underflow__int_connect_socket_multiply_09-good
|
goodB2G2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%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 i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%5 = call i16 @htons(i16 27015)
%6 = bitcast i64* %sv_1 to %sockaddr*
%7 = call i32 @connect(i32 %1, %sockaddr* nonnull %6, i32 16)
%8 = icmp eq i32 %7, -1
br i1 %8, label LBL_3, label LBL_2
LBL_2:
%9 = call i32 @recv(i32 %1, i64* nonnull %sv_0, i32 13, i32 0)
%10 = add i32 %9, 1
%11 = icmp ult i32 %10, 2
br i1 %11, label LBL_3, label LBL_4
LBL_3:
%12 = call i32 @close(i32 %1)
br label LBL_8
LBL_4:
%13 = ptrtoint i64* %sv_2 to i64
%14 = sext i32 %9 to i64
%15 = add i64 %13, -22
%16 = add i64 %15, %14
%17 = inttoptr i64 %16 to i8*
store i8 0, i8* %17, align 1
%18 = bitcast i64* %sv_0 to i8*
%19 = call i32 @atoi(i8* nonnull %18)
%20 = call i32 @close(i32 %1)
%21 = icmp slt i32 %19, 0
%22 = icmp eq i1 %21, false
br i1 %22, label LBL_8, label LBL_5
LBL_5:
%23 = icmp slt i32 %19, -1073741823
br i1 %23, label LBL_7, label LBL_6
LBL_6:
%24 = mul i32 %19, 2
%25 = zext i32 %24 to i64
%26 = call i64 @FUNC(i64 %25)
br label LBL_8
LBL_7:
%27 = call i64 @FUNC(i64 ptrtoint ([51 x i8]* @gv_1 to i64))
br label LBL_8
LBL_8:
%28 = call i64 @FUNC(i64 40)
%29 = icmp eq i64 %0, %28
store i64 0, i64* %rax.0.reg2mem
br i1 %29, label LBL_10, label LBL_9
LBL_9:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_10
LBL_10:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %19, { 0, 2, 1 }
uselistorder i32 %9, { 1, 0 }
uselistorder i32 %1, { 3, 0, 1, 2, 4 }
uselistorder i64* %sv_1, { 0, 2, 1 }
uselistorder i32 (i8*)* @atoi, { 1, 0, 2 }
uselistorder i32 (i32)* @close, { 3, 0, 2, 1, 4 }
uselistorder i32 (i32, i64*, i32, i32)* @recv, { 1, 0, 2 }
uselistorder i32 (i32, %sockaddr*, i32)* @connect, { 1, 0, 2 }
uselistorder i16 (i16)* @htons, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder i32 (i32, i32, i32)* @socket, { 1, 0, 2 }
uselistorder label LBL_8, { 2, 3, 4, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__char_declare_ncpy_15-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
%2 = ptrtoint i64* %sv_1 to i64
%3 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%4 = bitcast i64* %sv_1 to i8*
%5 = bitcast i64* %sv_0 to i8*
%6 = call i8* @strncpy(i8* nonnull %4, i8* nonnull %5, i32 99)
%7 = add i64 %2, 99
%8 = inttoptr i64 %7 to i8*
store i8 0, i8* %8, align 1
%9 = call i64 @FUNC(i64 %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_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, { 0, 2, 1 }
uselistorder i64* (i64*, i32, i32)* @memset, { 2, 3, 1, 0, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__char_fscanf_multiply_31-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i8, align 1
%0 = call i64 @FUNC(i64 40)
store i8 32, i8* %sv_0, align 1
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i8* nonnull %sv_0)
%3 = load i8, i8* %sv_0, align 1
%4 = icmp slt i8 %3, 1
br i1 %4, label LBL_4, label LBL_1
LBL_1:
%5 = icmp sgt i8 %3, 62
br i1 %5, label LBL_3, label LBL_2
LBL_2:
%6 = zext i8 %3 to i32
%sext = mul i32 %6, 33554432
%7 = ashr exact i32 %sext, 24
%8 = zext i32 %7 to i64
%9 = call i64 @FUNC(i64 %8)
br label LBL_4
LBL_3:
%10 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64))
br label LBL_4
LBL_4:
%11 = call i64 @FUNC(i64 40)
%12 = icmp eq i64 %0, %11
store i64 0, i64* %rax.0.reg2mem
br i1 %12, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %sv_0, { 1, 0, 2 }
uselistorder i64 (i64)* @printHexCharLine, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_console_system_01-bad
|
CWE78_OS_Command_Injection__char_console_system_01_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 2126700, i64* %sv_0, align 8
%1 = bitcast i64* %sv_0 to i8*
%2 = call i32 @strlen(i8* nonnull %1)
%3 = sext i32 %2 to i64
%4 = sub nsw i64 100, %3
%5 = icmp ult i64 %4, 2
br i1 %5, label LBL_6, label LBL_1
LBL_1:
%6 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%7 = sub i32 100, %2
%8 = ptrtoint i64* %sv_0 to i64
%9 = add i64 %3, %8
%10 = inttoptr i64 %9 to i8*
%11 = call i8* @fgets(i8* %10, i32 %7, %_IO_FILE* %6)
%12 = icmp eq i8* %11, null
br i1 %12, label LBL_5, label LBL_2
LBL_2:
%13 = call i32 @strlen(i8* nonnull %1)
%14 = icmp eq i32 %13, 0
br i1 %14, label LBL_6, label LBL_3
LBL_3:
%15 = sext i32 %13 to i64
%16 = add i64 %8, -1
%17 = add i64 %16, %15
%18 = inttoptr i64 %17 to i8*
%19 = load i8, i8* %18, align 1
%20 = icmp eq i8 %19, 10
%21 = icmp eq i1 %20, false
br i1 %21, label LBL_6, label LBL_4
LBL_4:
store i8 0, i8* %18, align 1
br label LBL_6
LBL_5:
%22 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_1 to i64))
store i8 0, i8* %10, align 1
br label LBL_6
LBL_6:
%23 = call i32 @system(i8* nonnull %1)
%24 = icmp eq i32 %23, 0
br i1 %24, label LBL_8, label LBL_7
LBL_7:
%25 = call i64 @FUNC(i64 ptrtoint ([26 x i8]* @gv_2 to i64))
call void @exit(i32 1)
unreachable
LBL_8:
%26 = call i64 @FUNC(i64 40)
%27 = icmp eq i64 %0, %26
store i64 0, i64* %rax.0.reg2mem
br i1 %27, label LBL_10, label LBL_9
LBL_9:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_10
LBL_10:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %8, { 1, 0 }
uselistorder i8* %1, { 1, 0, 2 }
uselistorder i8 0, { 1, 2, 3, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__char_declare_loop_11-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
%sv_2 = alloca i64, align 8
%2 = call i64 @FUNC(i64 40)
%3 = call i64* @memset(i64* nonnull %sv_2, i32 65, i32 49)
%4 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99)
%5 = call i64 @FUNC()
%6 = trunc i64 %5 to i32
%7 = icmp eq i32 %6, 0
%8 = ptrtoint i64* %sv_1 to i64
%spec.select = select i1 %7, i64 %1, i64 %8
%9 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%10 = bitcast i64* %sv_0 to i8*
%11 = call i32 @strlen(i8* nonnull %10)
%12 = sext i32 %11 to i64
%13 = icmp eq i32 %11, 0
%.pre = ptrtoint i64* %sv_0 to i64
store i64 0, i64* %storemerge1.reg2mem
br i1 %13, label LBL_2, label LBL_1
LBL_1:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%14 = add i64 %storemerge1.reload, %spec.select
%15 = inttoptr i64 %14 to i8*
%16 = load i8, i8* %15, align 1
%17 = add i64 %storemerge1.reload, %.pre
%18 = inttoptr i64 %17 to i8*
store i8 %16, i8* %18, align 1
%19 = add nuw i64 %storemerge1.reload, 1
%20 = icmp ult i64 %19, %12
store i64 %19, i64* %storemerge1.reg2mem
br i1 %20, label LBL_1, label LBL_2
LBL_2:
%21 = call i64 @FUNC(i64 %.pre)
%22 = call i64 @FUNC(i64 40)
%23 = icmp eq i64 %2, %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 %.pre, { 1, 0 }
uselistorder i64* %sv_1, { 1, 0 }
uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 }
uselistorder i32 (i8*)* @strlen, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 5, 0, 4, 3, 2, 1, 6 }
uselistorder label LBL_1, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_int_alloca_memcpy_14-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
br label LBL_3
LBL_2:
%4 = ptrtoint i64* %sv_2 to i64
%5 = add i64 %4, -609
%6 = and i64 %5, -16
store i64 %6, i64* %sv_0.0.reg2mem
br label LBL_3
LBL_3:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%7 = bitcast i64* %sv_1 to i8*
call void @FUNC(i8* nonnull %7, i64 0, i64 50)
%8 = inttoptr i64 %sv_0.0.reload to i64*
%9 = call i64* @memcpy(i64* %8, i64* nonnull %sv_1, i32 400)
%10 = inttoptr i64 %sv_0.0.reload to i32*
%11 = load i32, i32* %10, align 4
%12 = zext i32 %11 to i64
%13 = call i64 @FUNC(i64 %12)
%14 = call i64 @FUNC(i64 40)
%15 = icmp eq i64 %0, %14
store i64 0, i64* %rax.0.reg2mem
br i1 %15, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
0
|
juliet-test-suite-c
|
CWE78_OS_Command_Injection__char_file_popen_08-bad
|
CWE78_OS_Command_Injection__char_file_popen_08_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 2126700, i64* %sv_0, align 8
%1 = bitcast i64* %sv_0 to i8*
%2 = call i64 @FUNC()
%3 = trunc i64 %2 to i32
%4 = icmp eq i32 %3, 0
br i1 %4, label LBL_6, label LBL_1
LBL_1:
%5 = call i32 @strlen(i8* nonnull %1)
%6 = sext i32 %5 to i64
%7 = sub nsw i64 100, %6
%8 = icmp ult i64 %7, 2
br i1 %8, label LBL_6, label LBL_2
LBL_2:
%9 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_1, i64 0, i64 0))
%10 = icmp eq %_IO_FILE* %9, null
br i1 %10, label LBL_6, label LBL_3
LBL_3:
%11 = sub i32 100, %5
%12 = ptrtoint i64* %sv_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 %_IO_FILE* @popen(i8* nonnull %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_3, i64 0, i64 0))
%21 = icmp eq %_IO_FILE* %20, null
br i1 %21, label LBL_8, label LBL_7
LBL_7:
%22 = call i32 @pclose(%_IO_FILE* nonnull %20)
br label LBL_8
LBL_8:
%23 = call i64 @FUNC(i64 40)
%24 = icmp eq i64 %0, %23
store i64 0, i64* %rax.0.reg2mem
br i1 %24, label LBL_10, label LBL_9
LBL_9:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_10
LBL_10:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %1, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE134_Uncontrolled_Format_String__char_connect_socket_fprintf_02-good
|
CWE134_Uncontrolled_Format_String__char_connect_socket_fprintf_02_good
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64 @FUNC()
%1 = call i64 @FUNC()
%2 = call i64 @FUNC()
%3 = call i64 @FUNC()
ret i64 %3
}
|
0
|
juliet-test-suite-c
|
CWE416_Use_After_Free__malloc_free_struct_01-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge1.reg2mem = alloca i64
%0 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32))
%1 = ptrtoint i64* %0 to i64
%2 = icmp eq i64* %0, null
%3 = icmp eq i1 %2, false
store i64 0, i64* %storemerge1.reg2mem
br i1 %3, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%4 = mul i64 %storemerge1.reload, 8
%5 = add i64 %4, %1
%6 = inttoptr i64 %5 to i32*
store i32 1, i32* %6, align 4
%7 = add i64 %5, 4
%8 = inttoptr i64 %7 to i32*
store i32 2, i32* %8, align 4
%9 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %9, 100
store i64 %9, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_3, label LBL_2
LBL_3:
call void @free(i64* %0)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__struct_05-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
store i64 %2, i64* %storemerge.reg2mem
br label LBL_3
LBL_2:
%3 = call i64 @FUNC(i64 1)
%4 = call i64 @FUNC(i64 2)
store i64 %4, i64* %storemerge.reg2mem
br label LBL_3
LBL_3:
%storemerge.reload = load i64, i64* %storemerge.reg2mem
ret i64 %storemerge.reload
uselistorder i64* %storemerge.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__int_calloc_04-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64* @calloc(i32 1, i32 4)
%1 = icmp eq i64* %0, null
store i64 0, i64* %rax.0.reg2mem
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = bitcast i64* %0 to i32*
store i32 5, i32* %2, align 4
%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
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_listen_socket_multiply_14-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.1.reg2mem = alloca i32
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 0, i32* %sv_0.1.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.1.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.1.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)
store i32 %sv_0.0.ph.reload, i32* %sv_0.1.reg2mem
br label LBL_9
LBL_9:
%28 = load i32, i32* @gv_0, align 4
%29 = icmp eq i32 %28, 5
br i1 %29, label LBL_11, label LBL_10
LBL_10:
%30 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64))
br label LBL_15
LBL_11:
%sv_0.1.reload = load i32, i32* %sv_0.1.reg2mem
%31 = icmp slt i32 %sv_0.1.reload, 1
br i1 %31, label LBL_15, label LBL_12
LBL_12:
%32 = icmp sgt i32 %sv_0.1.reload, 1073741822
br i1 %32, label LBL_14, label LBL_13
LBL_13:
%33 = mul i32 %sv_0.1.reload, 2
%34 = zext i32 %33 to i64
%35 = call i64 @FUNC(i64 %34)
br label LBL_15
LBL_14:
%36 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64))
br label LBL_15
LBL_15:
%37 = call i64 @FUNC(i64 40)
%38 = icmp eq i64 %0, %37
store i64 0, i64* %rax.0.reg2mem
br i1 %38, label LBL_17, label LBL_16
LBL_16:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_17
LBL_17:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %sv_0.1.reload, { 2, 0, 1 }
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.1.reg2mem, { 0, 3, 2, 1, 4 }
uselistorder label LBL_9, { 2, 1, 0, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__int64_t_fscanf_sub_17-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
store i64 0, i64* %sv_0, align 8
%1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8
%2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_0)
%3 = load i64, i64* %sv_0, align 8
%4 = icmp eq i64 %3, -9223372036854775808
br i1 %4, label LBL_2, label LBL_1
LBL_1:
%5 = add i64 %3, -1
%6 = call i64 @FUNC(i64 %5)
br label LBL_3
LBL_2:
%7 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_2 to i64))
br label LBL_3
LBL_3:
%8 = call i64 @FUNC(i64 40)
%9 = icmp eq i64 %0, %8
store i64 0, i64* %rax.0.reg2mem
br i1 %9, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_0, { 1, 0, 2 }
uselistorder label LBL_3, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__unsigned_int_fscanf_preinc_10-bad
|
CWE190_Integer_Overflow__unsigned_int_fscanf_preinc_10_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i32, align 4
%0 = call i64 @FUNC(i64 40)
store i32 0, i32* %sv_0, align 4
%1 = load i32, i32* @gv_0, align 4
%2 = icmp eq i32 %1, 0
br i1 %2, label LBL_3, label LBL_1
LBL_1:
%3 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8
%4 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %3, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i32* nonnull %sv_0)
%.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 i32, i32* %sv_0, align 4
%7 = add i32 %6, 1
store i32 %7, i32* %sv_0, align 4
%8 = zext i32 %7 to i64
%9 = call i64 @FUNC(i64 %8)
br label LBL_3
LBL_3:
%10 = call i64 @FUNC(i64 40)
%11 = icmp eq i64 %0, %10
store i64 0, i64* %rax.0.reg2mem
br i1 %11, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %sv_0, { 2, 1, 3, 0 }
uselistorder label LBL_3, { 1, 2, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE415_Double_Free__malloc_free_long_12-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64 @FUNC()
%1 = trunc i64 %0 to i32
%2 = icmp eq i32 %1, 0
%3 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32))
%4 = icmp eq i64* %3, null
%5 = icmp eq i1 %4, false
br i1 %2, label LBL_3, label LBL_1
LBL_1:
br i1 %5, label LBL_5, label LBL_2
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
br i1 %5, label LBL_5, label LBL_4
LBL_4:
call void @exit(i32 -1)
unreachable
LBL_5:
%6 = call i64 @FUNC()
call void @free(i64* %3)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i1 %5, { 1, 0 }
uselistorder void (i64*)* @free, { 2, 1, 0, 3 }
uselistorder void (i32)* @exit, { 2, 3, 1, 0, 4 }
uselistorder i64 ()* @globalReturnsTrueOrFalse, { 3, 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE194_Unexpected_Sign_Extension__negative_memcpy_01-bad
|
CWE194_Unexpected_Sign_Extension__negative_memcpy_01_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = 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 = call i64* @memcpy(i64* nonnull %sv_1, i64* nonnull %sv_0, i32 -1)
%4 = add i64 %0, -113
%5 = inttoptr i64 %4 to i8*
store i8 0, i8* %5, align 1
%6 = call i64 @FUNC(i64* nonnull %sv_1)
%7 = call i64 @FUNC(i64 40)
%8 = icmp eq i64 %1, %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
|
CWE190_Integer_Overflow__int_rand_square_01-good
|
goodB2G
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge.reg2mem = alloca i64
%0 = call i32 @rand()
%1 = urem i32 %0, 2
%2 = icmp eq i32 %1, 0
%3 = call i32 @rand()
%4 = mul i32 %3, 1073741824
%5 = call i32 @rand()
%6 = mul i32 %5, 32768
%7 = xor i32 %6, %4
%8 = call i32 @rand()
%9 = xor i32 %7, %8
%10 = sext i1 %2 to i32
%storemerge1.in = xor i32 %9, %10
%storemerge1.in.off = add i32 %storemerge1.in, 46339
%11 = icmp ugt i32 %storemerge1.in.off, 92678
br i1 %11, label LBL_2, label LBL_1
LBL_1:
%12 = mul i32 %storemerge1.in, %storemerge1.in
%13 = zext i32 %12 to i64
%14 = call i64 @FUNC(i64 %13)
store i64 %14, i64* %storemerge.reg2mem
br label LBL_3
LBL_2:
%15 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_0 to i64))
store i64 %15, i64* %storemerge.reg2mem
br label LBL_3
LBL_3:
%storemerge.reload = load i64, i64* %storemerge.reg2mem
ret i64 %storemerge.reload
uselistorder i32 %storemerge1.in, { 1, 2, 0 }
uselistorder i64* %storemerge.reg2mem, { 0, 2, 1 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__sizeof_int64_t_15-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64* @malloc(i32 8)
%1 = icmp eq i64* %0, null
%2 = icmp eq i1 %1, false
br i1 %2, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
store i64 2147483643, i64* %0, align 8
%3 = call i64 @FUNC(i64 2147483643)
call void @free(i64* %0)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i64 (i64)* @printLongLongLine, { 1, 0 }
uselistorder i64 2147483643, { 0, 2, 1, 3 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE680_Integer_Overflow_to_Buffer_Overflow__malloc_fgets_10-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge1.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
%spec.store.select = select i1 %1, i32 -1, i32 20
%2 = mul i32 %spec.store.select, 4
%3 = call i64* @malloc(i32 %2)
%4 = icmp eq i64* %3, null
%5 = icmp eq i1 %4, false
br i1 %5, label LBL_1, label LBL_2
LBL_1:
%6 = ptrtoint i64* %3 to i64
%7 = sext i32 %spec.store.select to i64
store i64 0, i64* %storemerge1.reg2mem
br label LBL_3
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%8 = mul i64 %storemerge1.reload, 4
%9 = add i64 %8, %6
%10 = inttoptr i64 %9 to i32*
store i32 0, i32* %10, align 4
%11 = add nuw i64 %storemerge1.reload, 1
%12 = icmp ult i64 %11, %7
store i64 %11, i64* %storemerge1.reg2mem
br i1 %12, label LBL_3, label LBL_4
LBL_4:
%13 = bitcast i64* %3 to i32*
%14 = load i32, i32* %13, align 4
%15 = zext i32 %14 to i64
%16 = call i64 @FUNC(i64 %15)
call void @free(i64* %3)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64* %3, { 0, 1, 3, 2 }
uselistorder i32 %spec.store.select, { 1, 0 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i64 (i64)* @printIntLine, { 1, 0 }
uselistorder i32 20, { 1, 0 }
uselistorder i32 -1, { 2, 1, 3, 0 }
uselistorder label LBL_3, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE190_Integer_Overflow__int_fgets_square_14-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
store i32 0, i32* %sv_0.0.reg2mem
br i1 %3, label LBL_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 = load i32, i32* @gv_2, align 4
%11 = icmp eq i32 %10, 5
br i1 %11, label LBL_6, label LBL_5
LBL_5:
%12 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_3 to i64))
br label LBL_9
LBL_6:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%sv_0.0.off = add i32 %sv_0.0.reload, 46339
%13 = icmp ugt i32 %sv_0.0.off, 92678
br i1 %13, label LBL_8, label LBL_7
LBL_7:
%14 = mul i32 %sv_0.0.reload, %sv_0.0.reload
%15 = zext i32 %14 to i64
%16 = call i64 @FUNC(i64 %15)
br label LBL_9
LBL_8:
%17 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_4 to i64))
br label LBL_9
LBL_9:
%18 = call i64 @FUNC(i64 40)
%19 = icmp eq i64 %0, %18
store i64 0, i64* %rax.0.reg2mem
br i1 %19, 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.reload, { 1, 0, 2 }
uselistorder i32* %sv_0.0.reg2mem, { 0, 2, 1, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE124_Buffer_Underwrite__malloc_char_loop_08-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC()
%2 = trunc i64 %1 to i32
%3 = icmp eq i32 %2, 0
store i64 0, i64* %sv_0.0.reg2mem
br i1 %3, label LBL_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
store i64 %7, i64* %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%11 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99)
%12 = ptrtoint i64* %sv_1 to i64
store i64 0, i64* %storemerge1.reg2mem
br label LBL_5
LBL_5:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%13 = add i64 %storemerge1.reload, %sv_0.0.reload
%14 = add i64 %storemerge1.reload, %12
%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 %storemerge1.reload, 1
%exitcond = icmp eq i64 %18, 100
store i64 %18, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_6, label LBL_5
LBL_6:
%19 = add i64 %sv_0.0.reload, 99
%20 = inttoptr i64 %19 to i8*
store i8 0, i8* %20, align 1
%21 = call i64 @FUNC(i64 %sv_0.0.reload)
%22 = call i64 @FUNC(i64 40)
%23 = icmp eq i64 %0, %22
store i64 0, i64* %rax.0.reg2mem
br i1 %23, label LBL_8, label LBL_7
LBL_7:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_8
LBL_8:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %storemerge1.reload, { 0, 2, 1 }
uselistorder i64 %sv_0.0.reload, { 1, 0, 2 }
uselistorder i64* %4, { 0, 2, 1 }
uselistorder i64* %sv_1, { 1, 0 }
uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 2, 3, 1, 0, 4 }
uselistorder i32 99, { 0, 1, 3, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE415_Double_Free__malloc_free_char_01-good
|
goodB2G
|
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:
call void @exit(i32 -1)
unreachable
LBL_2:
call void @free(i64* %0)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder void (i32)* @exit, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__src_char_alloca_cpy_01-bad
|
CWE121_Stack_Based_Buffer_Overflow__src_char_alloca_cpy_01_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
%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 99)
%7 = add i64 %3, 99
%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* @strcpy(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 }
}
|
1
|
juliet-test-suite-c
|
CWE252_Unchecked_Return_Value__char_rename_13-bad
|
CWE252_Unchecked_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 8376 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_2, 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
store i64 %5, i64* %rax.0.reg2mem
br label LBL_2
LBL_2:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
}
|
1
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_alloca_snprintf_13-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = ptrtoint i64* %sv_1 to i64
%1 = call i64 @FUNC(i64 40)
%2 = add i64 %0, -97
%3 = and i64 %2, -16
store i64 %3, i64* %sv_1, align 8
%4 = load i32, i32* inttoptr (i64 8364 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)
%13 = bitcast i64* %sv_0 to i8*
%14 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %13, i32 %12, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i8* %11)
%15 = call i64 @FUNC(i64 %3)
%16 = call i64 @FUNC(i64 40)
%17 = icmp eq i64 %1, %16
store i64 0, i64* %rax.0.reg2mem
br i1 %17, label LBL_5, label LBL_4
LBL_4:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_5
LBL_5:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %11, { 1, 0 }
uselistorder i64 %3, { 1, 3, 2, 0, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE457_Use_of_Uninitialized_Variable__struct_array_alloca_partial_init_05-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%indvars.iv.reg2mem = alloca i64
%indvars.iv4.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%0 = ptrtoint i64* %sv_0 to i64
%1 = call i64 @FUNC(i64 40)
%2 = add i64 %0, -81
%3 = and i64 %2, -16
%4 = load i32, i32* @gv_0, align 4
%5 = icmp eq i32 %4, 0
store i64 0, i64* %indvars.iv4.reg2mem
br i1 %5, label LBL_4, label LBL_1
LBL_1:
%indvars.iv4.reload = load i64, i64* %indvars.iv4.reg2mem
%6 = mul i64 %indvars.iv4.reload, 8
%7 = add i64 %6, %3
%8 = inttoptr i64 %7 to i32*
%9 = trunc i64 %indvars.iv4.reload to i32
store i32 %9, i32* %8, align 8
%10 = or i64 %7, 4
%11 = inttoptr i64 %10 to i32*
store i32 %9, i32* %11, align 4
%indvars.iv.next5 = add nuw nsw i64 %indvars.iv4.reload, 1
%exitcond6 = icmp eq i64 %indvars.iv.next5, 10
store i64 %indvars.iv.next5, i64* %indvars.iv4.reg2mem
br i1 %exitcond6, label LBL_2, label LBL_1
LBL_2:
%.pr = load i32, i32* @gv_0, align 4
%12 = icmp eq i32 %.pr, 0
store i64 0, i64* %indvars.iv.reg2mem
br i1 %12, label LBL_4, label LBL_3
LBL_3:
%indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem
%13 = mul i64 %indvars.iv.reload, 8
%14 = add i64 %13, %3
%15 = inttoptr i64 %14 to i32*
%16 = load i32, i32* %15, align 8
%17 = zext i32 %16 to i64
%18 = call i64 @FUNC(i64 %17)
%19 = or i64 %14, 4
%20 = inttoptr i64 %19 to i32*
%21 = load i32, i32* %20, align 4
%22 = zext i32 %21 to i64
%23 = call i64 @FUNC(i64 %22)
%indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1
%exitcond = icmp eq i64 %indvars.iv.next, 10
store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
%24 = call i64 @FUNC(i64 40)
%25 = icmp eq i64 %1, %24
store i64 0, i64* %rax.0.reg2mem
br i1 %25, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %indvars.iv4.reg2mem, { 2, 0, 1 }
uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 }
uselistorder i64 (i64)* @printIntLine, { 7, 6, 5, 4, 3, 2, 1, 0 }
uselistorder i64 10, { 1, 0, 3, 2, 5, 4, 7, 6 }
uselistorder i32* @gv_0, { 0, 5, 4, 1, 3, 2 }
uselistorder label LBL_4, { 0, 2, 1 }
uselistorder label LBL_3, { 1, 0 }
uselistorder label LBL_1, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE122_Heap_Based_Buffer_Overflow__CWE131_memcpy_14-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i64
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%2 = icmp eq i32 %1, 5
br i1 %2, label LBL_2, label LBL_1
LBL_1:
%3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
store i64 0, i64* %sv_0.0.reg2mem
br label LBL_4
LBL_2:
%4 = call i64* @malloc(i32 40)
%5 = ptrtoint i64* %4 to i64
%6 = icmp eq i64* %4, null
%7 = icmp eq i1 %6, false
store i64 %5, i64* %sv_0.0.reg2mem
br i1 %7, label LBL_4, label LBL_3
LBL_3:
call void @exit(i32 -1)
unreachable
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
store i64 0, i64* %sv_1, align 8
%8 = inttoptr i64 %sv_0.0.reload to i64*
%9 = call i64* @memcpy(i64* %8, i64* nonnull %sv_1, i32 40)
%10 = inttoptr i64 %sv_0.0.reload to i32*
%11 = load i32, i32* %10, align 4
%12 = zext i32 %11 to i64
%13 = call i64 @FUNC(i64 %12)
call void @free(i64* %8)
%14 = call i64 @FUNC(i64 40)
%15 = icmp eq i64 %0, %14
store i64 0, i64* %rax.0.reg2mem
br i1 %15, label LBL_6, label LBL_5
LBL_5:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_0.0.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE127_Buffer_Underread__char_alloca_memmove_10-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = ptrtoint i64* %sv_1 to i64
%1 = call i64 @FUNC(i64 40)
%2 = add i64 %0, -97
%3 = and i64 %2, -16
%4 = inttoptr i64 %3 to i64*
%5 = call i64* @memset(i64* %4, i32 65, i32 99)
%6 = add i64 %3, 99
%7 = inttoptr i64 %6 to i8*
store i8 0, i8* %7, align 1
%8 = load i32, i32* @gv_0, align 4
%9 = icmp eq i32 %8, 0
br i1 %9, label LBL_2, label LBL_1
LBL_1:
store i64 %3, i64* %sv_1, align 8
br label LBL_2
LBL_2:
%10 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%11 = load i64, i64* %sv_1, align 8
%12 = inttoptr i64 %11 to i64*
%13 = call i64* @memmove(i64* nonnull %sv_0, i64* %12, i32 100)
%14 = ptrtoint i64* %sv_0 to i64
%15 = call i64 @FUNC(i64 %14)
%16 = call i64 @FUNC(i64 40)
%17 = icmp eq i64 %1, %16
store i64 0, i64* %rax.0.reg2mem
br i1 %17, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64 %3, { 0, 2, 1 }
uselistorder i64* %sv_0, { 2, 0, 1 }
uselistorder i64* (i64*, i64*, i32)* @memmove, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 3, 2, 1, 0, 4 }
}
|
0
|
juliet-test-suite-c
|
CWE590_Free_Memory_Not_on_Heap__free_char_alloca_05-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%sv_0.0.reg2mem = alloca i64
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
store i64 0, i64* %sv_0.0.reg2mem
br i1 %1, label LBL_4, 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:
%5 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64))
call void @exit(i32 1)
unreachable
LBL_3:
%6 = ptrtoint i64* %2 to i64
%7 = call i64* @memset(i64* %2, i32 65, i32 99)
%8 = add i64 %6, 99
%9 = inttoptr i64 %8 to i8*
store i8 0, i8* %9, align 1
store i64 %6, i64* %sv_0.0.reg2mem
br label LBL_4
LBL_4:
%sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem
%10 = call i64 @FUNC(i64 %sv_0.0.reload)
%11 = inttoptr i64 %sv_0.0.reload to i64*
call void @free(i64* %11)
ret i64 ptrtoint (i32* @1 to i64)
uselistorder i64* %2, { 0, 2, 1 }
uselistorder void (i64*)* @free, { 1, 0, 2 }
uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 }
uselistorder void (i32)* @exit, { 1, 0, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_int64_t_alloca_loop_13-bad
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_int64_t_alloca_loop_13_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 = load i32, i32* inttoptr (i64 8336 to i32*), align 16
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_2, label LBL_1
LBL_1:
%4 = ptrtoint i64* %sv_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
%8 = bitcast i64* %sv_0 to i8*
call void @FUNC(i8* nonnull %8, i64 0, i64 100)
%9 = add i64 %7, -816
store i64 0, i64* %storemerge1.reg2mem
br label LBL_3
LBL_3:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%10 = mul i64 %storemerge1.reload, 8
%11 = load i64, i64* %sv_1, align 8
%12 = add i64 %11, %10
%13 = add i64 %9, %10
%14 = inttoptr i64 %13 to i64*
%15 = load i64, i64* %14, align 8
%16 = inttoptr i64 %12 to i64*
store i64 %15, i64* %16, align 8
%17 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %17, 100
store i64 %17, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
%18 = load i64, i64* %sv_1, align 8
%19 = inttoptr i64 %18 to i64*
%20 = load i64, i64* %19, align 8
%21 = call i64 @FUNC(i64 %20)
%22 = call i64 @FUNC(i64 40)
%23 = icmp eq i64 %0, %22
store i64 0, i64* %rax.0.reg2mem
br i1 %23, 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
|
CWE690_NULL_Deref_From_Return__fopen_08-good
|
goodB2G1
|
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 = 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_2 to i64))
store i64 %4, i64* %rax.0.reg2mem
br label LBL_4
LBL_2:
%5 = icmp eq %_IO_FILE* %0, null
store i64 %1, i64* %rax.0.reg2mem
br i1 %5, label LBL_4, label LBL_3
LBL_3:
%6 = call i32 @fclose(%_IO_FILE* nonnull %0)
%7 = sext i32 %6 to i64
store i64 %7, i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder %_IO_FILE* %0, { 1, 0 }
uselistorder i64* %rax.0.reg2mem, { 0, 2, 3, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE617_Reachable_Assertion__fixed_14-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.1.reg2mem = alloca i64
%0 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%1 = icmp eq i32 %0, 5
store i64 5, i64* %rax.1.reg2mem
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64))
call void @__assert_fail(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @gv_1, i64 0, i64 0), i8* getelementptr inbounds ([127 x i8], [127 x i8]* @gv_2, i64 0, i64 0), i32 60, i8* getelementptr inbounds ([9 x i8], [9 x i8]* @gv_3, i64 0, i64 0))
store i64 ptrtoint (i32* @1 to i64), i64* %rax.1.reg2mem
br label LBL_2
LBL_2:
%rax.1.reload = load i64, i64* %rax.1.reg2mem
ret i64 %rax.1.reload
uselistorder i64* %rax.1.reg2mem, { 0, 2, 1 }
uselistorder label LBL_2, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__CWE170_char_strncpy_12-bad
|
CWE126_Buffer_Overread__CWE170_char_strncpy_12_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64 @FUNC()
%2 = call i64* @memset(i64* nonnull %sv_0, i32 65, i32 149)
%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 = call i64 @FUNC(i64* nonnull %sv_1)
%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
|
CWE761_Free_Pointer_Not_at_Start_of_Buffer__char_environment_07-bad
|
CWE761_Free_Pointer_Not_at_Start_of_Buffer__char_environment_07_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.04.reg2mem = alloca i8*
%sv_0.05.reg2mem = alloca i8*
%.reg2mem = alloca i8
%0 = call i64* @malloc(i32 100)
%1 = icmp eq i64* %0, null
%2 = icmp eq i1 %1, false
br i1 %2, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%3 = bitcast i64* %0 to i8*
store i8 0, i8* %3, align 1
%4 = call i32 @strlen(i8* %3)
%5 = call i8* @getenv(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_0, i64 0, i64 0))
%6 = icmp eq i8* %5, null
br i1 %6, label LBL_4, label LBL_3
LBL_3:
%7 = sext i32 %4 to i64
%8 = ptrtoint i64* %0 to i64
%9 = add i64 %7, %8
%10 = inttoptr i64 %9 to i8*
%11 = sub i32 99, %4
%12 = call i8* @strncat(i8* %10, i8* nonnull %5, i32 %11)
br label LBL_4
LBL_4:
%13 = load i32, i32* @gv_1, align 4
%14 = zext i32 %13 to i64
%15 = icmp eq i32 %13, 5
%16 = icmp eq i1 %15, false
store i64 %14, i64* %rax.0.reg2mem
br i1 %16, label LBL_10, label LBL_5
LBL_5:
%17 = load i8, i8* %3, align 1
%18 = icmp eq i8 %17, 0
%19 = icmp eq i1 %18, false
store i8 %17, i8* %.reg2mem
store i8* %3, i8** %sv_0.05.reg2mem
store i8* %3, i8** %sv_0.04.reg2mem
br i1 %19, label LBL_6, label LBL_9
LBL_6:
%sv_0.05.reload = load i8*, i8** %sv_0.05.reg2mem
%.reload = load i8, i8* %.reg2mem
%20 = icmp eq i8 %.reload, 83
%21 = icmp eq i1 %20, false
br i1 %21, label LBL_8, label LBL_7
LBL_7:
%22 = call i64 @FUNC(i64 ptrtoint ([17 x i8]* @gv_2 to i64))
store i8* %sv_0.05.reload, i8** %sv_0.04.reg2mem
br label LBL_9
LBL_8:
%23 = ptrtoint i8* %sv_0.05.reload to i64
%24 = add i64 %23, 1
%25 = inttoptr i64 %24 to i8*
%26 = load i8, i8* %25, align 1
%27 = icmp eq i8 %26, 0
%28 = icmp eq i1 %27, false
store i8 %26, i8* %.reg2mem
store i8* %25, i8** %sv_0.05.reg2mem
store i8* %25, i8** %sv_0.04.reg2mem
br i1 %28, label LBL_6, label LBL_9
LBL_9:
%sv_0.04.reload = load i8*, i8** %sv_0.04.reg2mem
%29 = bitcast i8* %sv_0.04.reload to i64*
call void @free(i64* %29)
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_10
LBL_10:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i8* %sv_0.05.reload, { 1, 0 }
uselistorder i8* %3, { 0, 1, 2, 4, 3 }
uselistorder i64* %0, { 0, 2, 1 }
uselistorder i8* %.reg2mem, { 2, 0, 1 }
uselistorder i8** %sv_0.05.reg2mem, { 2, 0, 1 }
uselistorder i8** %sv_0.04.reg2mem, { 0, 1, 3, 2 }
uselistorder i8 0, { 1, 0, 2, 3 }
uselistorder label LBL_9, { 0, 2, 1 }
uselistorder label LBL_6, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE690_NULL_Deref_From_Return__long_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)* @printLongLine, { 1, 0 }
uselistorder i64 5, { 0, 2, 1, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE400_Resource_Exhaustion__connect_socket_for_loop_13-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge9.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = call i64 @FUNC(i64 40)
%1 = load i32, i32* inttoptr (i64 8376 to i32*), align 8
%2 = icmp eq i32 %1, 5
%3 = icmp eq i1 %2, false
br i1 %3, label LBL_8, label LBL_1
LBL_1:
%4 = call i32 @socket(i32 2, i32 1, i32 6)
%5 = icmp eq i32 %4, -1
br i1 %5, label LBL_8, label LBL_2
LBL_2:
%6 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16)
store i64 2, i64* %sv_1, align 8
%7 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0))
%8 = call i16 @htons(i16 27015)
%9 = bitcast i64* %sv_1 to %sockaddr*
%10 = call i32 @connect(i32 %4, %sockaddr* nonnull %9, i32 16)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_4, label LBL_3
LBL_3:
%12 = call i32 @recv(i32 %4, i64* nonnull %sv_0, i32 13, i32 0)
%13 = add i32 %12, 1
%14 = icmp ult i32 %13, 2
br i1 %14, label LBL_4, label LBL_5
LBL_4:
%15 = call i32 @close(i32 %4)
br label LBL_8
LBL_5:
%16 = ptrtoint i64* %sv_2 to i64
%17 = sext i32 %12 to i64
%18 = add i64 %16, -22
%19 = add i64 %18, %17
%20 = inttoptr i64 %19 to i8*
store i8 0, i8* %20, align 1
%21 = bitcast i64* %sv_0 to i8*
%22 = call i32 @atoi(i8* nonnull %21)
%23 = call i32 @close(i32 %4)
%sv_3.1.off = add i32 %22, -1
%24 = icmp ugt i32 %sv_3.1.off, 19
br i1 %24, label LBL_8, label LBL_6
LBL_6:
%25 = sext i32 %22 to i64
store i64 0, i64* %storemerge9.reg2mem
br label LBL_7
LBL_7:
%storemerge9.reload = load i64, i64* %storemerge9.reg2mem
%26 = call i64 @FUNC(i64 ptrtoint ([6 x i8]* @gv_1 to i64))
%27 = add nuw i64 %storemerge9.reload, 1
%28 = icmp ult i64 %27, %25
store i64 %27, i64* %storemerge9.reg2mem
br i1 %28, label LBL_7, label LBL_8
LBL_8:
%29 = call i64 @FUNC(i64 40)
%30 = icmp eq i64 %0, %29
store i64 0, i64* %rax.0.reg2mem
br i1 %30, label LBL_10, label LBL_9
LBL_9:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_10
LBL_10:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %22, { 1, 0 }
uselistorder i32 %12, { 1, 0 }
uselistorder i32 %4, { 3, 0, 1, 2, 4 }
uselistorder i64* %sv_1, { 0, 2, 1 }
uselistorder i64* %storemerge9.reg2mem, { 1, 0, 2 }
uselistorder label LBL_8, { 0, 4, 3, 1, 2 }
uselistorder label LBL_7, { 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE415_Double_Free__malloc_free_int64_t_07-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%.reg2mem = alloca i32
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 5
%2 = icmp eq i1 %1, false
store i32 %0, i32* %.reg2mem
br i1 %2, label LBL_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)
%.pr = load i32, i32* @gv_0, align 4
store i32 %.pr, i32* %.reg2mem
br label LBL_4
LBL_4:
%.reload = load i32, i32* %.reg2mem
%6 = icmp eq i32 %.reload, 5
store i64 5, i64* %rax.0.reg2mem
br i1 %6, label LBL_6, label LBL_5
LBL_5:
%7 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64))
store i64 %7, i64* %rax.0.reg2mem
br label LBL_6
LBL_6:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32* %.reg2mem, { 0, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE126_Buffer_Overread__CWE129_listen_socket_14-bad
|
CWE126_Buffer_Overread__CWE129_listen_socket_14_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.1.reg2mem = alloca i32
%sv_0.0.ph.reg2mem = alloca i32
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%sv_3 = alloca i64, align 8
%0 = ptrtoint i64* %sv_3 to i64
%1 = call i64 @FUNC(i64 40)
%2 = load i32, i32* inttoptr (i64 16404 to i32*), align 4
%3 = icmp eq i32 %2, 5
%4 = icmp eq i1 %3, false
store i32 -1, i32* %sv_0.1.reg2mem
br i1 %4, label LBL_9, label LBL_1
LBL_1:
%5 = call i32 @socket(i32 2, i32 1, i32 6)
%6 = icmp eq i32 %5, -1
store i32 -1, i32* %sv_0.1.reg2mem
br i1 %6, label LBL_9, label LBL_2
LBL_2:
%7 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16)
store i64 2, i64* %sv_2, align 8
%8 = call i16 @htons(i16 27015)
%9 = bitcast i64* %sv_2 to %sockaddr*
%10 = call i32 @bind(i32 %5, %sockaddr* nonnull %9, i32 16)
%11 = icmp eq i32 %10, -1
br i1 %11, label LBL_7, label LBL_3
LBL_3:
%12 = call i32 @listen(i32 %5, i32 5)
%13 = icmp eq i32 %12, -1
br i1 %13, label LBL_7, label LBL_4
LBL_4:
%14 = call i32 @accept(i32 %5, %sockaddr* null, i32* null)
%15 = icmp eq i32 %14, -1
br i1 %15, label LBL_7, label LBL_5
LBL_5:
%16 = call i32 @recv(i32 %14, i64* nonnull %sv_1, i32 13, i32 0)
%17 = add i32 %16, 1
%18 = icmp ult i32 %17, 2
store i32 -1, i32* %sv_0.0.ph.reg2mem
br i1 %18, label LBL_8, label LBL_6
LBL_6:
%19 = sext i32 %16 to i64
%20 = add i64 %0, -22
%21 = add i64 %20, %19
%22 = inttoptr i64 %21 to i8*
store i8 0, i8* %22, align 1
%23 = bitcast i64* %sv_1 to i8*
%24 = call i32 @atoi(i8* nonnull %23)
store i32 %24, i32* %sv_0.0.ph.reg2mem
br label LBL_8
LBL_7:
%25 = call i32 @close(i32 %5)
store i32 -1, i32* %sv_0.1.reg2mem
br label LBL_9
LBL_8:
%sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem
%26 = call i32 @close(i32 %5)
%27 = call i32 @close(i32 %14)
store i32 %sv_0.0.ph.reload, i32* %sv_0.1.reg2mem
br label LBL_9
LBL_9:
%28 = load i32, i32* @gv_0, align 4
%29 = icmp eq i32 %28, 5
%30 = icmp eq i1 %29, false
br i1 %30, label LBL_13, label LBL_10
LBL_10:
%sv_0.1.reload = load i32, i32* %sv_0.1.reg2mem
store i64 0, i64* %sv_2, align 8
%31 = icmp slt i32 %sv_0.1.reload, 0
br i1 %31, label LBL_12, label LBL_11
LBL_11:
%32 = sext i32 %sv_0.1.reload to i64
%33 = mul i64 %32, 4
%34 = add i64 %0, -64
%35 = add i64 %34, %33
%36 = inttoptr i64 %35 to i32*
%37 = load i32, i32* %36, align 4
%38 = zext i32 %37 to i64
%39 = call i64 @FUNC(i64 %38)
br label LBL_13
LBL_12:
%40 = call i64 @FUNC(i64 ptrtoint ([31 x i8]* @gv_1 to i64))
br label LBL_13
LBL_13:
%41 = call i64 @FUNC(i64 40)
%42 = icmp eq i64 %1, %41
store i64 0, i64* %rax.0.reg2mem
br i1 %42, 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 %16, { 1, 0 }
uselistorder i32 %5, { 4, 0, 1, 2, 3, 5 }
uselistorder i64 %0, { 1, 0 }
uselistorder i64* %sv_2, { 2, 0, 3, 1 }
uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 1 }
uselistorder i32* %sv_0.1.reg2mem, { 0, 3, 2, 1, 4 }
uselistorder i32 (i32)* @close, { 2, 1, 0, 3 }
uselistorder i32 -1, { 1, 3, 4, 5, 6, 0, 7, 2 }
uselistorder i32 5, { 0, 2, 1, 3 }
uselistorder label LBL_9, { 2, 1, 0, 3 }
}
|
1
|
juliet-test-suite-c
|
CWE127_Buffer_Underread__malloc_char_ncpy_04-good
|
goodG2B1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i8*, align 8
%0 = call i64 @FUNC(i64 40)
%1 = call i64* @malloc(i32 100)
%2 = bitcast i64* %1 to i8*
store i8* %2, i8** %sv_1, align 8
%3 = icmp eq i64* %1, null
%4 = icmp eq i1 %3, false
br i1 %4, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%5 = call i64* @memset(i64* %1, i32 65, i32 99)
%6 = ptrtoint i64* %1 to i64
%7 = add i64 %6, 99
%8 = inttoptr i64 %7 to i8*
store i8 0, i8* %8, align 1
%9 = load i8*, i8** %sv_1, align 8
%10 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99)
%11 = bitcast i64* %sv_0 to i8*
%12 = call i32 @strlen(i8* nonnull %11)
%13 = call i8* @strncpy(i8* nonnull %11, i8* %9, i32 %12)
%14 = ptrtoint i64* %sv_0 to i64
%15 = call i64 @FUNC(i64 %14)
%16 = call i64 @FUNC(i64 40)
%17 = icmp eq i64 %0, %16
store i64 0, i64* %rax.0.reg2mem
br i1 %17, label LBL_4, label LBL_3
LBL_3:
call void @__stack_chk_fail()
store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem
br label LBL_4
LBL_4:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i64* %sv_0, { 2, 0, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__char_rand_sub_05-good
|
goodB2G1
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%sv_0.0.reg2mem = alloca i32
%0 = load i32, i32* @gv_0, align 4
%1 = icmp eq i32 %0, 0
store i32 32, i32* %sv_0.0.reg2mem
br i1 %1, label LBL_2, label LBL_1
LBL_1:
%2 = call i32 @rand()
%3 = urem i32 %2, 2
%4 = icmp eq i32 %3, 0
%5 = call i32 @rand()
%6 = call i32 @rand()
%7 = call i32 @rand()
%8 = sext i1 %4 to i32
%storemerge = xor i32 %7, %8
%sext = mul i32 %storemerge, 16777216
%9 = ashr exact i32 %sext, 24
store i32 %9, i32* %sv_0.0.reg2mem
br label LBL_2
LBL_2:
%10 = load i32, i32* @gv_1, align 4
%11 = icmp eq i32 %10, 0
br i1 %11, label LBL_4, label LBL_3
LBL_3:
%12 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64))
store i64 %12, i64* %rax.0.reg2mem
br label LBL_7
LBL_4:
%sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem
%13 = trunc i32 %sv_0.0.reload to i8
%14 = icmp eq i8 %13, -128
br i1 %14, label LBL_6, label LBL_5
LBL_5:
%15 = mul i32 %sv_0.0.reload, 16777216
%sext2 = add i32 %15, -16777216
%16 = ashr exact i32 %sext2, 24
%17 = zext i32 %16 to i64
%18 = call i64 @FUNC(i64 %17)
store i64 %18, i64* %rax.0.reg2mem
br label LBL_7
LBL_6:
%19 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_3 to i64))
store i64 %19, i64* %rax.0.reg2mem
br label LBL_7
LBL_7:
%rax.0.reload = load i64, i64* %rax.0.reg2mem
ret i64 %rax.0.reload
uselistorder i32 %sv_0.0.reload, { 1, 0 }
uselistorder i64* %rax.0.reg2mem, { 0, 3, 2, 1 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_int64_t_declare_loop_03-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%storemerge1.reg2mem = alloca i64
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%sv_2 = alloca i64, align 8
%0 = ptrtoint i64* %sv_2 to i64
%1 = call i64 @FUNC(i64 40)
%2 = ptrtoint i64* %sv_1 to i64
%3 = bitcast i64* %sv_0 to i8*
call void @FUNC(i8* nonnull %3, i64 0, i64 100)
%4 = add i64 %0, -816
store i64 0, i64* %storemerge1.reg2mem
br label LBL_1
LBL_1:
%storemerge1.reload = load i64, i64* %storemerge1.reg2mem
%5 = mul i64 %storemerge1.reload, 8
%6 = add i64 %5, %2
%7 = add i64 %4, %5
%8 = inttoptr i64 %7 to i64*
%9 = load i64, i64* %8, align 8
%10 = inttoptr i64 %6 to i64*
store i64 %9, i64* %10, align 8
%11 = add nuw nsw i64 %storemerge1.reload, 1
%exitcond = icmp eq i64 %11, 100
store i64 %11, i64* %storemerge1.reg2mem
br i1 %exitcond, label LBL_2, label LBL_1
LBL_2:
%12 = load i64, i64* %sv_1, align 8
%13 = call i64 @FUNC(i64 %12)
%14 = call i64 @FUNC(i64 40)
%15 = icmp eq i64 %1, %14
store i64 0, i64* %rax.0.reg2mem
br i1 %15, label LBL_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 (i64)* @printLongLongLine, { 1, 0 }
uselistorder i64 100, { 0, 2, 1, 3 }
}
|
0
|
juliet-test-suite-c
|
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_declare_loop_05-good
|
goodG2B2
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = alloca i64
%rax.0.reg2mem = alloca i64
%storemerge2.reg2mem = alloca i64
%storemerge13.reg2mem = alloca i64
%1 = load i64, i64* %0
%sv_0 = alloca i64, align 8
%sv_1 = alloca i64, align 8
%2 = ptrtoint i64* %sv_1 to i64
%3 = call i64 @FUNC(i64 40)
%4 = load i32, i32* @gv_0, align 4
%5 = add i64 %2, -816
%6 = add i64 %2, -812
store i64 0, i64* %storemerge13.reg2mem
br label LBL_1
LBL_1:
%storemerge13.reload = load i64, i64* %storemerge13.reg2mem
%7 = mul i64 %storemerge13.reload, 8
%8 = add i64 %7, %5
%9 = inttoptr i64 %8 to i32*
store i32 0, i32* %9, align 8
%10 = add i64 %6, %7
%11 = inttoptr i64 %10 to i32*
store i32 0, i32* %11, align 4
%12 = add nuw nsw i64 %storemerge13.reload, 1
%exitcond4 = icmp eq i64 %12, 100
store i64 %12, i64* %storemerge13.reg2mem
br i1 %exitcond4, label LBL_2, label LBL_1
LBL_2:
%13 = ptrtoint i64* %sv_0 to i64
%14 = icmp eq i32 %4, 0
%spec.select = select i1 %14, i64 %1, i64 %13
store i64 0, i64* %storemerge2.reg2mem
br label LBL_3
LBL_3:
%storemerge2.reload = load i64, i64* %storemerge2.reg2mem
%15 = mul i64 %storemerge2.reload, 8
%16 = add i64 %15, %spec.select
%17 = add i64 %15, %5
%18 = inttoptr i64 %17 to i64*
%19 = load i64, i64* %18, align 8
%20 = inttoptr i64 %16 to i64*
store i64 %19, i64* %20, align 8
%21 = add nuw nsw i64 %storemerge2.reload, 1
%exitcond = icmp eq i64 %21, 100
store i64 %21, i64* %storemerge2.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
%22 = call i64 @FUNC(i64 %spec.select)
%23 = call i64 @FUNC(i64 40)
%24 = icmp eq i64 %3, %23
store i64 0, i64* %rax.0.reg2mem
br i1 %24, 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 %15, { 1, 0 }
uselistorder i64 %spec.select, { 1, 0 }
uselistorder i64 %7, { 1, 0 }
uselistorder i64* %storemerge13.reg2mem, { 1, 0, 2 }
uselistorder i64* %storemerge2.reg2mem, { 1, 0, 2 }
uselistorder i64 (i64)* @printStructLine, { 1, 0 }
uselistorder i64 100, { 1, 0, 3, 2 }
}
|
0
|
juliet-test-suite-c
|
CWE191_Integer_Underflow__unsigned_int_min_sub_12-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%0 = call i64 @FUNC()
%1 = call i64 @FUNC()
%2 = call i64 @FUNC(i64 4294967293)
ret i64 %2
uselistorder i64 ()* @globalReturnsTrueOrFalse, { 3, 2, 1, 0 }
}
|
0
|
juliet-test-suite-c
|
CWE401_Memory_Leak__malloc_realloc_char_17-bad
|
CWE401_Memory_Leak__malloc_realloc_char_17_bad
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%rax.0.reg2mem = alloca i64
%0 = call i64* @malloc(i32 100)
%1 = icmp eq i64* %0, null
%2 = icmp eq i1 %1, false
br i1 %2, label LBL_2, label LBL_1
LBL_1:
call void @exit(i32 -1)
unreachable
LBL_2:
%3 = ptrtoint i64* %0 to i64
store i64 7453010373643542593, i64* %0, align 8
%4 = add i64 %3, 8
%5 = inttoptr i64 %4 to i8*
store i8 0, i8* %5, align 1
%6 = call i64 @FUNC(i64 %3)
%7 = call i64* @realloc(i64* %0, i32 130000)
%8 = ptrtoint i64* %7 to i64
%9 = icmp eq i64* %7, null
store i64 %8, i64* %rax.0.reg2mem
br i1 %9, label LBL_4, label LBL_3
LBL_3:
store i64 7598263421703251278, i64* %7, align 8
%10 = add i64 %8, 8
%11 = inttoptr i64 %10 to i16*
store i16 26478, i16* %11, align 2
%12 = add i64 %8, 10
%13 = inttoptr i64 %12 to i8*
store i8 0, i8* %13, align 1
%14 = call i64 @FUNC(i64 %8)
call void @free(i64* nonnull %7)
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, 2, 3, 0 }
uselistorder i64* %0, { 0, 1, 3, 2 }
uselistorder label LBL_4, { 1, 0 }
}
|
1
|
juliet-test-suite-c
|
CWE416_Use_After_Free__malloc_free_int_18-good
|
goodG2B
|
define i64 @FUNC() local_unnamed_addr {
LBL_0:
%storemerge2.reg2mem = alloca i64
%0 = call i64* @malloc(i32 400)
%1 = icmp eq i64* %0, null
%2 = icmp eq i1 %1, false
br i1 %2, label LBL_1, label LBL_2
LBL_1:
%3 = bitcast i64* %0 to i32*
%4 = ptrtoint i64* %0 to i64
store i64 0, i64* %storemerge2.reg2mem
br label LBL_3
LBL_2:
call void @exit(i32 -1)
unreachable
LBL_3:
%storemerge2.reload = load i64, i64* %storemerge2.reg2mem
%5 = mul i64 %storemerge2.reload, 4
%6 = add i64 %5, %4
%7 = inttoptr i64 %6 to i32*
store i32 5, i32* %7, align 4
%8 = add nuw nsw i64 %storemerge2.reload, 1
%exitcond = icmp eq i64 %8, 100
store i64 %8, i64* %storemerge2.reg2mem
br i1 %exitcond, label LBL_4, label LBL_3
LBL_4:
%9 = load i32, i32* %3, align 4
%10 = zext i32 %9 to i64
%11 = call i64 @FUNC(i64 %10)
ret i64 %11
uselistorder i64* %0, { 0, 2, 1 }
uselistorder i64* %storemerge2.reg2mem, { 1, 0, 2 }
uselistorder i64* (i32)* @malloc, { 1, 0, 2 }
}
|
0
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.