71 lines · plain
1# REQUIRES: x862# This test checks that CallGraphSort ignores edges that would form "bad"3# clusters.4 5# RUN: llvm-mc -filetype=obj -triple=x86_64-unknown-linux %s -o %t6# RUN: echo "A C 1" > %t.call_graph7# RUN: echo "E B 4" >> %t.call_graph8# RUN: echo "C D 2" >> %t.call_graph9# RUN: echo "B D 1" >> %t.call_graph10# RUN: echo "F G 6" >> %t.call_graph11# RUN: echo "G H 5" >> %t.call_graph12# RUN: echo "H I 4" >> %t.call_graph13# RUN: ld.lld -e A %t --call-graph-ordering-file %t.call_graph --call-graph-profile-sort=hfsort -o %t214# RUN: llvm-readobj --symbols %t2 | FileCheck %s15 16 .section .text.A,"ax",@progbits17 .globl A18A:19 retq20 21 .section .text.D,"ax",@progbits22D:23 .fill 1000, 1, 024 25 .section .text.E,"ax",@progbits26E:27 retq28 29 .section .text.C,"ax",@progbits30C:31 retq32 33 .section .text.B,"ax",@progbits34B:35 .fill 1000, 1, 036 37 .section .text.F,"ax",@progbits38F:39 .fill (1024 * 1024) - 1, 1, 040 41 .section .text.G,"ax",@progbits42G:43 retq44 45 .section .text.H,"ax",@progbits46H:47 retq48 49 .section .text.I,"ax",@progbits50I:51 .fill 13, 1, 052 53# CHECK: Name: D54# CHECK-NEXT: Value: 0x20151955# CHECK: Name: E56# CHECK-NEXT: Value: 0x20113057# CHECK: Name: C58# CHECK-NEXT: Value: 0x20112F59# CHECK: Name: B60# CHECK-NEXT: Value: 0x20113161# CHECK: Name: F62# CHECK-NEXT: Value: 0x20190163# CHECK: Name: G64# CHECK-NEXT: Value: 0x30190065# CHECK: Name: H66# CHECK-NEXT: Value: 0x20112067# CHECK: Name: I68# CHECK-NEXT: Value: 0x20112169# CHECK: Name: A70# CHECK-NEXT: Value: 0x20112E71