mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 11:13:28 +01:00
e1cb0bd2ab
Because screen space is precious, if an optimization (vectorization, for example) never happens, don't leave empty space for the associated markers on every line of the output. This makes the output much more compact, and allows for the later inclusion of markers for more (although perhaps rare) optimizations. llvm-svn: 283626
68 lines
2.5 KiB
Plaintext
68 lines
2.5 KiB
Plaintext
RUN: llvm-opt-report -r %p %p/Inputs/qx.yaml | FileCheck -strict-whitespace %s
|
|
RUN: llvm-opt-report -no-demangle -r %p %p/Inputs/qx.yaml | FileCheck -strict-whitespace -check-prefix=CHECK-NODEM %s
|
|
RUN: llvm-opt-report -s -r %p %p/Inputs/qx.yaml | FileCheck -strict-whitespace -check-prefix=CHECK-SUCCINCT %s
|
|
|
|
; CHECK: < {{.*[/\]}}q.cpp
|
|
; CHECK-NEXT: 1 | void bar();
|
|
; CHECK-NEXT: 2 | void foo(int n) {
|
|
; CHECK-NEXT: {{\[\[}}
|
|
; CHECK-NEXT: > foo(int):
|
|
; CHECK-NEXT: 3 | for (int i = 0; i < n; ++i)
|
|
; CHECK-NEXT: > quack(), quack2():
|
|
; CHECK-NEXT: 3 U4 | for (int i = 0; i < n; ++i)
|
|
; CHECK-NEXT: {{\]\]}}
|
|
; CHECK-NEXT: 4 | bar();
|
|
; CHECK-NEXT: 5 | }
|
|
; CHECK-NEXT: 6 |
|
|
; CHECK-NEXT: 7 | void quack() {
|
|
; CHECK-NEXT: 8 I | foo(4);
|
|
; CHECK-NEXT: 9 | }
|
|
; CHECK-NEXT: 10 |
|
|
; CHECK-NEXT: 11 | void quack2() {
|
|
; CHECK-NEXT: 12 I | foo(4);
|
|
; CHECK-NEXT: 13 | }
|
|
; CHECK-NEXT: 14 |
|
|
|
|
; CHECK-NODEM: < {{.*[/\]}}q.cpp
|
|
; CHECK-NODEM-NEXT: 1 | void bar();
|
|
; CHECK-NODEM-NEXT: 2 | void foo(int n) {
|
|
; CHECK-NODEM-NEXT: {{\[\[}}
|
|
; CHECK-NODEM-NEXT: > _Z3fooi:
|
|
; CHECK-NODEM-NEXT: 3 | for (int i = 0; i < n; ++i)
|
|
; CHECK-NODEM-NEXT: > _Z5quackv, _Z6quack2v:
|
|
; CHECK-NODEM-NEXT: 3 U4 | for (int i = 0; i < n; ++i)
|
|
; CHECK-NODEM-NEXT: {{\]\]}}
|
|
; CHECK-NODEM-NEXT: 4 | bar();
|
|
; CHECK-NODEM-NEXT: 5 | }
|
|
; CHECK-NODEM-NEXT: 6 |
|
|
; CHECK-NODEM-NEXT: 7 | void quack() {
|
|
; CHECK-NODEM-NEXT: 8 I | foo(4);
|
|
; CHECK-NODEM-NEXT: 9 | }
|
|
; CHECK-NODEM-NEXT: 10 |
|
|
; CHECK-NODEM-NEXT: 11 | void quack2() {
|
|
; CHECK-NODEM-NEXT: 12 I | foo(4);
|
|
; CHECK-NODEM-NEXT: 13 | }
|
|
; CHECK-NODEM-NEXT: 14 |
|
|
|
|
; CHECK-SUCCINCT: < {{.*[/\]}}q.cpp
|
|
; CHECK-SUCCINCT-NEXT: 1 | void bar();
|
|
; CHECK-SUCCINCT-NEXT: 2 | void foo(int n) {
|
|
; CHECK-SUCCINCT-NEXT: {{\[\[}}
|
|
; CHECK-SUCCINCT-NEXT: > foo(int):
|
|
; CHECK-SUCCINCT-NEXT: 3 | for (int i = 0; i < n; ++i)
|
|
; CHECK-SUCCINCT-NEXT: > quack(), quack2():
|
|
; CHECK-SUCCINCT-NEXT: 3 U | for (int i = 0; i < n; ++i)
|
|
; CHECK-SUCCINCT-NEXT: {{\]\]}}
|
|
; CHECK-SUCCINCT-NEXT: 4 | bar();
|
|
; CHECK-SUCCINCT-NEXT: 5 | }
|
|
; CHECK-SUCCINCT-NEXT: 6 |
|
|
; CHECK-SUCCINCT-NEXT: 7 | void quack() {
|
|
; CHECK-SUCCINCT-NEXT: 8 I | foo(4);
|
|
; CHECK-SUCCINCT-NEXT: 9 | }
|
|
; CHECK-SUCCINCT-NEXT: 10 |
|
|
; CHECK-SUCCINCT-NEXT: 11 | void quack2() {
|
|
; CHECK-SUCCINCT-NEXT: 12 I | foo(4);
|
|
; CHECK-SUCCINCT-NEXT: 13 | }
|
|
; CHECK-SUCCINCT-NEXT: 14 |
|
|
|