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

docs: 修复了drivearray占用物理内存过高的问题

Browse Source
This commit is contained in:
ZhuangYumin
2023-12-03 16:36:04 +00:00
parent 768368438c
commit 8b93821b9e
1 changed files with 27 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
backend/include/drivearray.hpp
View File

@ -26,6 +26,8 @@ class DriveArray {
((info_len + 2) * sizeof(int) + kPageSize - 1) / kPageSize * kPageSize; ((info_len + 2) * sizeof(int) + kPageSize - 1) / kPageSize * kPageSize;
std::stack<int> free_mem; std::stack<int> free_mem;
int total_mem = 0; int total_mem = 0;
const int kRefreshThreshold = 100;
unsigned int forced_refresh = 0;
std::mutex mtx; std::mutex mtx;
void reallocate(bool include_resync = false) { void reallocate(bool include_resync = false) {
size_t length_needed = size_t length_needed =
@ -41,6 +43,11 @@ 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() {
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;
@ -86,6 +93,8 @@ class DriveArray {
for (int i = 0; i < free_mem_cnt; i++) { for (int i = 0; i < free_mem_cnt; i++) {
free_mem.push(*(p++)); free_mem.push(*(p++));
} }
madvise(virtual_mem + stk_data_begin, free_mem_cnt * sizeof(int),
MADV_FREE);
} }
void initialise(std::string FN = "") { void initialise(std::string FN = "") {
@ -109,11 +118,19 @@ class DriveArray {
void get_info(int &tmp, int n) { void get_info(int &tmp, int n) {
if (n > info_len) return; if (n > info_len) return;
tmp = *((int *)(virtual_mem) + n - 1); tmp = *((int *)(virtual_mem) + n - 1);
if (++forced_refresh >= kRefreshThreshold) {
forced_refresh = 0;
ForceRefresh();
}
} }
void write_info(int tmp, int n) { void write_info(int tmp, int n) {
if (n > info_len) return; if (n > info_len) return;
*((int *)(virtual_mem) + n - 1) = tmp; *((int *)(virtual_mem) + n - 1) = tmp;
if (++forced_refresh >= kRefreshThreshold) {
forced_refresh = 0;
ForceRefresh();
}
} }
int write(T &t) { int write(T &t) {
@ -131,14 +148,22 @@ class DriveArray {
reallocate(); reallocate();
void *data_begin = virtual_mem + raw_data_begin + sizeofT * (index - 1); void *data_begin = virtual_mem + raw_data_begin + sizeofT * (index - 1);
std::memmove(data_begin, &t, sizeofT); std::memmove(data_begin, &t, sizeofT);
madvise(data_begin, sizeofT, MADV_DONTNEED); madvise(data_begin, sizeofT, MADV_FREE);
if (++forced_refresh >= kRefreshThreshold) {
forced_refresh = 0;
ForceRefresh();
}
} }
void read(T &t, const int index) { void read(T &t, const int index) {
reallocate(); reallocate();
void *data_begin = virtual_mem + raw_data_begin + sizeofT * (index - 1); void *data_begin = virtual_mem + raw_data_begin + sizeofT * (index - 1);
std::memmove(&t, data_begin, sizeofT); std::memmove(&t, data_begin, sizeofT);
madvise(data_begin, sizeofT, MADV_DONTNEED); madvise(data_begin, sizeofT, MADV_FREE);
if (++forced_refresh >= kRefreshThreshold) {
forced_refresh = 0;
ForceRefresh();
}
} }
void Delete(int index) { free_mem.push(index); } void Delete(int index) { free_mem.push(index); }