| 32 | } |
| 33 | |
| 34 | void dequeue(T *entry) { |
| 35 | std::unique_lock l(lock); |
| 36 | while (entries.empty()) { |
| 37 | cond.wait(l); |
| 38 | }; |
| 39 | ceph_assert(!entries.empty()); |
| 40 | *entry = entries.front(); |
| 41 | entries.pop_front(); |
| 42 | }; |
| 43 | }; |
| 44 | |
| 45 | std::vector<QueueBucket> buckets; |