1 | // Copyright 2019 The Marl Authors. |
2 | // |
3 | // Licensed under the Apache License, Version 2.0 (the "License"); |
4 | // you may not use this file except in compliance with the License. |
5 | // You may obtain a copy of the License at |
6 | // |
7 | // https://www.apache.org/licenses/LICENSE-2.0 |
8 | // |
9 | // Unless required by applicable law or agreed to in writing, software |
10 | // distributed under the License is distributed on an "AS IS" BASIS, |
11 | // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
12 | // See the License for the specific language governing permissions and |
13 | // limitations under the License. |
14 | |
15 | #include "marl_test.h" |
16 | |
17 | #include "marl/ticket.h" |
18 | |
19 | TEST_P(WithBoundScheduler, Ticket) { |
20 | marl::Ticket::Queue queue; |
21 | |
22 | constexpr int count = 1000; |
23 | std::atomic<int> next = {0}; |
24 | int result[count] = {}; |
25 | |
26 | for (int i = 0; i < count; i++) { |
27 | auto ticket = queue.take(); |
28 | marl::schedule([ticket, i, &result, &next] { |
29 | ticket.wait(); |
30 | result[next++] = i; |
31 | ticket.done(); |
32 | }); |
33 | } |
34 | |
35 | queue.take().wait(); |
36 | |
37 | for (int i = 0; i < count; i++) { |
38 | ASSERT_EQ(result[i], i); |
39 | } |
40 | } |
41 | |