OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 10 matching lines...) Expand all Loading... |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #include "v8.h" | 28 #include "v8.h" |
29 | 29 |
30 #include "cctest.h" | 30 #include "cctest.h" |
31 #include "cpu.h" | 31 #include "libplatform/task-queue.h" |
| 32 #include "test-libplatform.h" |
32 | 33 |
33 using namespace v8::internal; | 34 using namespace v8::internal; |
34 | 35 |
35 | 36 |
36 TEST(FeatureImplications) { | 37 TEST(TaskQueueBasic) { |
37 // Test for features implied by other features. | 38 int task_counter = 0; |
38 CPU cpu; | |
39 | 39 |
40 // ia32 and x64 features | 40 TaskQueue queue; |
41 CHECK(!cpu.has_sse() || cpu.has_mmx()); | |
42 CHECK(!cpu.has_sse2() || cpu.has_sse()); | |
43 CHECK(!cpu.has_sse3() || cpu.has_sse2()); | |
44 CHECK(!cpu.has_ssse3() || cpu.has_sse3()); | |
45 CHECK(!cpu.has_sse41() || cpu.has_sse3()); | |
46 CHECK(!cpu.has_sse42() || cpu.has_sse41()); | |
47 | 41 |
48 // arm features | 42 TestTask* task = new TestTask(&task_counter); |
49 CHECK(!cpu.has_vfp3_d32() || cpu.has_vfp3()); | 43 queue.Append(task); |
| 44 CHECK_EQ(1, task_counter); |
| 45 CHECK_EQ(task, queue.GetNext()); |
| 46 delete task; |
| 47 CHECK_EQ(0, task_counter); |
| 48 |
| 49 queue.Terminate(); |
| 50 CHECK_EQ(NULL, queue.GetNext()); |
50 } | 51 } |
51 | 52 |
52 | 53 |
53 TEST(NumberOfProcessorsOnline) { | 54 class ReadQueueTask : public TestTask { |
54 CHECK_GT(CPU::NumberOfProcessorsOnline(), 0); | 55 public: |
| 56 ReadQueueTask(int* task_counter, TaskQueue* queue) |
| 57 : TestTask(task_counter, true), queue_(queue) {} |
| 58 virtual ~ReadQueueTask() {} |
| 59 |
| 60 virtual void Run() V8_OVERRIDE { |
| 61 TestTask::Run(); |
| 62 CHECK_EQ(NULL, queue_->GetNext()); |
| 63 } |
| 64 |
| 65 private: |
| 66 TaskQueue* queue_; |
| 67 |
| 68 DISALLOW_COPY_AND_ASSIGN(ReadQueueTask); |
| 69 }; |
| 70 |
| 71 |
| 72 TEST(TaskQueueTerminateMultipleReaders) { |
| 73 TaskQueue queue; |
| 74 int task_counter = 0; |
| 75 ReadQueueTask* read1 = new ReadQueueTask(&task_counter, &queue); |
| 76 ReadQueueTask* read2 = new ReadQueueTask(&task_counter, &queue); |
| 77 |
| 78 TestThread thread1(read1); |
| 79 TestThread thread2(read2); |
| 80 |
| 81 thread1.Start(); |
| 82 thread2.Start(); |
| 83 |
| 84 CHECK_EQ(2, task_counter); |
| 85 |
| 86 thread1.Signal(); |
| 87 thread2.Signal(); |
| 88 |
| 89 queue.Terminate(); |
| 90 |
| 91 thread1.Join(); |
| 92 thread2.Join(); |
| 93 |
| 94 CHECK_EQ(0, task_counter); |
55 } | 95 } |
OLD | NEW |