maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Remove undefined behavior from some tests. Thanks to Walter Brown for the heads-up. 

llvm-svn: 251802
This commit is contained in:
Marshall Clow 2015-11-02 15:25:53 +00:00
parent 7c1f36a6b7
commit 8eb1d544f8
2 changed files with 18 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
libcxx/test/std/utilities/memory/specialized.algorithms/uninitialized.copy/uninitialized_copy.pass.cpp
View File

@ -20,13 +20,15 @@
struct B
{
static int count_;
static int population_;
int data_;
explicit B() : data_(1) {}
B(const B& b) {if (++count_ == 3) throw 1; data_ = b.data_;}
~B() {data_ = 0;}
explicit B() : data_(1) { ++population_; }
B(const B& b) {if (++count_ == 3) throw 1; data_ = b.data_; ++population_; }
~B() {data_ = 0; --population_; }
};
int B::count_ = 0;
int B::population_ = 0;
struct Nasty
{
@ -45,6 +47,7 @@ int main()
char pool[sizeof(B)*N] = {0};
B* bp = (B*)pool;
B b[N];
assert(B::population_ == N);
try
{
std::uninitialized_copy(b, b+N, bp);
@ -52,14 +55,15 @@ int main()
}
catch (...)
{
for (int i = 0; i < N; ++i)
assert(bp[i].data_ == 0);
assert(B::population_ == N);
}
B::count_ = 0;
std::uninitialized_copy(b, b+2, bp);
for (int i = 0; i < 2; ++i)
assert(bp[i].data_ == 1);
assert(B::population_ == N + 2);
}
{
const int N = 5;
char pool[sizeof(Nasty)*N] = {0};

14
libcxx/test/std/utilities/memory/specialized.algorithms/uninitialized.copy/uninitialized_copy_n.pass.cpp
View File

@ -20,12 +20,14 @@
struct B
{
static int count_;
static int population_;
int data_;
explicit B() : data_(1) {}
B(const B& b) {if (++count_ == 3) throw 1; data_ = b.data_;}
~B() {data_ = 0;}
explicit B() : data_(1) { ++population_; }
B(const B& b) {if (++count_ == 3) throw 1; data_ = b.data_; ++population_; }
~B() {data_ = 0; --population_; }
};
int B::population_ = 0;
int B::count_ = 0;
struct Nasty
@ -45,6 +47,7 @@ int main()
char pool[sizeof(B)*N] = {0};
B* bp = (B*)pool;
B b[N];
assert(B::population_ == N);
try
{
std::uninitialized_copy_n(b, 5, bp);
@ -52,14 +55,15 @@ int main()
}
catch (...)
{
for (int i = 0; i < N; ++i)
assert(bp[i].data_ == 0);
assert(B::population_ == N);
}
B::count_ = 0;
std::uninitialized_copy_n(b, 2, bp);
for (int i = 0; i < 2; ++i)
assert(bp[i].data_ == 1);
assert(B::population_ == N + 2);
}
{
const int N = 5;
char pool[sizeof(Nasty)*N] = {0};