File: cgprofile-bad-clusters.s

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 (61 lines) | stat: -rw-r--r-- 1,321 bytes parent folder | download | duplicates (21)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
# REQUIRES: x86
# This test checks that CallGraphSort ignores edges that would form "bad"
# clusters.

# RUN: llvm-mc -filetype=obj -triple=x86_64-pc-win32 %s -o %t
# RUN: echo "A C 1" > %t.call_graph
# RUN: echo "E B 4" >> %t.call_graph
# RUN: echo "C D 2" >> %t.call_graph
# RUN: echo "B D 1" >> %t.call_graph
# RUN: echo "F G 6" >> %t.call_graph
# RUN: echo "G H 5" >> %t.call_graph
# RUN: echo "H I 4" >> %t.call_graph
# RUN: lld-link /subsystem:console /entry:A %t /call-graph-ordering-file:%t.call_graph /out:%t2 /debug:symtab
# RUN: llvm-nm --numeric-sort %t2 | FileCheck %s

    .section    .text,"ax",one_only,A
    .globl A
A:
    retq

    .section    .text,"ax",one_only,D
D:
    .fill 1000, 1, 0

    .section    .text,"ax",one_only,E
E:
    retq

    .section    .text,"ax",one_only,C
C:
    retq

    .section    .text,"ax",one_only,B
B:
    .fill 1000, 1, 0

    .section    .text,"ax",one_only,F
F:
    .fill (1024 * 1024) - 1, 1, 0

    .section    .text,"ax",one_only,G
G:
    retq

    .section    .text,"ax",one_only,H
H:
    retq

    .section    .text,"ax",one_only,I
I:
    .fill 13, 1, 0

# CHECK: 140001000 t H
# CHECK: 140001001 t I
# CHECK: 14000100e T A
# CHECK: 14000100f t C
# CHECK: 140001010 t E
# CHECK: 140001011 t B
# CHECK: 1400013f9 t D
# CHECK: 1400017e1 t F
# CHECK: 1401017e0 t G