summaryrefslogtreecommitdiffstats
path: root/include/shard/MemISAM.h
diff options
context:
space:
mode:
authorDouglas Rumbaugh <dbr4@psu.edu>2023-07-26 09:44:44 -0400
committerDouglas Rumbaugh <dbr4@psu.edu>2023-07-26 09:44:44 -0400
commit63929187f2c1d0c95719d8435794a5136cb1cc73 (patch)
tree4cc146eee6751ba58f89ea56a5704830dd8dc42d /include/shard/MemISAM.h
parent8e86ca7ce7823bbdb1e71c329ae1bd564c0d54fb (diff)
downloaddynamic-extension-63929187f2c1d0c95719d8435794a5136cb1cc73.tar.gz
Adjusted calculation for index size
Diffstat (limited to 'include/shard/MemISAM.h')
-rw-r--r--include/shard/MemISAM.h21
1 files changed, 11 insertions, 10 deletions
diff --git a/include/shard/MemISAM.h b/include/shard/MemISAM.h
index 4680cb9..3e3215f 100644
--- a/include/shard/MemISAM.h
+++ b/include/shard/MemISAM.h
@@ -99,9 +99,9 @@ public:
m_bf = new BloomFilter<R>(BF_FPR, buffer->get_tombstone_count(), BF_HASH_FUNCS);
- size_t alloc_size = (buffer->get_record_count() * sizeof(Wrapped<R>)) + (CACHELINE_SIZE - (buffer->get_record_count() * sizeof(Wrapped<R>)) % CACHELINE_SIZE);
- assert(alloc_size % CACHELINE_SIZE == 0);
- m_data = (Wrapped<R>*)std::aligned_alloc(CACHELINE_SIZE, alloc_size);
+ m_alloc_size = (buffer->get_record_count() * sizeof(Wrapped<R>)) + (CACHELINE_SIZE - (buffer->get_record_count() * sizeof(Wrapped<R>)) % CACHELINE_SIZE);
+ assert(m_alloc_size % CACHELINE_SIZE == 0);
+ m_data = (Wrapped<R>*)std::aligned_alloc(CACHELINE_SIZE, m_alloc_size);
TIMER_INIT();
@@ -175,9 +175,9 @@ public:
m_bf = new BloomFilter<R>(BF_FPR, tombstone_count, BF_HASH_FUNCS);
- size_t alloc_size = (attemp_reccnt * sizeof(Wrapped<R>)) + (CACHELINE_SIZE - (attemp_reccnt * sizeof(Wrapped<R>)) % CACHELINE_SIZE);
- assert(alloc_size % CACHELINE_SIZE == 0);
- m_data = (Wrapped<R>*)std::aligned_alloc(CACHELINE_SIZE, alloc_size);
+ m_alloc_size = (attemp_reccnt * sizeof(Wrapped<R>)) + (CACHELINE_SIZE - (attemp_reccnt * sizeof(Wrapped<R>)) % CACHELINE_SIZE);
+ assert(m_alloc_size % CACHELINE_SIZE == 0);
+ m_data = (Wrapped<R>*)std::aligned_alloc(CACHELINE_SIZE, m_alloc_size);
size_t offset = 0;
@@ -254,7 +254,7 @@ public:
}
size_t get_memory_usage() {
- return m_internal_node_cnt * inmem_isam_node_size;
+ return m_internal_node_cnt * inmem_isam_node_size + m_alloc_size;
}
private:
@@ -307,10 +307,10 @@ private:
node_cnt += level_node_cnt;
} while (level_node_cnt > 1);
- size_t alloc_size = (node_cnt * inmem_isam_node_size) + (CACHELINE_SIZE - (node_cnt * inmem_isam_node_size) % CACHELINE_SIZE);
- assert(alloc_size % CACHELINE_SIZE == 0);
+ m_alloc_size = (node_cnt * inmem_isam_node_size) + (CACHELINE_SIZE - (node_cnt * inmem_isam_node_size) % CACHELINE_SIZE);
+ assert(m_alloc_size % CACHELINE_SIZE == 0);
- m_isam_nodes = (InMemISAMNode*)std::aligned_alloc(CACHELINE_SIZE, alloc_size);
+ m_isam_nodes = (InMemISAMNode*)std::aligned_alloc(CACHELINE_SIZE, m_alloc_size);
m_internal_node_cnt = node_cnt;
memset(m_isam_nodes, 0, node_cnt * inmem_isam_node_size);
@@ -371,6 +371,7 @@ private:
size_t m_tombstone_cnt;
size_t m_internal_node_cnt;
size_t m_deleted_cnt;
+ size_t m_alloc_size;
};
template <RecordInterface R, bool Rejection=true>