9f2967bcfe
This is an enhancement to LLVM Source-Based Code Coverage in clang to track how many times individual branch-generating conditions are taken (evaluate to TRUE) and not taken (evaluate to FALSE). Individual conditions may comprise larger boolean expressions using boolean logical operators. This functionality is very similar to what is supported by GCOV except that it is very closely anchored to the ASTs. Differential Revision: https://reviews.llvm.org/D84467
49 lines
2.0 KiB
C++
49 lines
2.0 KiB
C++
// fixme: the following line is added to cleanup bots, will be removed in weeks.
|
|
// RUN: rm -f %S/coroutine.ll
|
|
// RUN: %clang_cc1 -mllvm -emptyline-comment-coverage=false -triple x86_64-unknown-linux-gnu -fcoroutines-ts -std=c++14 -emit-llvm -fprofile-instrument=clang -fcoverage-mapping -dump-coverage-mapping %s -o - | FileCheck %s
|
|
|
|
namespace std::experimental {
|
|
template <typename... T>
|
|
struct coroutine_traits;
|
|
|
|
template <class Promise = void>
|
|
struct coroutine_handle {
|
|
coroutine_handle() = default;
|
|
static coroutine_handle from_address(void *) noexcept { return {}; }
|
|
};
|
|
template <>
|
|
struct coroutine_handle<void> {
|
|
static coroutine_handle from_address(void *) { return {}; }
|
|
coroutine_handle() = default;
|
|
template <class PromiseType>
|
|
coroutine_handle(coroutine_handle<PromiseType>) noexcept {}
|
|
};
|
|
} // namespace std::experimental
|
|
|
|
struct suspend_always {
|
|
bool await_ready() noexcept;
|
|
void await_suspend(std::experimental::coroutine_handle<>) noexcept;
|
|
void await_resume() noexcept;
|
|
};
|
|
|
|
template <>
|
|
struct std::experimental::coroutine_traits<int, int> {
|
|
struct promise_type {
|
|
int get_return_object();
|
|
suspend_always initial_suspend();
|
|
suspend_always final_suspend() noexcept;
|
|
void return_value(int);
|
|
};
|
|
};
|
|
|
|
// CHECK-LABEL: _Z2f1i:
|
|
int f1(int x) { // CHECK-NEXT: File 0, [[@LINE]]:15 -> [[@LINE+8]]:2 = #0
|
|
if (x > 42) { // CHECK-NEXT: File 0, [[@LINE]]:7 -> [[@LINE]]:13 = #0
|
|
// CHECK-NEXT: Branch,File 0, [[@LINE-1]]:7 -> [[@LINE-1]]:13 = #1, (#0 - #1)
|
|
++x; // CHECK-NEXT: Gap,File 0, [[@LINE-2]]:14 -> [[@LINE-2]]:15 = #1
|
|
} else { // CHECK-NEXT: File 0, [[@LINE-3]]:15 -> [[@LINE]]:4 = #1
|
|
co_return x + 42; // CHECK-NEXT: Gap,File 0, [[@LINE-1]]:4 -> [[@LINE-1]]:10 = (#0 - #1)
|
|
} // CHECK-NEXT: File 0, [[@LINE-2]]:10 -> [[@LINE]]:4 = (#0 - #1)
|
|
co_return x; // CHECK-NEXT: Gap,File 0, [[@LINE-1]]:4 -> [[@LINE]]:3 = #1
|
|
} // CHECK-NEXT: File 0, [[@LINE-1]]:3 -> [[@LINE]]:2 = #1
|