fbfd327fdf
Sometimes if llvm-reduce is interrupted in the middle of a delta pass on a large file, it can take quite some time for the tool to start actually doing new work if it is restarted again on the partially-reduced file. A lot of time ends up being spent testing large chunks when these large chunks are very unlikely to actually pass the interestingness test. In cases like this, the tool will complete faster if the starting granularity is reduced to a finer amount. Thus, we introduce a command line flag that automatically divides the chunks into smaller subsets a fixed, user-specified number of times prior to beginning the core loop. Reviewed By: aeubanks Differential Revision: https://reviews.llvm.org/D112651
31 lines
891 B
LLVM
31 lines
891 B
LLVM
; Test that llvm-reduce produces the same output when starting at a higher granularity level.
|
|
;
|
|
; RUN: llvm-reduce --delta-passes=functions,instructions --starting-granularity-level=2 --test FileCheck --test-arg --check-prefixes=CHECK-ALL,CHECK-INTERESTINGNESS --test-arg %s --test-arg --input-file %s -o %t
|
|
; RUN: cat %t | FileCheck -implicit-check-not=uninteresting --check-prefixes=CHECK-ALL,CHECK-FINAL %s
|
|
|
|
define i32 @uninteresting1() {
|
|
entry:
|
|
ret i32 0
|
|
}
|
|
|
|
; CHECK-ALL-LABEL: interesting()
|
|
define i32 @interesting() {
|
|
entry:
|
|
; CHECK-INTERESTINGNESS: call i32 @interesting()
|
|
%call2 = call i32 @interesting()
|
|
%call = call i32 @uninteresting1()
|
|
ret i32 5
|
|
}
|
|
|
|
; CHECK-FINAL-NEXT: entry:
|
|
; CHECK-FINAL-NEXT: %call2 = call i32 @interesting()
|
|
; CHECK-FINAL-NEXT: ret i32 5
|
|
; CHECK-FINAL-NEXT: }
|
|
|
|
define i32 @uninteresting2() {
|
|
entry:
|
|
ret i32 0
|
|
}
|
|
|
|
declare void @uninteresting3()
|