efae14e96c
Seems I had a problem with my version of grep, when run by lit, not supporting the \s escape. This seems to fix it for me & I'll be getting the buildbots to run these tests too to keep an eye on them (actually loop-convert tests still fail when run via a make build, so that'll be addressed in a future commit). I could use [[:space:]] to generalize over other whitespace but that seemed unnecessarily verbose when the flexibility wasn't actually required by the current text of the tests. Also I just simplified a lot of the loop-convert tests (removing the unecessary temp file deletion at the start, removing the unnecessary && for FileCheck, etc). The remove-cstr-calls/basic.cpp changes were necessitated by an out of tree lit-like test runner that's a bit less fantastic about escaping. They were modeled on existing tooling test cases in Clang, with thanks to Manuel Klimek for the pointers. llvm-svn: 163009
130 lines
2.7 KiB
C++
130 lines
2.7 KiB
C++
// RUN: grep -Ev "// *[A-Z-]+:" %s > %t.cpp
|
|
// RUN: loop-convert -A1 . %t.cpp -- -I %S/Inputs
|
|
// RUN: FileCheck -input-file=%t.cpp %s
|
|
|
|
#include "structures.h"
|
|
|
|
// Single FileCheck line to make sure that no loops are converted.
|
|
// CHECK-NOT: for ({{.*[^:]:[^:].*}})
|
|
|
|
const int N = 6;
|
|
dependent<int> v;
|
|
dependent<int> *pv;
|
|
|
|
transparent<dependent<int> > cv;
|
|
int sum = 0;
|
|
|
|
// Checks for the index start and end:
|
|
void indexStartAndEnd() {
|
|
for (int i = 0; i < v.size() + 1; ++i)
|
|
sum += v[i];
|
|
|
|
for (int i = 0; i < v.size() - 1; ++i)
|
|
sum += v[i];
|
|
|
|
for (int i = 1; i < v.size(); ++i)
|
|
sum += v[i];
|
|
|
|
for (int i = 1; i < v.size(); ++i)
|
|
sum += v[i];
|
|
|
|
for (int i = 0; ; ++i)
|
|
sum += (*pv)[i];
|
|
}
|
|
|
|
// Checks for invalid increment steps:
|
|
void increment() {
|
|
for (int i = 0; i < v.size(); --i)
|
|
sum += v[i];
|
|
|
|
for (int i = 0; i < v.size(); i)
|
|
sum += v[i];
|
|
|
|
for (int i = 0; i < v.size();)
|
|
sum += v[i];
|
|
|
|
for (int i = 0; i < v.size(); i += 2)
|
|
sum ++;
|
|
}
|
|
|
|
// Checks to make sure that the index isn't used outside of the container:
|
|
void indexUse() {
|
|
for (int i = 0; i < v.size(); ++i)
|
|
v[i] += 1 + i;
|
|
}
|
|
|
|
// Checks for incorrect loop variables.
|
|
void mixedVariables() {
|
|
int badIndex;
|
|
for (int i = 0; badIndex < v.size(); ++i)
|
|
sum += v[i];
|
|
|
|
for (int i = 0; i < v.size(); ++badIndex)
|
|
sum += v[i];
|
|
|
|
for (int i = 0; badIndex < v.size(); ++badIndex)
|
|
sum += v[i];
|
|
|
|
for (int i = 0; badIndex < v.size(); ++badIndex)
|
|
sum += v[badIndex];
|
|
}
|
|
|
|
// Checks for an array indexed in addition to the container.
|
|
void multipleArrays() {
|
|
int badArr[N];
|
|
|
|
for (int i = 0; i < v.size(); ++i)
|
|
sum += v[i] + badArr[i];
|
|
|
|
for (int i = 0; i < v.size(); ++i)
|
|
sum += badArr[i];
|
|
|
|
for (int i = 0; i < v.size(); ++i) {
|
|
int k = badArr[i];
|
|
sum += k + 2;
|
|
}
|
|
|
|
for (int i = 0; i < v.size(); ++i) {
|
|
int k = badArr[i];
|
|
sum += v[i] + k;
|
|
}
|
|
}
|
|
|
|
// Checks for multiple containers being indexed container.
|
|
void multipleContainers() {
|
|
dependent<int> badArr;
|
|
|
|
for (int i = 0; i < v.size(); ++i)
|
|
sum += v[i] + badArr[i];
|
|
|
|
for (int i = 0; i < v.size(); ++i)
|
|
sum += badArr[i];
|
|
|
|
for (int i = 0; i < v.size(); ++i) {
|
|
int k = badArr[i];
|
|
sum += k + 2;
|
|
}
|
|
|
|
for (int i = 0; i < v.size(); ++i) {
|
|
int k = badArr[i];
|
|
sum += v[i] + k;
|
|
}
|
|
}
|
|
|
|
// Check to make sure that dereferenced pointers-to-containers behave nicely
|
|
void derefContainer() {
|
|
// Note the dependent<T>::operator*() returns another dependent<T>.
|
|
// This test makes sure that we don't allow an arbitrary number of *'s.
|
|
for (int i = 0; i < pv->size(); ++i)
|
|
sum += (**pv).at(i);
|
|
|
|
for (int i = 0; i < pv->size(); ++i)
|
|
sum += (**pv)[i];
|
|
}
|
|
|
|
void wrongEnd() {
|
|
int bad;
|
|
for (int i = 0, e = v.size(); i < bad; ++i)
|
|
sum += v[i];
|
|
}
|