This repository has been archived by the owner on May 3, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 142
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
CORTX-27600 dtm0/log: initial implementation for dtx0 and pruner (#1503)
Problem: Currently, dtm0 log entries are stored in a simple list, which reduces the performance because for each pmsg we have to traverse this list to find the entry to update it with the information about the received pmsg. Solution: In the dtm0 log we store the entries in the btree. This solves the above issue. Also, we add a simple pruner which deletes the old records from the log if they are All-P (i.e. received pmsgs from all participants). Without pmsgs and redo_lists (TBD in next PRs), the pruner just deletes records from the log as soon as they are added there. In contrary to the old dtm0 code currently in main, which requires compilation option to be enabled, this code will be always ON. It will help us to debug the code earlier. The patch contains UTs for the log and the pruner. Signed-off-by: Maxim Medved max.medved@seagate.com Co-authored-by: Ivan Alekhin ivan.alekhin@seagate.com Co-authored-by: Madhavrao Vemuri madhav.vemuri@seagate.com Co-authored-by: Andriy Tkachuk andriy.tkachuk@seagate.com
- Loading branch information
1 parent
929bf4d
commit 88581ea
Showing
54 changed files
with
2,667 additions
and
182 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.