| 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 15 matching lines...) Expand all Loading... |
| 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 unbound queue. | 28 // Tests of the unbound queue. |
| 29 | 29 |
| 30 // TODO(mythria): Remove this define after this flag is turned on globally | 30 // TODO(mythria): Remove this define after this flag is turned on globally |
| 31 #define V8_IMMINENT_DEPRECATION_WARNINGS | 31 #define V8_IMMINENT_DEPRECATION_WARNINGS |
| 32 | 32 |
| 33 #include "src/v8.h" | 33 #include "src/v8.h" |
| 34 #include "test/cctest/cctest.h" | 34 #include "test/cctest/cctest.h" |
| 35 | 35 |
| 36 #include "src/unbound-queue-inl.h" | 36 #include "src/profiler/unbound-queue-inl.h" |
| 37 | 37 |
| 38 using i::UnboundQueue; | 38 using i::UnboundQueue; |
| 39 | 39 |
| 40 | 40 |
| 41 TEST(SingleRecord) { | 41 TEST(SingleRecord) { |
| 42 typedef int Record; | 42 typedef int Record; |
| 43 UnboundQueue<Record> cq; | 43 UnboundQueue<Record> cq; |
| 44 CHECK(cq.IsEmpty()); | 44 CHECK(cq.IsEmpty()); |
| 45 cq.Enqueue(1); | 45 cq.Enqueue(1); |
| 46 CHECK(!cq.IsEmpty()); | 46 CHECK(!cq.IsEmpty()); |
| (...skipping 24 matching lines...) Expand all Loading... |
| 71 cq.Enqueue(i); | 71 cq.Enqueue(i); |
| 72 CHECK(!cq.IsEmpty()); | 72 CHECK(!cq.IsEmpty()); |
| 73 } | 73 } |
| 74 for (int i = 5; i <= 12; ++i) { | 74 for (int i = 5; i <= 12; ++i) { |
| 75 CHECK(!cq.IsEmpty()); | 75 CHECK(!cq.IsEmpty()); |
| 76 cq.Dequeue(&rec); | 76 cq.Dequeue(&rec); |
| 77 CHECK_EQ(i, rec); | 77 CHECK_EQ(i, rec); |
| 78 } | 78 } |
| 79 CHECK(cq.IsEmpty()); | 79 CHECK(cq.IsEmpty()); |
| 80 } | 80 } |
| OLD | NEW |