| OLD | NEW |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 the V8 project authors. All rights reserved. |
| 2 // | 2 // |
| 3 // Tests of circular queues. | 3 // Tests of circular queues. |
| 4 | 4 |
| 5 #include "v8.h" | 5 #include "v8.h" |
| 6 #include "circular-queue-inl.h" | 6 #include "circular-queue-inl.h" |
| 7 #include "cctest.h" | 7 #include "cctest.h" |
| 8 | 8 |
| 9 namespace i = v8::internal; | 9 namespace i = v8::internal; |
| 10 | 10 |
| (...skipping 107 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 118 scq.FinishDequeue(); | 118 scq.FinishDequeue(); |
| 119 CHECK_NE(rec, reinterpret_cast<Record*>(scq.StartDequeue())); | 119 CHECK_NE(rec, reinterpret_cast<Record*>(scq.StartDequeue())); |
| 120 } | 120 } |
| 121 // Consumption must still be possible as the first cell of the | 121 // Consumption must still be possible as the first cell of the |
| 122 // last chunk is not clean. | 122 // last chunk is not clean. |
| 123 CHECK_NE(NULL, scq.StartDequeue()); | 123 CHECK_NE(NULL, scq.StartDequeue()); |
| 124 | 124 |
| 125 scq.TearDownConsumer(); | 125 scq.TearDownConsumer(); |
| 126 scq.TearDownProducer(); | 126 scq.TearDownProducer(); |
| 127 } | 127 } |
| OLD | NEW |