Rafael Auler f9ed45893b Teach llvm-flo how to reorder blocks in an optimal way ...

Summary:
This patch implements a dynamic programming approach to solve reorder
basic blocks with profiling information in an optimal way. Since this is
analogous to TSP, it is NP-hard and the algorithm is exponential in time and
memory consumption. Therefore, we only use the optimal algorithm to decide the
layout of small functions (with less than 11 basic blocks).

(cherry picked from FBD2544124)

2015-10-14 16:58:55 -07:00

bolt

Teach llvm-flo how to reorder blocks in an optimal way

2015-10-14 16:58:55 -07:00

Description

No description provided

intelllvmoneapisycl

5.3 GiB

Languages

LLVM 41.5%

C++ 31.7%

C 13%

Assembly 9.1%

MLIR 1.5%

Other 2.8%