2020-11-24 20:55:58 +03:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2020, Sergey Bugaev <bugaevc@serenityos.org>
|
|
|
|
*
|
2021-04-22 11:24:48 +03:00
|
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
2020-11-24 20:55:58 +03:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <AK/Assertions.h>
|
|
|
|
#include <AK/NonnullRefPtrVector.h>
|
2021-05-22 19:47:42 +03:00
|
|
|
#include <LibThreading/Thread.h>
|
2021-07-06 15:28:19 +03:00
|
|
|
#include <errno.h>
|
2020-11-24 20:55:58 +03:00
|
|
|
#include <pthread.h>
|
2021-07-06 15:28:19 +03:00
|
|
|
#include <semaphore.h>
|
2021-03-12 19:29:37 +03:00
|
|
|
#include <unistd.h>
|
2020-11-24 20:55:58 +03:00
|
|
|
|
|
|
|
static void test_once()
|
|
|
|
{
|
|
|
|
constexpr size_t threads_count = 10;
|
|
|
|
|
|
|
|
static Vector<int> v;
|
|
|
|
v.clear();
|
|
|
|
pthread_once_t once = PTHREAD_ONCE_INIT;
|
2021-05-22 19:47:42 +03:00
|
|
|
NonnullRefPtrVector<Threading::Thread, threads_count> threads;
|
2020-11-24 20:55:58 +03:00
|
|
|
|
|
|
|
for (size_t i = 0; i < threads_count; i++) {
|
2021-05-22 19:47:42 +03:00
|
|
|
threads.append(Threading::Thread::construct([&] {
|
2020-11-24 20:55:58 +03:00
|
|
|
return pthread_once(&once, [] {
|
|
|
|
v.append(35);
|
|
|
|
sleep(1);
|
|
|
|
});
|
|
|
|
}));
|
|
|
|
threads.last().start();
|
|
|
|
}
|
|
|
|
for (auto& thread : threads)
|
LibThread: Improve semantics of Thread::join, and remove Thread::quit.
Thread::quit was created before the pthread_create_helper in pthread.cpp
that automagically calls pthread_exit from all pthreads after the user's
thread function exits. It is unused, and unecessary now.
Cleanup some logging, and make join return a Result<T, ThreadError>.
This also adds a new type, LibThread::ThreadError as an
AK::DistinctNumeric. Hopefully, this will make it possible to have a
Result<int, ThreadError> and have it compile? It also makes it clear
that the int there is an error at the call site.
By default, the T on join is void, meaning the caller doesn't care about
the return value from the thread.
As Result is a [[nodiscard]] type, also change the current caller of
join to explicitly ignore it.
Move the logging out of join as well, as it's the user's
responsibility whether to log or not.
2021-01-01 06:56:04 +03:00
|
|
|
[[maybe_unused]] auto res = thread.join();
|
2020-11-24 20:55:58 +03:00
|
|
|
|
2021-02-23 22:42:32 +03:00
|
|
|
VERIFY(v.size() == 1);
|
2020-11-24 20:55:58 +03:00
|
|
|
}
|
|
|
|
|
2021-07-06 20:05:39 +03:00
|
|
|
static void test_mutex()
|
|
|
|
{
|
|
|
|
constexpr size_t threads_count = 10;
|
|
|
|
constexpr size_t num_times = 100;
|
|
|
|
|
|
|
|
Vector<int> v;
|
|
|
|
NonnullRefPtrVector<Threading::Thread, threads_count> threads;
|
|
|
|
pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
|
|
|
|
|
|
|
|
for (size_t i = 0; i < threads_count; i++) {
|
|
|
|
threads.append(Threading::Thread::construct([&] {
|
|
|
|
for (size_t j = 0; j < num_times; j++) {
|
|
|
|
pthread_mutex_lock(&mutex);
|
|
|
|
v.append(35);
|
|
|
|
sched_yield();
|
|
|
|
pthread_mutex_unlock(&mutex);
|
|
|
|
sched_yield();
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}));
|
|
|
|
threads.last().start();
|
|
|
|
}
|
|
|
|
for (auto& thread : threads)
|
|
|
|
[[maybe_unused]] auto res = thread.join();
|
|
|
|
|
|
|
|
VERIFY(v.size() == threads_count * num_times);
|
|
|
|
VERIFY(pthread_mutex_trylock(&mutex) == 0);
|
|
|
|
VERIFY(pthread_mutex_trylock(&mutex) == EBUSY);
|
|
|
|
}
|
|
|
|
|
2021-07-06 15:28:19 +03:00
|
|
|
static void test_semaphore_as_lock()
|
|
|
|
{
|
|
|
|
constexpr size_t threads_count = 10;
|
|
|
|
constexpr size_t num_times = 100;
|
|
|
|
|
|
|
|
Vector<int> v;
|
|
|
|
NonnullRefPtrVector<Threading::Thread, threads_count> threads;
|
|
|
|
sem_t semaphore;
|
|
|
|
sem_init(&semaphore, 0, 1);
|
|
|
|
|
|
|
|
for (size_t i = 0; i < threads_count; i++) {
|
|
|
|
threads.append(Threading::Thread::construct([&] {
|
|
|
|
for (size_t j = 0; j < num_times; j++) {
|
|
|
|
sem_wait(&semaphore);
|
|
|
|
v.append(35);
|
|
|
|
sched_yield();
|
|
|
|
sem_post(&semaphore);
|
|
|
|
sched_yield();
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}));
|
|
|
|
threads.last().start();
|
|
|
|
}
|
|
|
|
for (auto& thread : threads)
|
|
|
|
[[maybe_unused]] auto res = thread.join();
|
|
|
|
|
|
|
|
VERIFY(v.size() == threads_count * num_times);
|
|
|
|
VERIFY(sem_trywait(&semaphore) == 0);
|
|
|
|
VERIFY(sem_trywait(&semaphore) == EAGAIN);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_semaphore_as_event()
|
|
|
|
{
|
|
|
|
Vector<int> v;
|
|
|
|
sem_t semaphore;
|
|
|
|
sem_init(&semaphore, 0, 0);
|
|
|
|
|
|
|
|
auto reader = Threading::Thread::construct([&] {
|
|
|
|
sem_wait(&semaphore);
|
|
|
|
VERIFY(v.size() == 1);
|
|
|
|
return 0;
|
|
|
|
});
|
|
|
|
reader->start();
|
|
|
|
|
|
|
|
auto writer = Threading::Thread::construct([&] {
|
|
|
|
sched_yield();
|
|
|
|
v.append(35);
|
|
|
|
sem_post(&semaphore);
|
|
|
|
return 0;
|
|
|
|
});
|
|
|
|
writer->start();
|
|
|
|
|
|
|
|
[[maybe_unused]] auto r1 = reader->join();
|
|
|
|
[[maybe_unused]] auto r2 = writer->join();
|
|
|
|
|
|
|
|
VERIFY(sem_trywait(&semaphore) == EAGAIN);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_semaphore_nonbinary()
|
|
|
|
{
|
|
|
|
constexpr size_t num = 5;
|
|
|
|
constexpr size_t threads_count = 10;
|
|
|
|
constexpr size_t num_times = 100;
|
|
|
|
|
|
|
|
NonnullRefPtrVector<Threading::Thread, threads_count> threads;
|
|
|
|
sem_t semaphore;
|
|
|
|
sem_init(&semaphore, 0, num);
|
|
|
|
|
|
|
|
Atomic<u32, AK::memory_order_relaxed> value = 0;
|
|
|
|
Atomic<bool, AK::memory_order_relaxed> seen_more_than_two = false;
|
|
|
|
|
|
|
|
for (size_t i = 0; i < threads_count; i++) {
|
|
|
|
threads.append(Threading::Thread::construct([&] {
|
|
|
|
for (size_t j = 0; j < num_times; j++) {
|
|
|
|
sem_wait(&semaphore);
|
|
|
|
u32 v = 1 + value.fetch_add(1);
|
|
|
|
VERIFY(v <= num);
|
|
|
|
if (v > 2)
|
|
|
|
seen_more_than_two.store(true);
|
|
|
|
sched_yield();
|
|
|
|
value.fetch_sub(1);
|
|
|
|
sem_post(&semaphore);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}));
|
|
|
|
threads.last().start();
|
|
|
|
}
|
|
|
|
|
|
|
|
for (auto& thread : threads)
|
|
|
|
[[maybe_unused]] auto res = thread.join();
|
|
|
|
|
|
|
|
VERIFY(value.load() == 0);
|
|
|
|
VERIFY(seen_more_than_two.load());
|
|
|
|
for (size_t i = 0; i < num; i++) {
|
|
|
|
VERIFY(sem_trywait(&semaphore) == 0);
|
|
|
|
}
|
|
|
|
VERIFY(sem_trywait(&semaphore) == EAGAIN);
|
|
|
|
}
|
|
|
|
|
2020-11-24 20:55:58 +03:00
|
|
|
int main()
|
|
|
|
{
|
|
|
|
test_once();
|
2021-07-06 20:05:39 +03:00
|
|
|
test_mutex();
|
2021-07-06 15:28:19 +03:00
|
|
|
|
|
|
|
test_semaphore_as_lock();
|
|
|
|
test_semaphore_as_event();
|
|
|
|
test_semaphore_nonbinary();
|
|
|
|
|
2020-11-24 20:55:58 +03:00
|
|
|
return 0;
|
|
|
|
}
|