| 121 | } |
| 122 | |
| 123 | TEST(KeyTest, creating_key_in_parallel) { |
| 124 | Counters args; |
| 125 | pthread_t th[8]; |
| 126 | bthread_t bth[8]; |
| 127 | for (size_t i = 0; i < arraysize(th); ++i) { |
| 128 | ASSERT_EQ(0, pthread_create(&th[i], NULL, worker1, &args)); |
| 129 | } |
| 130 | for (size_t i = 0; i < arraysize(bth); ++i) { |
| 131 | ASSERT_EQ(0, bthread_start_background(&bth[i], NULL, worker1, &args)); |
| 132 | } |
| 133 | for (size_t i = 0; i < arraysize(th); ++i) { |
| 134 | ASSERT_EQ(0, pthread_join(th[i], NULL)); |
| 135 | } |
| 136 | for (size_t i = 0; i < arraysize(bth); ++i) { |
| 137 | ASSERT_EQ(0, bthread_join(bth[i], NULL)); |
| 138 | } |
| 139 | ASSERT_EQ(arraysize(th) + arraysize(bth), |
| 140 | args.nenterthread.load(butil::memory_order_relaxed)); |
| 141 | ASSERT_EQ(arraysize(th) + arraysize(bth), |
| 142 | args.nleavethread.load(butil::memory_order_relaxed)); |
| 143 | ASSERT_EQ(NKEY_PER_WORKER * (arraysize(th) + arraysize(bth)), |
| 144 | args.ncreate.load(butil::memory_order_relaxed)); |
| 145 | ASSERT_EQ(NKEY_PER_WORKER * (arraysize(th) + arraysize(bth)), |
| 146 | args.ndestroy.load(butil::memory_order_relaxed)); |
| 147 | } |
| 148 | |
| 149 | butil::atomic<size_t> seq(1); |
| 150 | std::vector<size_t> seqs; |
nothing calls this directly
no test coverage detected