| OLD | NEW |
| (Empty) |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | |
| 2 // Redistribution and use in source and binary forms, with or without | |
| 3 // modification, are permitted provided that the following conditions are | |
| 4 // met: | |
| 5 // | |
| 6 // * Redistributions of source code must retain the above copyright | |
| 7 // notice, this list of conditions and the following disclaimer. | |
| 8 // * Redistributions in binary form must reproduce the above | |
| 9 // copyright notice, this list of conditions and the following | |
| 10 // disclaimer in the documentation and/or other materials provided | |
| 11 // with the distribution. | |
| 12 // * Neither the name of Google Inc. nor the names of its | |
| 13 // contributors may be used to endorse or promote products derived | |
| 14 // from this software without specific prior written permission. | |
| 15 // | |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 27 | |
| 28 #include "src/v8.h" | |
| 29 | |
| 30 #include "src/libplatform/task-queue.h" | |
| 31 #include "test/cctest/cctest.h" | |
| 32 #include "test/cctest/test-libplatform.h" | |
| 33 | |
| 34 using namespace v8::internal; | |
| 35 using namespace v8::platform; | |
| 36 | |
| 37 | |
| 38 TEST(TaskQueueBasic) { | |
| 39 TaskCounter task_counter; | |
| 40 | |
| 41 TaskQueue queue; | |
| 42 | |
| 43 TestTask* task = new TestTask(&task_counter); | |
| 44 queue.Append(task); | |
| 45 CHECK_EQ(1, task_counter.GetCount()); | |
| 46 CHECK_EQ(task, queue.GetNext()); | |
| 47 delete task; | |
| 48 CHECK_EQ(0, task_counter.GetCount()); | |
| 49 | |
| 50 queue.Terminate(); | |
| 51 CHECK_EQ(NULL, queue.GetNext()); | |
| 52 } | |
| 53 | |
| 54 | |
| 55 class ReadQueueTask : public TestTask { | |
| 56 public: | |
| 57 ReadQueueTask(TaskCounter* task_counter, TaskQueue* queue) | |
| 58 : TestTask(task_counter, true), queue_(queue) {} | |
| 59 virtual ~ReadQueueTask() {} | |
| 60 | |
| 61 virtual void Run() V8_OVERRIDE { | |
| 62 TestTask::Run(); | |
| 63 CHECK_EQ(NULL, queue_->GetNext()); | |
| 64 } | |
| 65 | |
| 66 private: | |
| 67 TaskQueue* queue_; | |
| 68 | |
| 69 DISALLOW_COPY_AND_ASSIGN(ReadQueueTask); | |
| 70 }; | |
| 71 | |
| 72 | |
| 73 TEST(TaskQueueTerminateMultipleReaders) { | |
| 74 TaskQueue queue; | |
| 75 TaskCounter task_counter; | |
| 76 ReadQueueTask* read1 = new ReadQueueTask(&task_counter, &queue); | |
| 77 ReadQueueTask* read2 = new ReadQueueTask(&task_counter, &queue); | |
| 78 | |
| 79 TestWorkerThread thread1(read1); | |
| 80 TestWorkerThread thread2(read2); | |
| 81 | |
| 82 thread1.Start(); | |
| 83 thread2.Start(); | |
| 84 | |
| 85 CHECK_EQ(2, task_counter.GetCount()); | |
| 86 | |
| 87 thread1.Signal(); | |
| 88 thread2.Signal(); | |
| 89 | |
| 90 queue.Terminate(); | |
| 91 | |
| 92 thread1.Join(); | |
| 93 thread2.Join(); | |
| 94 | |
| 95 CHECK_EQ(0, task_counter.GetCount()); | |
| 96 } | |
| OLD | NEW |