File: no-entry-reordering.test

package info (click to toggle)
swiftlang 6.0.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 2,519,992 kB
  • sloc: cpp: 9,107,863; ansic: 2,040,022; asm: 1,135,751; python: 296,500; objc: 82,456; f90: 60,502; lisp: 34,951; pascal: 19,946; sh: 18,133; perl: 7,482; ml: 4,937; javascript: 4,117; makefile: 3,840; awk: 3,535; xml: 914; fortran: 619; cs: 573; ruby: 573
file content (11 lines) | stat: -rw-r--r-- 584 bytes parent folder | download | duplicates (5) 
1
2
3
4
5
6
7
8
9
10
11
 
# Verifies that llvm-bolt reordering heuristic does not allocate a BB before the
# entry point even if there is a hot edge from a block to entry point

RUN: llvm-mc -filetype=obj -triple x86_64-unknown-unknown %S/Inputs/entry.s -o %t.o
RUN: link_fdata %S/Inputs/entry.s %t.o %t.fdata --nmtool llvm-nm
RUN: llvm-strip --strip-unneeded %t.o
RUN: %clang %cflags %t.o -o %t.exe -Wl,-q -nostdlib
RUN: llvm-bolt %t.exe --data %t.fdata -o /dev/null --reorder-blocks=normal \
RUN:   --funcs=_start --print-reordered --sequential-disassembly | FileCheck %s

CHECK:  BB Layout : .LBB00, {{.*}}