Searched refs:okay (Results 1 – 4 of 4) sorted by relevance
89 bool okay = true; in flog_once() local103 okay = value_is(my_value + 1); in flog_once()106 okay = is_okay(); in flog_once()114 okay = value_is(my_value + 1); in flog_once()130 okay = value_is(my_value + 1); in flog_once()133 okay = is_okay(); in flog_once()141 okay = value_is(my_value + 1); in flog_once()145 REQUIRE(okay); in flog_once()
248 bool okay; in ConcurrentHashSerialFib() local249 okay = Fib.insert(std::make_pair(0, 0)); in ConcurrentHashSerialFib()250 assert(okay); // assign initial values in ConcurrentHashSerialFib()251 okay = Fib.insert(std::make_pair(1, 1)); in ConcurrentHashSerialFib()252 assert(okay); in ConcurrentHashSerialFib()261 okay = Fib.find(fresult, n); in ConcurrentHashSerialFib()262 assert(okay); in ConcurrentHashSerialFib()
147 bool okay = true; in TestReaderWriterLock_Impl() local157 okay = counter.value_is(counter_value + 1); in TestReaderWriterLock_Impl()160 okay = counter.value_is(counter.value[0]); in TestReaderWriterLock_Impl()169 okay = counter.value_is(counter_value + 1); in TestReaderWriterLock_Impl()172 CHECK_MESSAGE(okay, "Error in read write mutex operations"); in TestReaderWriterLock_Impl()
20 okay. Hence the goal is to establish serial ordering of tasks