rev_persistence.rs 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440
  1. use crate::cache::{
  2. disk::{RevisionChangeset, RevisionDiskCache},
  3. memory::RevisionMemoryCacheDelegate,
  4. };
  5. use crate::disk::{RevisionState, SyncRecord};
  6. use crate::memory::RevisionMemoryCache;
  7. use crate::RevisionMergeable;
  8. use flowy_error::{internal_error, FlowyError, FlowyResult};
  9. use flowy_http_model::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. #[derive(Clone)]
  16. pub struct RevisionPersistenceConfiguration {
  17. merge_threshold: usize,
  18. merge_lagging: bool,
  19. }
  20. impl RevisionPersistenceConfiguration {
  21. pub fn new(merge_threshold: usize, merge_lagging: bool) -> Self {
  22. debug_assert!(merge_threshold > 1);
  23. if merge_threshold > 1 {
  24. Self {
  25. merge_threshold,
  26. merge_lagging,
  27. }
  28. } else {
  29. Self {
  30. merge_threshold: 100,
  31. merge_lagging,
  32. }
  33. }
  34. }
  35. }
  36. impl std::default::Default for RevisionPersistenceConfiguration {
  37. fn default() -> Self {
  38. Self {
  39. merge_threshold: 100,
  40. merge_lagging: false,
  41. }
  42. }
  43. }
  44. pub struct RevisionPersistence<Connection> {
  45. user_id: String,
  46. object_id: String,
  47. disk_cache: Arc<dyn RevisionDiskCache<Connection, Error = FlowyError>>,
  48. memory_cache: Arc<RevisionMemoryCache>,
  49. sync_seq: RwLock<DeferSyncSequence>,
  50. configuration: RevisionPersistenceConfiguration,
  51. }
  52. impl<Connection> RevisionPersistence<Connection>
  53. where
  54. Connection: 'static,
  55. {
  56. pub fn new<C>(
  57. user_id: &str,
  58. object_id: &str,
  59. disk_cache: C,
  60. configuration: RevisionPersistenceConfiguration,
  61. ) -> RevisionPersistence<Connection>
  62. where
  63. C: 'static + RevisionDiskCache<Connection, Error = FlowyError>,
  64. {
  65. let disk_cache = Arc::new(disk_cache) as Arc<dyn RevisionDiskCache<Connection, Error = FlowyError>>;
  66. Self::from_disk_cache(user_id, object_id, disk_cache, configuration)
  67. }
  68. pub fn from_disk_cache(
  69. user_id: &str,
  70. object_id: &str,
  71. disk_cache: Arc<dyn RevisionDiskCache<Connection, Error = FlowyError>>,
  72. configuration: RevisionPersistenceConfiguration,
  73. ) -> RevisionPersistence<Connection> {
  74. let object_id = object_id.to_owned();
  75. let user_id = user_id.to_owned();
  76. let sync_seq = RwLock::new(DeferSyncSequence::new());
  77. let memory_cache = Arc::new(RevisionMemoryCache::new(&object_id, Arc::new(disk_cache.clone())));
  78. Self {
  79. user_id,
  80. object_id,
  81. disk_cache,
  82. memory_cache,
  83. sync_seq,
  84. configuration,
  85. }
  86. }
  87. /// Save the revision that comes from remote to disk.
  88. #[tracing::instrument(level = "trace", skip(self, revision), fields(rev_id, object_id=%self.object_id), err)]
  89. pub(crate) async fn add_ack_revision(&self, revision: &Revision) -> FlowyResult<()> {
  90. tracing::Span::current().record("rev_id", &revision.rev_id);
  91. self.add(revision.clone(), RevisionState::Ack, true).await
  92. }
  93. /// Append the revision that already existed in the local DB state to sync sequence
  94. #[tracing::instrument(level = "trace", skip(self), fields(rev_id, object_id=%self.object_id), err)]
  95. pub(crate) async fn sync_revision(&self, revision: &Revision) -> FlowyResult<()> {
  96. tracing::Span::current().record("rev_id", &revision.rev_id);
  97. self.add(revision.clone(), RevisionState::Sync, false).await?;
  98. self.sync_seq.write().await.recv(revision.rev_id)?;
  99. Ok(())
  100. }
  101. #[tracing::instrument(level = "trace", skip_all, err)]
  102. pub async fn compact_lagging_revisions<'a>(
  103. &'a self,
  104. rev_compress: &Arc<dyn RevisionMergeable + 'a>,
  105. ) -> FlowyResult<()> {
  106. if !self.configuration.merge_lagging {
  107. return Ok(());
  108. }
  109. let mut sync_seq = self.sync_seq.write().await;
  110. let compact_seq = sync_seq.compact();
  111. if !compact_seq.is_empty() {
  112. let range = RevisionRange {
  113. start: *compact_seq.front().unwrap(),
  114. end: *compact_seq.back().unwrap(),
  115. };
  116. let revisions = self.revisions_in_range(&range).await?;
  117. let rev_ids = range.to_rev_ids();
  118. debug_assert_eq!(range.len() as usize, revisions.len());
  119. // compact multiple revisions into one
  120. let merged_revision = rev_compress.merge_revisions(&self.user_id, &self.object_id, revisions)?;
  121. tracing::Span::current().record("rev_id", &merged_revision.rev_id);
  122. let record = SyncRecord {
  123. revision: merged_revision,
  124. state: RevisionState::Sync,
  125. write_to_disk: true,
  126. };
  127. let _ = self
  128. .disk_cache
  129. .delete_and_insert_records(&self.object_id, Some(rev_ids), vec![record])?;
  130. }
  131. Ok(())
  132. }
  133. /// Save the revision to disk and append it to the end of the sync sequence.
  134. #[tracing::instrument(level = "trace", skip_all, fields(rev_id, compact_range, object_id=%self.object_id), err)]
  135. pub(crate) async fn add_sync_revision<'a>(
  136. &'a self,
  137. new_revision: &'a Revision,
  138. rev_compress: &Arc<dyn RevisionMergeable + 'a>,
  139. ) -> FlowyResult<i64> {
  140. let mut sync_seq = self.sync_seq.write().await;
  141. let compact_length = sync_seq.compact_length;
  142. // Before the new_revision is pushed into the sync_seq, we check if the current `compact_length` of the
  143. // sync_seq is less equal to or greater than the merge threshold. If yes, it's needs to merged
  144. // with the new_revision into one revision.
  145. let mut compact_seq = VecDeque::default();
  146. // tracing::info!("{}", compact_seq)
  147. if compact_length >= self.configuration.merge_threshold - 1 {
  148. compact_seq.extend(sync_seq.compact());
  149. }
  150. if !compact_seq.is_empty() {
  151. let range = RevisionRange {
  152. start: *compact_seq.front().unwrap(),
  153. end: *compact_seq.back().unwrap(),
  154. };
  155. tracing::Span::current().record("compact_range", &format!("{}", range).as_str());
  156. let mut revisions = self.revisions_in_range(&range).await?;
  157. debug_assert_eq!(range.len() as usize, revisions.len());
  158. // append the new revision
  159. revisions.push(new_revision.clone());
  160. // compact multiple revisions into one
  161. let merged_revision = rev_compress.merge_revisions(&self.user_id, &self.object_id, revisions)?;
  162. let rev_id = merged_revision.rev_id;
  163. tracing::Span::current().record("rev_id", &merged_revision.rev_id);
  164. let _ = sync_seq.recv(merged_revision.rev_id)?;
  165. // replace the revisions in range with compact revision
  166. self.compact(&range, merged_revision).await?;
  167. Ok(rev_id)
  168. } else {
  169. tracing::Span::current().record("rev_id", &new_revision.rev_id);
  170. self.add(new_revision.clone(), RevisionState::Sync, true).await?;
  171. sync_seq.merge_recv(new_revision.rev_id)?;
  172. Ok(new_revision.rev_id)
  173. }
  174. }
  175. /// Remove the revision with rev_id from the sync sequence.
  176. pub(crate) async fn ack_revision(&self, rev_id: i64) -> FlowyResult<()> {
  177. if self.sync_seq.write().await.ack(&rev_id).is_ok() {
  178. self.memory_cache.ack(&rev_id).await;
  179. }
  180. Ok(())
  181. }
  182. pub(crate) async fn next_sync_revision(&self) -> FlowyResult<Option<Revision>> {
  183. match self.sync_seq.read().await.next_rev_id() {
  184. None => Ok(None),
  185. Some(rev_id) => Ok(self.get(rev_id).await.map(|record| record.revision)),
  186. }
  187. }
  188. pub(crate) async fn next_sync_rev_id(&self) -> Option<i64> {
  189. self.sync_seq.read().await.next_rev_id()
  190. }
  191. pub(crate) fn number_of_sync_records(&self) -> usize {
  192. self.memory_cache.number_of_sync_records()
  193. }
  194. pub(crate) fn number_of_records_in_disk(&self) -> usize {
  195. match self.disk_cache.read_revision_records(&self.object_id, None) {
  196. Ok(records) => records.len(),
  197. Err(e) => {
  198. tracing::error!("Read revision records failed: {:?}", e);
  199. 0
  200. }
  201. }
  202. }
  203. /// The cache gets reset while it conflicts with the remote revisions.
  204. #[tracing::instrument(level = "trace", skip(self, revisions), err)]
  205. pub(crate) async fn reset(&self, revisions: Vec<Revision>) -> FlowyResult<()> {
  206. let records = revisions
  207. .into_iter()
  208. .map(|revision| SyncRecord {
  209. revision,
  210. state: RevisionState::Sync,
  211. write_to_disk: false,
  212. })
  213. .collect::<Vec<_>>();
  214. let _ = self
  215. .disk_cache
  216. .delete_and_insert_records(&self.object_id, None, records.clone())?;
  217. let _ = self.memory_cache.reset_with_revisions(records).await;
  218. self.sync_seq.write().await.clear();
  219. Ok(())
  220. }
  221. async fn add(&self, revision: Revision, state: RevisionState, write_to_disk: bool) -> FlowyResult<()> {
  222. if self.memory_cache.contains(&revision.rev_id) {
  223. tracing::warn!("Duplicate revision: {}:{}-{:?}", self.object_id, revision.rev_id, state);
  224. return Ok(());
  225. }
  226. let record = SyncRecord {
  227. revision,
  228. state,
  229. write_to_disk,
  230. };
  231. self.memory_cache.add(Cow::Owned(record)).await;
  232. Ok(())
  233. }
  234. async fn compact(&self, range: &RevisionRange, new_revision: Revision) -> FlowyResult<()> {
  235. self.memory_cache.remove_with_range(range);
  236. let rev_ids = range.to_rev_ids();
  237. let _ = self
  238. .disk_cache
  239. .delete_revision_records(&self.object_id, Some(rev_ids))?;
  240. self.add(new_revision, RevisionState::Sync, true).await?;
  241. Ok(())
  242. }
  243. pub async fn get(&self, rev_id: i64) -> Option<SyncRecord> {
  244. match self.memory_cache.get(&rev_id).await {
  245. None => match self
  246. .disk_cache
  247. .read_revision_records(&self.object_id, Some(vec![rev_id]))
  248. {
  249. Ok(mut records) => {
  250. let record = records.pop()?;
  251. assert!(records.is_empty());
  252. Some(record)
  253. }
  254. Err(e) => {
  255. tracing::error!("{}", e);
  256. None
  257. }
  258. },
  259. Some(revision) => Some(revision),
  260. }
  261. }
  262. pub fn load_all_records(&self, object_id: &str) -> FlowyResult<Vec<SyncRecord>> {
  263. self.disk_cache.read_revision_records(object_id, None)
  264. }
  265. // Read the revision which rev_id >= range.start && rev_id <= range.end
  266. pub async fn revisions_in_range(&self, range: &RevisionRange) -> FlowyResult<Vec<Revision>> {
  267. let range = range.clone();
  268. let mut records = self.memory_cache.get_with_range(&range).await?;
  269. let range_len = range.len() as usize;
  270. if records.len() != range_len {
  271. let disk_cache = self.disk_cache.clone();
  272. let object_id = self.object_id.clone();
  273. records = spawn_blocking(move || disk_cache.read_revision_records_with_range(&object_id, &range))
  274. .await
  275. .map_err(internal_error)??;
  276. if records.len() != range_len {
  277. // #[cfg(debug_assertions)]
  278. // records.iter().for_each(|record| {
  279. // let delta = PlainDelta::from_bytes(&record.revision.delta_data).unwrap();
  280. // tracing::trace!("{}", delta.to_string());
  281. // });
  282. tracing::error!("Expect revision len {},but receive {}", range_len, records.len());
  283. }
  284. }
  285. Ok(records
  286. .into_iter()
  287. .map(|record| record.revision)
  288. .collect::<Vec<Revision>>())
  289. }
  290. }
  291. impl<C> RevisionMemoryCacheDelegate for Arc<dyn RevisionDiskCache<C, Error = FlowyError>> {
  292. fn send_sync(&self, mut records: Vec<SyncRecord>) -> FlowyResult<()> {
  293. records.retain(|record| record.write_to_disk);
  294. if !records.is_empty() {
  295. tracing::Span::current().record(
  296. "checkpoint_result",
  297. &format!("{} records were saved", records.len()).as_str(),
  298. );
  299. let _ = self.create_revision_records(records)?;
  300. }
  301. Ok(())
  302. }
  303. fn receive_ack(&self, object_id: &str, rev_id: i64) {
  304. let changeset = RevisionChangeset {
  305. object_id: object_id.to_string(),
  306. rev_id: rev_id.into(),
  307. state: RevisionState::Ack,
  308. };
  309. match self.update_revision_record(vec![changeset]) {
  310. Ok(_) => {}
  311. Err(e) => tracing::error!("{}", e),
  312. }
  313. }
  314. }
  315. #[derive(Default)]
  316. struct DeferSyncSequence {
  317. rev_ids: VecDeque<i64>,
  318. compact_index: Option<usize>,
  319. compact_length: usize,
  320. }
  321. impl DeferSyncSequence {
  322. fn new() -> Self {
  323. DeferSyncSequence::default()
  324. }
  325. /// Pushes the new_rev_id to the end of the list and marks this new_rev_id is mergeable.
  326. ///
  327. /// When calling `compact` method, it will return a list of revision ids started from
  328. /// the `compact_start_pos`, and ends with the `compact_length`.
  329. fn merge_recv(&mut self, new_rev_id: i64) -> FlowyResult<()> {
  330. let _ = self.recv(new_rev_id)?;
  331. self.compact_length += 1;
  332. if self.compact_index.is_none() && !self.rev_ids.is_empty() {
  333. self.compact_index = Some(self.rev_ids.len() - 1);
  334. }
  335. Ok(())
  336. }
  337. /// Pushes the new_rev_id to the end of the list.
  338. fn recv(&mut self, new_rev_id: i64) -> FlowyResult<()> {
  339. // The last revision's rev_id must be greater than the new one.
  340. if let Some(rev_id) = self.rev_ids.back() {
  341. if *rev_id >= new_rev_id {
  342. return Err(
  343. FlowyError::internal().context(format!("The new revision's id must be greater than {}", rev_id))
  344. );
  345. }
  346. }
  347. self.rev_ids.push_back(new_rev_id);
  348. Ok(())
  349. }
  350. /// Removes the rev_id from the list
  351. fn ack(&mut self, rev_id: &i64) -> FlowyResult<()> {
  352. let cur_rev_id = self.rev_ids.front().cloned();
  353. if let Some(pop_rev_id) = cur_rev_id {
  354. if &pop_rev_id != rev_id {
  355. let desc = format!(
  356. "The ack rev_id:{} is not equal to the current rev_id:{}",
  357. rev_id, pop_rev_id
  358. );
  359. return Err(FlowyError::internal().context(desc));
  360. }
  361. let mut compact_rev_id = None;
  362. if let Some(compact_index) = self.compact_index {
  363. compact_rev_id = self.rev_ids.get(compact_index).cloned();
  364. }
  365. let pop_rev_id = self.rev_ids.pop_front();
  366. if let (Some(compact_rev_id), Some(pop_rev_id)) = (compact_rev_id, pop_rev_id) {
  367. if compact_rev_id <= pop_rev_id && self.compact_length > 0 {
  368. self.compact_length -= 1;
  369. }
  370. }
  371. }
  372. Ok(())
  373. }
  374. fn next_rev_id(&self) -> Option<i64> {
  375. self.rev_ids.front().cloned()
  376. }
  377. fn clear(&mut self) {
  378. self.compact_index = None;
  379. self.compact_length = 0;
  380. self.rev_ids.clear();
  381. }
  382. // Compact the rev_ids into one except the current synchronizing rev_id.
  383. fn compact(&mut self) -> VecDeque<i64> {
  384. let mut compact_seq = VecDeque::with_capacity(self.rev_ids.len());
  385. if let Some(start) = self.compact_index {
  386. if start < self.rev_ids.len() {
  387. let seq = self.rev_ids.split_off(start);
  388. compact_seq.extend(seq);
  389. }
  390. }
  391. self.compact_index = None;
  392. self.compact_length = 0;
  393. compact_seq
  394. }
  395. }