Files
codeql/cpp/ql/test/library-tests/dataflow/dataflow-tests/true_upon_entry.cpp
2020-11-27 16:03:15 +01:00

107 lines
1.9 KiB
C++

// This file tests that data flow cannot survive in a variable past a loop that
// always assigns to this variable.
int source();
void sink(...);
bool random();
int test1() {
int x = source();
for (int i = 0; i < 10; i++) {
x = 0;
}
sink(x); // $ SPURIOUS: ir
}
int test2(int iterations) {
int x = source();
for (int i = 0; i < iterations; i++) {
x = 0;
}
sink(x); // $ ast,ir
}
int test3() {
int x = 0;
for (int i = 0; i < 10; i++) {
x = source();
}
sink(x); // $ ast,ir
}
int test4() {
int x = source();
for (int i = 0; i < 10; i++) {
if (random())
break;
x = 0;
}
sink(x); // $ ast,ir
}
int test5() {
int x = source();
for (int i = 0; i < 10; i++) {
if (random())
continue;
x = 0;
}
sink(x); // $ ast,ir
}
int test6() {
int y;
int x = source();
for (int i = 0; i < 10 && (y = 1); i++) {
}
sink(x); // $ ast,ir
}
int test7() {
int y;
int x = source();
for (int i = 0; i < 10 && (y = 1); i++) {
x = 0;
}
sink(x); // $ SPURIOUS: ir
}
int test8() {
int x = source();
// It appears to the analysis that the condition can exit after `i < 10`
// without having assigned to `x`. That is an effect of how the
// true-upon-entry analysis considers the entire loop condition, while the
// analysis of where we might jump out of the loop condition considers every
// jump out of the condition, not just the last one.
for (int i = 0; i < 10 && (x = 1); i++) {
}
sink(x); // $ SPURIOUS: ast,ir
}
int test9() {
int y;
int x = source();
for (int i = 0; (y = 1) && i < 10; i++) {
}
sink(x); // $ ast,ir
}
int test10() {
int x = source();
for (int i = 0; (x = 1) && i < 10; i++) {
}
sink(x); // no flow
}
int test10(int b, int d) {
int i = 0;
int x = source();
if (b)
goto L;
for (; i < 10; i += d) {
x = 0;
L:
}
sink(x); // $ ir MISSING: ast
}