1 ; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
2 ; RUN: opt < %s "-passes=print<scalar-evolution>" -disable-output -scalar-evolution-classify-expressions=0 2>&1 | FileCheck %s
4 ; ScalarEvolution can't compute a trip count because it doesn't know if
5 ; dividing by the stride will have a remainder. This could theoretically
6 ; be teaching it how to use a more elaborate trip count computation.
8 %struct.FILE = type { i32, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, i32, i32, i64, i16, i8, [1 x i8], ptr, i64, ptr, ptr, ptr, ptr, i64, i32, [20 x i8] }
9 %struct.SHA_INFO = type { [5 x i32], i32, i32, [16 x i32] }
10 %struct._IO_marker = type { ptr, ptr, i32 }
12 @_2E_str = external constant [26 x i8]
13 @stdin = external global ptr
14 @_2E_str1 = external constant [3 x i8]
15 @_2E_str12 = external constant [30 x i8]
17 declare void @sha_init(ptr nocapture) nounwind
19 declare fastcc void @sha_transform(ptr nocapture) nounwind
21 declare void @sha_print(ptr nocapture) nounwind
23 declare i32 @printf(ptr nocapture, ...) nounwind
25 declare void @sha_final(ptr nocapture) nounwind
27 declare void @sha_update(ptr nocapture, ptr nocapture, i32) nounwind
29 declare i64 @fread(ptr noalias nocapture, i64, i64, ptr noalias nocapture) nounwind
31 declare i32 @main(i32, ptr nocapture) nounwind
33 declare noalias ptr @fopen(ptr noalias nocapture, ptr noalias nocapture) nounwind
35 declare i32 @fclose(ptr nocapture) nounwind
37 declare void @sha_stream(ptr nocapture, ptr nocapture) nounwind
39 define void @sha_stream_bb3_2E_i(ptr %sha_info, ptr %data1, i32, ptr %buffer_addr.0.i.out, ptr %count_addr.0.i.out) nounwind {
40 ; CHECK-LABEL: 'sha_stream_bb3_2E_i'
41 ; CHECK-NEXT: Determining loop execution counts for: @sha_stream_bb3_2E_i
42 ; CHECK-NEXT: Loop %bb3.i: backedge-taken count is ((63 + (-1 * (63 smin %0)) + %0) /u 64)
43 ; CHECK-NEXT: Loop %bb3.i: constant max backedge-taken count is 33554431
44 ; CHECK-NEXT: Loop %bb3.i: symbolic max backedge-taken count is ((63 + (-1 * (63 smin %0)) + %0) /u 64)
45 ; CHECK-NEXT: Loop %bb3.i: Predicated backedge-taken count is ((63 + (-1 * (63 smin %0)) + %0) /u 64)
46 ; CHECK-NEXT: Predicates:
47 ; CHECK-NEXT: Loop %bb3.i: Trip multiple is 1
52 sha_update.exit.exitStub: ; preds = %bb3.i
53 store ptr %buffer_addr.0.i, ptr %buffer_addr.0.i.out
54 store i32 %count_addr.0.i, ptr %count_addr.0.i.out
57 bb2.i: ; preds = %bb3.i
58 %1 = getelementptr %struct.SHA_INFO, ptr %sha_info, i64 0, i32 3
59 call void @llvm.memcpy.p0.p0.i64(ptr %1, ptr %buffer_addr.0.i, i64 64, i1 false)
60 %2 = getelementptr %struct.SHA_INFO, ptr %sha_info, i64 0, i32 3, i64 0
63 codeRepl: ; preds = %bb2.i
64 call void @sha_stream_bb3_2E_i_bb1_2E_i_2E_i(ptr %2)
65 br label %byte_reverse.exit.i
67 byte_reverse.exit.i: ; preds = %codeRepl
68 call fastcc void @sha_transform(ptr %sha_info) nounwind
69 %3 = getelementptr i8, ptr %buffer_addr.0.i, i64 64
70 %4 = add i32 %count_addr.0.i, -64
73 bb3.i: ; preds = %byte_reverse.exit.i, %newFuncRoot
74 %buffer_addr.0.i = phi ptr [ %data1, %newFuncRoot ], [ %3, %byte_reverse.exit.i ]
75 %count_addr.0.i = phi i32 [ %0, %newFuncRoot ], [ %4, %byte_reverse.exit.i ]
76 %5 = icmp sgt i32 %count_addr.0.i, 63
77 br i1 %5, label %bb2.i, label %sha_update.exit.exitStub
80 declare void @sha_stream_bb3_2E_i_bb1_2E_i_2E_i(ptr) nounwind
82 declare void @llvm.memset.p0.i64(ptr nocapture, i8, i64, i1) nounwind
84 declare void @llvm.memcpy.p0.p0.i64(ptr nocapture, ptr nocapture, i64, i1) nounwind