31 lines · cpp
1// HTML-WHOLE-FILE: <td class='line-number'><a name='L[[@LINE+2]]' href='#L[[@LINE+2]]'><pre>[[@LINE+2]]</pre></a></td><td class='skipped-line'></td><td class='code'><pre>// before2// HTML-FILTER-NOT: <td class='line-number'><a name='L[[@LINE+1]]' href='#L[[@LINE+1]]'><pre>[[@LINE+1]]</pre></a></td><td class='skipped-line'></td><td class='code'><pre>// before3// before any coverage // WHOLE-FILE: [[@LINE]]| |// before4 // FILTER-NOT: [[@LINE-1]]| |// before5// HTML: <td class='line-number'><a name='L[[@LINE+1]]' href='#L[[@LINE+1]]'><pre>[[@LINE+1]]</pre></a></td><td class='covered-line'><pre>161</pre></td><td class='code'><pre>int main() {6int main() { // TEXT: [[@LINE]]| [[#C161:min(C,161)]]|int main(7 int x = 0; // TEXT: [[@LINE]]| [[#C161]]| int x8 9 if (x) { // TEXT: [[@LINE]]| [[#C161]]| if (x)10 x = 0; // TEXT: [[@LINE]]| 0| x = 011 } else { // TEXT: [[@LINE]]| [[#C161]]| } else12 x = 1; // TEXT: [[@LINE]]| [[#C161]]| x = 113 } // TEXT: [[@LINE]]| [[#C161]]| }14 15 for (int i = 0; i < 100; ++i) { // TEXT: [[@LINE]]| [[C16K2]]| for (16 x = 1; // TEXT: [[@LINE]]| [[C16K1]]| x = 117 } // TEXT: [[@LINE]]| [[C16K1]]| }18 19 x = x < 10 ? x + 1 : x - 1; // TEXT: [[@LINE]]| [[#C161]]| x =20 x = x > 10 ? // TEXT: [[@LINE]]| [[#C161]]| x =21 x - 1: // TEXT: [[@LINE]]| 0| x22 x + 1; // TEXT: [[@LINE]]| [[#C161]]| x23 24 return 0; // TEXT: [[@LINE]]| [[#C161]]| return25} // TEXT: [[@LINE]]| [[#C161]]|}26// after coverage // WHOLE-FILE: [[@LINE]]| |// after27 // FILTER-NOT: [[@LINE-1]]| |// after28// HTML-BINARY-NOT: <td class='covered-line'><pre>1629// HTML-WHOLE-FILE: <td class='line-number'><a name='L[[@LINE-3]]' href='#L[[@LINE-3]]'><pre>[[@LINE-3]]</pre></a></td><td class='skipped-line'></td><td class='code'><pre>// after30// HTML-FILTER-NOT: <td class='line-number'><a name='L[[@LINE-4]]' href='#L[[@LINE-4]]'><pre>[[@LINE-4]]</pre></a></td><td class='skipped-line'></td><td class='code'><pre>// after31