rev_persistence.rs 12 KB

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