mirror of
https://github.com/llvm-mirror/libcxx.git
synced 2025-10-23 18:38:30 +08:00
Fixed unintentional assignment-in-assert in new "extending memory management tools" algorithms.
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@297772 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -80,7 +80,7 @@ void test_counted()
|
|||||||
Counted* p = (Counted*)pool;
|
Counted* p = (Counted*)pool;
|
||||||
std::uninitialized_default_construct(It(p), It(p+1));
|
std::uninitialized_default_construct(It(p), It(p+1));
|
||||||
assert(Counted::count == 1);
|
assert(Counted::count == 1);
|
||||||
assert(Counted::constructed = 1);
|
assert(Counted::constructed == 1);
|
||||||
std::uninitialized_default_construct(It(p+1), It(p+N));
|
std::uninitialized_default_construct(It(p+1), It(p+N));
|
||||||
assert(Counted::count == 5);
|
assert(Counted::count == 5);
|
||||||
assert(Counted::constructed == 5);
|
assert(Counted::constructed == 5);
|
||||||
|
@@ -80,7 +80,7 @@ void test_counted()
|
|||||||
It e = std::uninitialized_default_construct_n(It(p), 1);
|
It e = std::uninitialized_default_construct_n(It(p), 1);
|
||||||
assert(e == It(p+1));
|
assert(e == It(p+1));
|
||||||
assert(Counted::count == 1);
|
assert(Counted::count == 1);
|
||||||
assert(Counted::constructed = 1);
|
assert(Counted::constructed == 1);
|
||||||
e = std::uninitialized_default_construct_n(It(p+1), 4);
|
e = std::uninitialized_default_construct_n(It(p+1), 4);
|
||||||
assert(e == It(p+N));
|
assert(e == It(p+N));
|
||||||
assert(Counted::count == 5);
|
assert(Counted::count == 5);
|
||||||
|
@@ -79,7 +79,7 @@ void test_counted()
|
|||||||
Counted* p = (Counted*)pool;
|
Counted* p = (Counted*)pool;
|
||||||
std::uninitialized_value_construct(It(p), It(p+1));
|
std::uninitialized_value_construct(It(p), It(p+1));
|
||||||
assert(Counted::count == 1);
|
assert(Counted::count == 1);
|
||||||
assert(Counted::constructed = 1);
|
assert(Counted::constructed == 1);
|
||||||
std::uninitialized_value_construct(It(p+1), It(p+N));
|
std::uninitialized_value_construct(It(p+1), It(p+N));
|
||||||
assert(Counted::count == 5);
|
assert(Counted::count == 5);
|
||||||
assert(Counted::constructed == 5);
|
assert(Counted::constructed == 5);
|
||||||
|
@@ -81,7 +81,7 @@ void test_counted()
|
|||||||
It e = std::uninitialized_value_construct_n(It(p), 1);
|
It e = std::uninitialized_value_construct_n(It(p), 1);
|
||||||
assert(e == It(p+1));
|
assert(e == It(p+1));
|
||||||
assert(Counted::count == 1);
|
assert(Counted::count == 1);
|
||||||
assert(Counted::constructed = 1);
|
assert(Counted::constructed == 1);
|
||||||
e = std::uninitialized_value_construct_n(It(p+1), 4);
|
e = std::uninitialized_value_construct_n(It(p+1), 4);
|
||||||
assert(e == It(p+N));
|
assert(e == It(p+N));
|
||||||
assert(Counted::count == 5);
|
assert(Counted::count == 5);
|
||||||
|
@@ -88,7 +88,7 @@ void test_counted()
|
|||||||
Counted* p = (Counted*)pool;
|
Counted* p = (Counted*)pool;
|
||||||
auto ret = std::uninitialized_move(It(values), It(values + 1), FIt(p));
|
auto ret = std::uninitialized_move(It(values), It(values + 1), FIt(p));
|
||||||
assert(ret == FIt(p +1));
|
assert(ret == FIt(p +1));
|
||||||
assert(Counted::constructed = 1);
|
assert(Counted::constructed == 1);
|
||||||
assert(Counted::count == 1);
|
assert(Counted::count == 1);
|
||||||
assert(p[0].value == 1);
|
assert(p[0].value == 1);
|
||||||
assert(values[0] == 0);
|
assert(values[0] == 0);
|
||||||
|
@@ -89,7 +89,7 @@ void test_counted()
|
|||||||
auto ret = std::uninitialized_move_n(It(values), 1, FIt(p));
|
auto ret = std::uninitialized_move_n(It(values), 1, FIt(p));
|
||||||
assert(ret.first == It(values +1));
|
assert(ret.first == It(values +1));
|
||||||
assert(ret.second == FIt(p +1));
|
assert(ret.second == FIt(p +1));
|
||||||
assert(Counted::constructed = 1);
|
assert(Counted::constructed == 1);
|
||||||
assert(Counted::count == 1);
|
assert(Counted::count == 1);
|
||||||
assert(p[0].value == 1);
|
assert(p[0].value == 1);
|
||||||
assert(values[0] == 0);
|
assert(values[0] == 0);
|
||||||
|
Reference in New Issue
Block a user