| OLD | NEW |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 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 11 matching lines...) Expand all Loading... |
| 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 // Tests of the circular queue. | 28 // Tests of the circular queue. |
| 29 | 29 |
| 30 #include "src/v8.h" | 30 #include "src/v8.h" |
| 31 | 31 |
| 32 #include "src/circular-queue-inl.h" | 32 #include "src/profiler/circular-queue-inl.h" |
| 33 #include "test/cctest/cctest.h" | 33 #include "test/cctest/cctest.h" |
| 34 | 34 |
| 35 using i::SamplingCircularQueue; | 35 using i::SamplingCircularQueue; |
| 36 | 36 |
| 37 | 37 |
| 38 TEST(SamplingCircularQueue) { | 38 TEST(SamplingCircularQueue) { |
| 39 typedef v8::base::AtomicWord Record; | 39 typedef v8::base::AtomicWord Record; |
| 40 const int kMaxRecordsInQueue = 4; | 40 const int kMaxRecordsInQueue = 4; |
| 41 SamplingCircularQueue<Record, kMaxRecordsInQueue> scq; | 41 SamplingCircularQueue<Record, kMaxRecordsInQueue> scq; |
| 42 | 42 |
| (...skipping 135 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 178 Record* rec = reinterpret_cast<Record*>(scq.Peek()); | 178 Record* rec = reinterpret_cast<Record*>(scq.Peek()); |
| 179 CHECK(rec); | 179 CHECK(rec); |
| 180 CHECK_EQ(static_cast<int64_t>(i), static_cast<int64_t>(*rec)); | 180 CHECK_EQ(static_cast<int64_t>(i), static_cast<int64_t>(*rec)); |
| 181 CHECK_EQ(rec, reinterpret_cast<Record*>(scq.Peek())); | 181 CHECK_EQ(rec, reinterpret_cast<Record*>(scq.Peek())); |
| 182 scq.Remove(); | 182 scq.Remove(); |
| 183 CHECK_NE(rec, reinterpret_cast<Record*>(scq.Peek())); | 183 CHECK_NE(rec, reinterpret_cast<Record*>(scq.Peek())); |
| 184 } | 184 } |
| 185 | 185 |
| 186 CHECK(!scq.Peek()); | 186 CHECK(!scq.Peek()); |
| 187 } | 187 } |
| OLD | NEW |