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
66
67
68
69
70
71
72
73
74
75
76
77
78
|
#pragma once
#include "hashtable.h"
#include "shared_memory.h"
#include <cstring>
#include <fcntl.h>
#include <optional>
#include <sys/mman.h>
#include <unistd.h>
template <typename K, typename V>
class SharedMemoryServer {
public:
SharedMemoryServer(size_t size)
: hash_table(size)
{
shm_fd = shm_open(SHM_NAME, O_CREAT | O_RDWR, 0666);
ftruncate(shm_fd, sizeof(SharedMemory));
shared_memory = (SharedMemory*)
mmap(0, sizeof(SharedMemory), PROT_READ | PROT_WRITE, MAP_SHARED, shm_fd, 0);
shared_memory->processed = true;
}
~SharedMemoryServer()
{
munmap(shared_memory, sizeof(SharedMemory));
close(shm_fd);
shm_unlink(SHM_NAME);
std::cout << "bye" << '\n';
}
void process_requests()
{
while (true) {
sleep(1); // TODO: remove sleep, add a mutex for shared memory, should then work with
// queue size 1
if (!shared_memory->processed) {
std::cout << "Got a request!" << '\n';
Request request = shared_memory->request;
shared_memory->processed = true;
K key = deserialize<K>(request.key);
V value = deserialize<V>(request.value);
switch (request.type) {
case INSERT:
hash_table.insert(key, value);
break;
case GET: {
std::optional<V> result = hash_table.get(key);
if (result.has_value()) {
std::string response = serialize<V>(result.value());
strncpy(shared_memory->response, response.c_str(), MAX_VALUE_SIZE);
}
break;
}
case DELETE:
hash_table.remove(key);
break;
case PRINT:
hash_table.print();
break;
default:
break;
}
}
}
}
private:
HashTable<K, V> hash_table;
int shm_fd;
SharedMemory* shared_memory;
};
|