- Am 18. Aug 2025 um 15:19 schrieb Jørgen Kvalsvik j...@lambda.is:
> On 8/18/25 14:37, Sebastian Huber wrote:
[...]
> I tried this program:
>
> int a(int i);
> int b(int i);
> int c(int i);
>
> int f(int i, int j, int k, int l, int m)
> {
> if (i && j && (k || !l || m)) {
> if (a(i) ||
On 8/18/25 14:37, Sebastian Huber wrote:
- Am 18. Aug 2025 um 9:33 schrieb Jørgen Kvalsvik j...@lambda.is:
On 8/18/25 02:58, Sebastian Huber wrote:
Hello,
I have question to the counters used for the condition coverage implementation
in tree-profile.cc
/* Stores the incoming edge and pre
- Am 18. Aug 2025 um 9:33 schrieb Jørgen Kvalsvik j...@lambda.is:
> On 8/18/25 02:58, Sebastian Huber wrote:
>> Hello,
>>
>> I have question to the counters used for the condition coverage
>> implementation
>> in tree-profile.cc
>>
>> /* Stores the incoming edge and previous counters (in SS
On 8/18/25 02:58, Sebastian Huber wrote:
Hello,
I have question to the counters used for the condition coverage implementation
in tree-profile.cc
/* Stores the incoming edge and previous counters (in SSA form) on that edge
for the node e->deston that edge for the node e->dest. The counter
