mod.rs 12 KB

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