1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
/* Copyright (c) 2020 Johannes Stoelp */
#include "thread.h"
#include "arch.h"
#include "executor.h"
#include <cassert>
#include <exception>
#include <iostream>
#include <sys/mman.h> // mmap
#include <unistd.h> // sysconf
namespace {
static long get_pagesize() { return ::sysconf(_SC_PAGESIZE); }
} // namespace
namespace nMatcha {
Thread::Thread() : mStackPtr(nullptr), mFinished(false), mExecutor(nullptr) {
const long PAGE_SIZE = get_pagesize();
const long STACK_SIZE = 8 * PAGE_SIZE;
// Allocate new stack.
void* stack = ::mmap(nullptr, STACK_SIZE, PROT_WRITE | PROT_READ, MAP_PRIVATE | MAP_ANONYMOUS, -1 /* fd */, 0 /* offset */);
assert(stack != MAP_FAILED);
// Simple stack overflow detection by removing permissions from last
// stack page (lowest addr).
// In theory stack pointer could be decremented by more than one page
// and the page below last stack page could be used. However we don't
// take care of that now and risk the memory corruption.
int ret = ::mprotect(stack, PAGE_SIZE, PROT_NONE);
assert(ret == 0);
// Adjust stack pointer, as stack grows downwards.
mStackPtr = static_cast<uint8_t*>(stack) + STACK_SIZE;
// Arch specific stack initialization.
mStackPtr = init_stack(mStackPtr, Thread::entry, static_cast<void*>(this));
}
void Thread::entry(void* obj) {
Thread* t = static_cast<Thread*>(obj);
try {
t->threadFn();
} catch (const std::exception& e) {
std::cerr << "Thread: caught unhandled std::exception!\n" << e.what() << std::endl;
} catch (...) {
std::cerr << "Thread: caught unhandled unknown exception!" << std::endl;
}
t->mFinished = true;
t->yield();
}
void Thread::yield() {
assert(mExecutor);
::yield(mExecutor->getStackPtr(), &mStackPtr);
}
std::unique_ptr<Thread> FnThread::make(UserFn f) { return std::make_unique<FnThread>(CreatorToken{}, f); }
void FnThread::threadFn() { mUserFn(*this); }
void FnThread::yield() { Thread::yield(); }
} // namespace nMatcha
|
