1; This test verifies whether we can outline a singleton instance (i.e., an instance that does not repeat) 2; using codegen data that has been read from a previous codegen run. 3; When multiple matches occur, we prioritize the candidates using the global frequency. 4 5; RUN: split-file %s %t 6 7; First, we generate the cgdata file from local outline instances present in write1.ll and write2.ll 8; RUN: llc -mtriple=arm64-apple-darwin -enable-machine-outliner -codegen-data-generate=true -filetype=obj %t/write1.ll -o %t_write1 9; RUN: llc -mtriple=arm64-apple-darwin -enable-machine-outliner -codegen-data-generate=true -filetype=obj %t/write2.ll -o %t_write2 10; RUN: llvm-cgdata --merge %t_write1 %t_write2 -o %t_cgdata 11; RUN: llvm-cgdata --show %t_cgdata | FileCheck %s --check-prefix=SHOW 12 13; SHOW: Outlined hash tree: 14; SHOW-NEXT: Total Node Count: 8 15; SHOW-NEXT: Terminal Node Count: 2 16; SHOW-NEXT: Depth: 4 17 18; Now, we read the cgdata in the machine outliner, enabling us to optimistically 19; outline a singleton instance in read.ll that matches against the cgdata. 20; There are two matches -- (1) (mov #1, mov #2, mov #3, b) and (2) (mov #2, mov #3, b). 21; Even though sequence (1) is longer than sequence (2), the latter is outlined because it occurs more frequently in the outlined hash tree. 22 23; RUN: llc -mtriple=arm64-apple-darwin -enable-machine-outliner -codegen-data-use-path=%t_cgdata -filetype=obj %t/read.ll -o %t_read 24; RUN: llvm-objdump -d %t_read | FileCheck %s 25 26; CHECK: _OUTLINED_FUNCTION 27; CHECK-NEXT: mov 28; CHECK-NEXT: mov 29; CHECK-NEXT: b 30 31;--- write1.ll 32; The sequence (mov #2, mov #3, b) are repeated 4 times. 33declare i32 @g(i32, i32, i32) 34define i32 @f1() minsize { 35 %1 = call i32 @g(i32 10, i32 50, i32 2, i32 3); 36 ret i32 %1 37} 38define i32 @f2() minsize { 39 %1 = call i32 @g(i32 20, i32 60, i32 2, i32 3); 40 ret i32 %1 41} 42define i32 @f3() minsize { 43 %1 = call i32 @g(i32 30, i32 70, i32 2, i32 3); 44 ret i32 %1 45} 46define i32 @f4() minsize { 47 %1 = call i32 @g(i32 40, i32 80, i32 2, i32 3); 48 ret i32 %1 49} 50 51;--- write2.ll 52; The sequence (mov #1, mov #2, mov #3, b) are repeated 2 times. 53declare i32 @g(i32, i32, i32) 54define i32 @f6() minsize { 55 %1 = call i32 @g(i32 10, i32 1, i32 2, i32 3); 56 ret i32 %1 57} 58define i32 @f7() minsize { 59 %1 = call i32 @g(i32 20, i32 1, i32 2, i32 3); 60 ret i32 %1 61} 62 63;--- read.ll 64declare i32 @g(i32, i32, i32) 65define i32 @f3() minsize { 66 %1 = call i32 @g(i32 30, i32 1, i32 2, i32 3); 67 ret i32 %1 68} 69