ZYM/BH-Bookstore-2023
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

upd: optimize database

Browse Source
This commit is contained in:
ZhuangYumin
2023-12-04 08:14:27 +00:00
parent 01864d5a5e
commit e76bdbd436
2 changed files with 34 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
backend/include/drivearray.hpp
View File

@ -41,33 +41,35 @@ class DriveArray {
virtual_mem = mmap(nullptr, file_length, PROT_READ | PROT_WRITE, MAP_SHARED, virtual_mem = mmap(nullptr, file_length, PROT_READ | PROT_WRITE, MAP_SHARED,
file_descriptor, 0); file_descriptor, 0);
} }
void ForceRefresh() noexcept {
munmap(virtual_mem, file_length);
virtual_mem = mmap(nullptr, file_length, PROT_READ | PROT_WRITE, MAP_SHARED,
file_descriptor, 0);
}
public: public:
DriveArray() = default; DriveArray() = default;
inline bool IsOpen() const noexcept { return file_descriptor >= 0; } inline bool IsOpen() const noexcept { return file_descriptor >= 0; }
~DriveArray() { ~DriveArray() {
reallocate(true); if (file_descriptor >= 0) {
int stk_data_begin = reallocate(true);
raw_data_begin + int stk_data_begin =
(sizeofT * total_mem + kPageSize - 1) / kPageSize * kPageSize; raw_data_begin +
*((int *)(virtual_mem) + info_len) = total_mem; (sizeofT * total_mem + kPageSize - 1) / kPageSize * kPageSize;
*((int *)(virtual_mem) + info_len + 1) = (int)free_mem.size(); *((int *)(virtual_mem) + info_len) = total_mem;
int *p = (int *)(virtual_mem + stk_data_begin); *((int *)(virtual_mem) + info_len + 1) = (int)free_mem.size();
while (!free_mem.empty()) { int *p = (int *)(virtual_mem + stk_data_begin);
*(p++) = free_mem.top(); while (!free_mem.empty()) {
free_mem.pop(); *(p++) = free_mem.top();
free_mem.pop();
}
munmap(virtual_mem, file_length);
close(file_descriptor);
file_descriptor = -1;
} }
munmap(virtual_mem, file_length);
close(file_descriptor);
file_descriptor = -1;
} }
bool operator=(const DriveArray &) = delete; bool operator=(const DriveArray &) = delete;
void ForceRefresh() noexcept {
munmap(virtual_mem, file_length);
virtual_mem = mmap(nullptr, file_length, PROT_READ | PROT_WRITE, MAP_SHARED,
file_descriptor, 0);
}
void *RawData() noexcept { return virtual_mem; }
void OpenFile(const std::string &file_name) { void OpenFile(const std::string &file_name) {
if (file_name == "") return; if (file_name == "") return;
if (file_descriptor >= 0) { if (file_descriptor >= 0) {

16
backend/include/key2index.hpp
View File

@ -57,7 +57,12 @@ class String2Index {
mem.OpenFile(file_name); mem.OpenFile(file_name);
delete[] hash_table; delete[] hash_table;
hash_table = new int[kBucketSize]; hash_table = new int[kBucketSize];
for (int i = 0; i < kBucketSize; ++i) mem.get_info(hash_table[i], i + 1); // std::memmove(hash_table, mem.RawData(), sizeof(int) * kBucketSize);
// mem.ForceRefresh();
for (int i = 0; i < kBucketSize; i++) {
hash_table[i] = *((int *)(mem.RawData()) + i);
if (i % 4096 == 0) mem.ForceRefresh();
}
} }
String2Index(const std::string __file_name) : file_name(__file_name) { String2Index(const std::string __file_name) : file_name(__file_name) {
OpenFile(file_name); OpenFile(file_name);
@ -72,8 +77,13 @@ class String2Index {
hash_table = new int[kBucketSize](); hash_table = new int[kBucketSize]();
} }
~String2Index() { ~String2Index() {
for (int i = 0; i < kBucketSize; ++i) mem.write_info(hash_table[i], i + 1); if (hash_table != nullptr) {
delete[] hash_table; for (int i = 0; i < kBucketSize; i++) {
*((int *)(mem.RawData()) + i) = hash_table[i];
if (i % 4096 == 0) mem.ForceRefresh();
}
delete[] hash_table;
}
} }
void Insert(const std::string &str, int val) noexcept { void Insert(const std::string &str, int val) noexcept {
size_t hash_val = Hash(str); size_t hash_val = Hash(str);