Skip to content

Fix circular queue size #11

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
etwest merged 1 commit into from
Jun 5, 2021
Merged

Fix circular queue size #11

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/buffer_tree.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -73,7 +73,7 @@ nodes, int workers, bool reset=false) : dir(dir), M(size), B(b), N(nodes) {

// create the circular queue in which we will place ripe fruit (full leaves)
// make space for full 2 * workers full updates
cq = new CircularQueue(2*workers, 2*M);
cq = new CircularQueue(2*workers, 2*leaf_size);

// will want to use mmap instead? - how much is in RAM after allocation (none?)
// can't use mmap instead might use it as well. (Still need to create the file to be a given size)
Expand Down