1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py 2; RUN: opt < %s -scalar-evolution -analyze -scalar-evolution-classify-expressions=0 | FileCheck %s 3 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. 7 8%struct.FILE = type { i32, i8*, i8*, i8*, i8*, i8*, i8*, i8*, i8*, i8*, i8*, i8*, %struct._IO_marker*, %struct.FILE*, i32, i32, i64, i16, i8, [1 x i8], i8*, i64, i8*, i8*, i8*, i8*, i64, i32, [20 x i8] } 9%struct.SHA_INFO = type { [5 x i32], i32, i32, [16 x i32] } 10%struct._IO_marker = type { %struct._IO_marker*, %struct.FILE*, i32 } 11 12@_2E_str = external constant [26 x i8] 13@stdin = external global %struct.FILE* 14@_2E_str1 = external constant [3 x i8] 15@_2E_str12 = external constant [30 x i8] 16 17declare void @sha_init(%struct.SHA_INFO* nocapture) nounwind 18 19declare fastcc void @sha_transform(%struct.SHA_INFO* nocapture) nounwind 20 21declare void @sha_print(%struct.SHA_INFO* nocapture) nounwind 22 23declare i32 @printf(i8* nocapture, ...) nounwind 24 25declare void @sha_final(%struct.SHA_INFO* nocapture) nounwind 26 27declare void @sha_update(%struct.SHA_INFO* nocapture, i8* nocapture, i32) nounwind 28 29declare i64 @fread(i8* noalias nocapture, i64, i64, %struct.FILE* noalias nocapture) nounwind 30 31declare i32 @main(i32, i8** nocapture) nounwind 32 33declare noalias %struct.FILE* @fopen(i8* noalias nocapture, i8* noalias nocapture) nounwind 34 35declare i32 @fclose(%struct.FILE* nocapture) nounwind 36 37declare void @sha_stream(%struct.SHA_INFO* nocapture, %struct.FILE* nocapture) nounwind 38 39define void @sha_stream_bb3_2E_i(%struct.SHA_INFO* %sha_info, i8* %data1, i32, i8** %buffer_addr.0.i.out, i32* %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: max backedge-taken count is 33554431 44; CHECK-NEXT: Loop %bb3.i: Predicated backedge-taken count is ((63 + (-1 * (63 smin %0)) + %0) /u 64) 45; CHECK-NEXT: Predicates: 46; CHECK: Loop %bb3.i: Trip multiple is 1 47; 48newFuncRoot: 49 br label %bb3.i 50 51sha_update.exit.exitStub: ; preds = %bb3.i 52 store i8* %buffer_addr.0.i, i8** %buffer_addr.0.i.out 53 store i32 %count_addr.0.i, i32* %count_addr.0.i.out 54 ret void 55 56bb2.i: ; preds = %bb3.i 57 %1 = getelementptr %struct.SHA_INFO, %struct.SHA_INFO* %sha_info, i64 0, i32 3 58 %2 = bitcast [16 x i32]* %1 to i8* 59 call void @llvm.memcpy.p0i8.p0i8.i64(i8* %2, i8* %buffer_addr.0.i, i64 64, i1 false) 60 %3 = getelementptr %struct.SHA_INFO, %struct.SHA_INFO* %sha_info, i64 0, i32 3, i64 0 61 %4 = bitcast i32* %3 to i8* 62 br label %codeRepl 63 64codeRepl: ; preds = %bb2.i 65 call void @sha_stream_bb3_2E_i_bb1_2E_i_2E_i(i8* %4) 66 br label %byte_reverse.exit.i 67 68byte_reverse.exit.i: ; preds = %codeRepl 69 call fastcc void @sha_transform(%struct.SHA_INFO* %sha_info) nounwind 70 %5 = getelementptr i8, i8* %buffer_addr.0.i, i64 64 71 %6 = add i32 %count_addr.0.i, -64 72 br label %bb3.i 73 74bb3.i: ; preds = %byte_reverse.exit.i, %newFuncRoot 75 %buffer_addr.0.i = phi i8* [ %data1, %newFuncRoot ], [ %5, %byte_reverse.exit.i ] 76 %count_addr.0.i = phi i32 [ %0, %newFuncRoot ], [ %6, %byte_reverse.exit.i ] 77 %7 = icmp sgt i32 %count_addr.0.i, 63 78 br i1 %7, label %bb2.i, label %sha_update.exit.exitStub 79} 80 81declare void @sha_stream_bb3_2E_i_bb1_2E_i_2E_i(i8*) nounwind 82 83declare void @llvm.memset.p0i8.i64(i8* nocapture, i8, i64, i1) nounwind 84 85declare void @llvm.memcpy.p0i8.p0i8.i64(i8* nocapture, i8* nocapture, i64, i1) nounwind 86 87