Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "base/barrier_closure.h" | 5 #include "base/barrier_closure.h" |
| 6 | 6 |
| 7 #include "base/bind.h" | 7 #include "base/bind.h" |
| 8 #include "testing/gtest/include/gtest/gtest.h" | 8 #include "testing/gtest/include/gtest/gtest.h" |
| 9 | 9 |
| 10 namespace { | 10 namespace { |
| 11 | 11 |
| 12 void Increment(int* count) { (*count)++; } | 12 void Increment(int* count) { (*count)++; } |
| 13 | 13 |
| 14 TEST(BarrierClosureTest, RunImmediatelyForZeroClosures) { | 14 TEST(BarrierClosureTest, RunImmediatelyForZeroClosures) { |
| 15 int count = 0; | 15 int count = 0; |
| 16 base::Closure doneClosure(base::Bind(&Increment, base::Unretained(&count))); | 16 base::Closure done_closure(base::Bind(&Increment, base::Unretained(&count))); |
| 17 | 17 |
| 18 base::Closure barrierClosure = base::BarrierClosure(0, doneClosure); | 18 base::Closure barrier_closure = base::BarrierClosure(0, done_closure); |
| 19 EXPECT_EQ(1, count); | 19 EXPECT_EQ(1, count); |
| 20 } | 20 } |
| 21 | 21 |
| 22 TEST(BarrierClosureTest, RunAfterNumClosures) { | 22 TEST(BarrierClosureTest, RunAfterNumClosures) { |
| 23 int count = 0; | 23 int count = 0; |
| 24 base::Closure doneClosure(base::Bind(&Increment, base::Unretained(&count))); | 24 base::Closure done_closure(base::Bind(&Increment, base::Unretained(&count))); |
| 25 | 25 |
| 26 base::Closure barrierClosure = base::BarrierClosure(2, doneClosure); | 26 base::Closure barrier_closure = base::BarrierClosure(2, done_closure); |
| 27 EXPECT_EQ(0, count); | 27 EXPECT_EQ(0, count); |
| 28 | 28 |
| 29 barrierClosure.Run(); | 29 barrier_closure.Run(); |
| 30 EXPECT_EQ(0, count); | 30 EXPECT_EQ(0, count); |
| 31 | 31 |
| 32 barrierClosure.Run(); | 32 barrier_closure.Run(); |
| 33 EXPECT_EQ(1, count); | 33 EXPECT_EQ(1, count); |
| 34 } | 34 } |
| 35 | 35 |
| 36 class DestructionIndicator { | |
| 37 public: | |
| 38 // Sets |*destructed| to true in destructor. | |
| 39 DestructionIndicator(bool* destructed) : destructed_(destructed) { | |
| 40 *destructed_ = false; | |
| 41 } | |
| 42 | |
| 43 ~DestructionIndicator() { *destructed_ = true; } | |
| 44 | |
| 45 void DoNothing() {} | |
| 46 | |
| 47 private: | |
| 48 bool* destructed_; | |
| 49 }; | |
| 50 | |
| 51 TEST(BarrierClosureTest, ReleasesDoneClosureWhenDone) { | |
| 52 bool done_destructed = false; | |
| 53 base::Closure barrier_closure = base::BarrierClosure( | |
| 54 1, base::Bind(&DestructionIndicator::DoNothing, | |
| 55 base::Owned(new DestructionIndicator(&done_destructed)))); | |
| 56 CHECK(!done_destructed); | |
|
danakj
2015/05/05 18:58:14
Use EXPECT_TRUE/EXPECT_FALSE instead of CHECK in t
dzhioev (left Google)
2015/05/06 23:13:04
Done.
| |
| 57 barrier_closure.Run(); | |
| 58 CHECK(done_destructed); | |
| 59 } | |
| 60 | |
| 61 void ReleaseClosure(base::Closure* closure) { | |
|
danakj
2015/05/05 18:58:14
can you call this ResetBarrierClosure?
dzhioev (left Google)
2015/05/06 23:13:05
Done.
| |
| 62 *closure = base::Closure(); | |
| 63 } | |
| 64 | |
| 65 // Tests a case when client releases a reference to barrierClosure in | |
|
danakj
2015/05/05 18:58:14
BarrierClosure
dzhioev (left Google)
2015/05/06 23:13:04
Done.
| |
| 66 // |done_closure|. | |
| 67 TEST(BarrierClosureTest, KeepingClosureAliveUntilDone) { | |
| 68 base::Closure barrier_closure; | |
| 69 base::Closure done_closure = base::Bind(ReleaseClosure, &barrier_closure); | |
| 70 barrier_closure = base::BarrierClosure(1, done_closure); | |
|
danakj
2015/05/05 18:58:14
Can you add a more verbose comment explaining what
dzhioev (left Google)
2015/05/06 23:13:04
Done.
| |
| 71 barrier_closure.Run(); | |
| 72 } | |
| 73 | |
| 36 } // namespace | 74 } // namespace |
| OLD | NEW |