rev_persistence.rs 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317
  1. use crate::cache::{
  2. disk::{RevisionChangeset, RevisionDiskCache},
  3. memory::RevisionMemoryCacheDelegate,
  4. };
  5. use crate::disk::{RevisionRecord, RevisionState};
  6. use crate::memory::RevisionMemoryCache;
  7. use crate::RevisionCompress;
  8. use flowy_error::{internal_error, FlowyError, FlowyResult};
  9. use flowy_sync::entities::revision::{Revision, RevisionRange};
  10. use std::collections::VecDeque;
  11. use std::{borrow::Cow, sync::Arc};
  12. use tokio::sync::RwLock;
  13. use tokio::task::spawn_blocking;
  14. pub const REVISION_WRITE_INTERVAL_IN_MILLIS: u64 = 600;
  15. pub struct RevisionPersistence<Connection> {
  16. user_id: String,
  17. object_id: String,
  18. disk_cache: Arc<dyn RevisionDiskCache<Connection, Error = FlowyError>>,
  19. memory_cache: Arc<RevisionMemoryCache>,
  20. sync_seq: RwLock<RevisionSyncSequence>,
  21. }
  22. impl<Connection: 'static> RevisionPersistence<Connection> {
  23. pub fn new<C>(user_id: &str, object_id: &str, disk_cache: C) -> RevisionPersistence<Connection>
  24. where
  25. C: 'static + RevisionDiskCache<Connection, Error = FlowyError>,
  26. {
  27. let disk_cache = Arc::new(disk_cache) as Arc<dyn RevisionDiskCache<Connection, Error = FlowyError>>;
  28. Self::from_disk_cache(user_id, object_id, disk_cache)
  29. }
  30. pub fn from_disk_cache(
  31. user_id: &str,
  32. object_id: &str,
  33. disk_cache: Arc<dyn RevisionDiskCache<Connection, Error = FlowyError>>,
  34. ) -> RevisionPersistence<Connection> {
  35. let object_id = object_id.to_owned();
  36. let user_id = user_id.to_owned();
  37. let sync_seq = RwLock::new(RevisionSyncSequence::new());
  38. let memory_cache = Arc::new(RevisionMemoryCache::new(&object_id, Arc::new(disk_cache.clone())));
  39. Self {
  40. user_id,
  41. object_id,
  42. disk_cache,
  43. memory_cache,
  44. sync_seq,
  45. }
  46. }
  47. /// Save the revision that comes from remote to disk.
  48. #[tracing::instrument(level = "trace", skip(self, revision), fields(rev_id, object_id=%self.object_id), err)]
  49. pub(crate) async fn add_ack_revision(&self, revision: &Revision) -> FlowyResult<()> {
  50. tracing::Span::current().record("rev_id", &revision.rev_id);
  51. self.add(revision.clone(), RevisionState::Ack, true).await
  52. }
  53. /// Append the revision that already existed in the local DB state to sync sequence
  54. #[tracing::instrument(level = "trace", skip(self), fields(rev_id, object_id=%self.object_id), err)]
  55. pub(crate) async fn sync_revision(&self, revision: &Revision) -> FlowyResult<()> {
  56. tracing::Span::current().record("rev_id", &revision.rev_id);
  57. self.add(revision.clone(), RevisionState::Sync, false).await?;
  58. self.sync_seq.write().await.add(revision.rev_id)?;
  59. Ok(())
  60. }
  61. /// Save the revision to disk and append it to the end of the sync sequence.
  62. #[tracing::instrument(level = "trace", skip_all, fields(rev_id, compact_range, object_id=%self.object_id), err)]
  63. pub(crate) async fn add_sync_revision<'a>(
  64. &'a self,
  65. revision: &'a Revision,
  66. rev_compress: &Arc<dyn RevisionCompress + 'a>,
  67. ) -> FlowyResult<i64> {
  68. let mut sync_seq_write_guard = self.sync_seq.write().await;
  69. let result = sync_seq_write_guard.compact();
  70. match result {
  71. None => {
  72. tracing::Span::current().record("rev_id", &revision.rev_id);
  73. self.add(revision.clone(), RevisionState::Sync, true).await?;
  74. sync_seq_write_guard.add(revision.rev_id)?;
  75. Ok(revision.rev_id)
  76. }
  77. Some((range, mut compact_seq)) => {
  78. tracing::Span::current().record("compact_range", &format!("{}", range).as_str());
  79. let mut revisions = self.revisions_in_range(&range).await?;
  80. if range.to_rev_ids().len() != revisions.len() {
  81. debug_assert_eq!(range.to_rev_ids().len(), revisions.len());
  82. }
  83. // append the new revision
  84. revisions.push(revision.clone());
  85. // compact multiple revisions into one
  86. let compact_revision = rev_compress.compress_revisions(&self.user_id, &self.object_id, revisions)?;
  87. let rev_id = compact_revision.rev_id;
  88. tracing::Span::current().record("rev_id", &rev_id);
  89. // insert new revision
  90. compact_seq.push_back(rev_id);
  91. // replace the revisions in range with compact revision
  92. self.compact(&range, compact_revision).await?;
  93. //
  94. debug_assert_eq!(compact_seq.len(), 2);
  95. debug_assert_eq!(sync_seq_write_guard.len(), compact_seq.len());
  96. sync_seq_write_guard.reset(compact_seq);
  97. Ok(rev_id)
  98. }
  99. }
  100. }
  101. /// Remove the revision with rev_id from the sync sequence.
  102. pub(crate) async fn ack_revision(&self, rev_id: i64) -> FlowyResult<()> {
  103. if self.sync_seq.write().await.ack(&rev_id).is_ok() {
  104. self.memory_cache.ack(&rev_id).await;
  105. }
  106. Ok(())
  107. }
  108. pub(crate) async fn next_sync_revision(&self) -> FlowyResult<Option<Revision>> {
  109. match self.sync_seq.read().await.next_rev_id() {
  110. None => Ok(None),
  111. Some(rev_id) => Ok(self.get(rev_id).await.map(|record| record.revision)),
  112. }
  113. }
  114. /// The cache gets reset while it conflicts with the remote revisions.
  115. #[tracing::instrument(level = "trace", skip(self, revisions), err)]
  116. pub(crate) async fn reset(&self, revisions: Vec<Revision>) -> FlowyResult<()> {
  117. let records = revisions
  118. .into_iter()
  119. .map(|revision| RevisionRecord {
  120. revision,
  121. state: RevisionState::Sync,
  122. write_to_disk: false,
  123. })
  124. .collect::<Vec<_>>();
  125. let _ = self
  126. .disk_cache
  127. .delete_and_insert_records(&self.object_id, None, records.clone())?;
  128. let _ = self.memory_cache.reset_with_revisions(records).await;
  129. self.sync_seq.write().await.clear();
  130. Ok(())
  131. }
  132. async fn add(&self, revision: Revision, state: RevisionState, write_to_disk: bool) -> FlowyResult<()> {
  133. if self.memory_cache.contains(&revision.rev_id) {
  134. tracing::warn!("Duplicate revision: {}:{}-{:?}", self.object_id, revision.rev_id, state);
  135. return Ok(());
  136. }
  137. let record = RevisionRecord {
  138. revision,
  139. state,
  140. write_to_disk,
  141. };
  142. self.memory_cache.add(Cow::Owned(record)).await;
  143. Ok(())
  144. }
  145. async fn compact(&self, range: &RevisionRange, new_revision: Revision) -> FlowyResult<()> {
  146. self.memory_cache.remove_with_range(range);
  147. let rev_ids = range.to_rev_ids();
  148. let _ = self
  149. .disk_cache
  150. .delete_revision_records(&self.object_id, Some(rev_ids))?;
  151. self.add(new_revision, RevisionState::Sync, true).await?;
  152. Ok(())
  153. }
  154. pub async fn get(&self, rev_id: i64) -> Option<RevisionRecord> {
  155. match self.memory_cache.get(&rev_id).await {
  156. None => match self
  157. .disk_cache
  158. .read_revision_records(&self.object_id, Some(vec![rev_id]))
  159. {
  160. Ok(mut records) => {
  161. let record = records.pop()?;
  162. assert!(records.is_empty());
  163. Some(record)
  164. }
  165. Err(e) => {
  166. tracing::error!("{}", e);
  167. None
  168. }
  169. },
  170. Some(revision) => Some(revision),
  171. }
  172. }
  173. pub fn batch_get(&self, doc_id: &str) -> FlowyResult<Vec<RevisionRecord>> {
  174. self.disk_cache.read_revision_records(doc_id, None)
  175. }
  176. // Read the revision which rev_id >= range.start && rev_id <= range.end
  177. pub async fn revisions_in_range(&self, range: &RevisionRange) -> FlowyResult<Vec<Revision>> {
  178. let range = range.clone();
  179. let mut records = self.memory_cache.get_with_range(&range).await?;
  180. let range_len = range.len() as usize;
  181. if records.len() != range_len {
  182. let disk_cache = self.disk_cache.clone();
  183. let object_id = self.object_id.clone();
  184. records = spawn_blocking(move || disk_cache.read_revision_records_with_range(&object_id, &range))
  185. .await
  186. .map_err(internal_error)??;
  187. if records.len() != range_len {
  188. // #[cfg(debug_assertions)]
  189. // records.iter().for_each(|record| {
  190. // let delta = PlainDelta::from_bytes(&record.revision.delta_data).unwrap();
  191. // tracing::trace!("{}", delta.to_string());
  192. // });
  193. tracing::error!("Expect revision len {},but receive {}", range_len, records.len());
  194. }
  195. }
  196. Ok(records
  197. .into_iter()
  198. .map(|record| record.revision)
  199. .collect::<Vec<Revision>>())
  200. }
  201. }
  202. impl<C> RevisionMemoryCacheDelegate for Arc<dyn RevisionDiskCache<C, Error = FlowyError>> {
  203. fn checkpoint_tick(&self, mut records: Vec<RevisionRecord>) -> FlowyResult<()> {
  204. records.retain(|record| record.write_to_disk);
  205. if !records.is_empty() {
  206. tracing::Span::current().record(
  207. "checkpoint_result",
  208. &format!("{} records were saved", records.len()).as_str(),
  209. );
  210. let _ = self.create_revision_records(records)?;
  211. }
  212. Ok(())
  213. }
  214. fn receive_ack(&self, object_id: &str, rev_id: i64) {
  215. let changeset = RevisionChangeset {
  216. object_id: object_id.to_string(),
  217. rev_id: rev_id.into(),
  218. state: RevisionState::Ack,
  219. };
  220. match self.update_revision_record(vec![changeset]) {
  221. Ok(_) => {}
  222. Err(e) => tracing::error!("{}", e),
  223. }
  224. }
  225. }
  226. #[derive(Default)]
  227. struct RevisionSyncSequence(VecDeque<i64>);
  228. impl RevisionSyncSequence {
  229. fn new() -> Self {
  230. RevisionSyncSequence::default()
  231. }
  232. fn add(&mut self, new_rev_id: i64) -> FlowyResult<()> {
  233. // The last revision's rev_id must be greater than the new one.
  234. if let Some(rev_id) = self.0.back() {
  235. if *rev_id >= new_rev_id {
  236. return Err(
  237. FlowyError::internal().context(format!("The new revision's id must be greater than {}", rev_id))
  238. );
  239. }
  240. }
  241. self.0.push_back(new_rev_id);
  242. Ok(())
  243. }
  244. fn ack(&mut self, rev_id: &i64) -> FlowyResult<()> {
  245. let cur_rev_id = self.0.front().cloned();
  246. if let Some(pop_rev_id) = cur_rev_id {
  247. if &pop_rev_id != rev_id {
  248. let desc = format!(
  249. "The ack rev_id:{} is not equal to the current rev_id:{}",
  250. rev_id, pop_rev_id
  251. );
  252. return Err(FlowyError::internal().context(desc));
  253. }
  254. let _ = self.0.pop_front();
  255. }
  256. Ok(())
  257. }
  258. fn next_rev_id(&self) -> Option<i64> {
  259. self.0.front().cloned()
  260. }
  261. fn reset(&mut self, new_seq: VecDeque<i64>) {
  262. self.0 = new_seq;
  263. }
  264. fn clear(&mut self) {
  265. self.0.clear();
  266. }
  267. fn len(&self) -> usize {
  268. self.0.len()
  269. }
  270. // Compact the rev_ids into one except the current synchronizing rev_id.
  271. fn compact(&self) -> Option<(RevisionRange, VecDeque<i64>)> {
  272. // Make sure there are two rev_id going to sync. No need to compact if there is only
  273. // one rev_id in queue.
  274. self.next_rev_id()?;
  275. let mut new_seq = self.0.clone();
  276. let mut drained = new_seq.drain(1..).collect::<VecDeque<_>>();
  277. let start = drained.pop_front()?;
  278. let end = drained.pop_back().unwrap_or(start);
  279. Some((RevisionRange { start, end }, new_seq))
  280. }
  281. }