FSTMemoryMutationQueue.mm 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441
  1. /*
  2. * Copyright 2017 Google
  3. *
  4. * Licensed under the Apache License, Version 2.0 (the "License");
  5. * you may not use this file except in compliance with the License.
  6. * You may obtain a copy of the License at
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  10. * Unless required by applicable law or agreed to in writing, software
  11. * distributed under the License is distributed on an "AS IS" BASIS,
  12. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. * See the License for the specific language governing permissions and
  14. * limitations under the License.
  15. */
  16. #import "Firestore/Source/Local/FSTMemoryMutationQueue.h"
  17. #import "Firestore/Source/Core/FSTQuery.h"
  18. #import "Firestore/Source/Local/FSTDocumentReference.h"
  19. #import "Firestore/Source/Local/FSTMemoryPersistence.h"
  20. #import "Firestore/Source/Model/FSTMutation.h"
  21. #import "Firestore/Source/Model/FSTMutationBatch.h"
  22. #import "Firestore/third_party/Immutable/FSTImmutableSortedSet.h"
  23. #include "Firestore/core/src/firebase/firestore/model/document_key.h"
  24. #include "Firestore/core/src/firebase/firestore/model/resource_path.h"
  25. #include "Firestore/core/src/firebase/firestore/util/hard_assert.h"
  26. using firebase::firestore::model::DocumentKey;
  27. using firebase::firestore::model::ResourcePath;
  28. NS_ASSUME_NONNULL_BEGIN
  29. static const NSComparator NumberComparator = ^NSComparisonResult(NSNumber *left, NSNumber *right) {
  30. return [left compare:right];
  31. };
  32. @interface FSTMemoryMutationQueue ()
  33. /**
  34. * A FIFO queue of all mutations to apply to the backend. Mutations are added to the end of the
  35. * queue as they're written, and removed from the front of the queue as the mutations become
  36. * visible or are rejected.
  37. *
  38. * When successfully applied, mutations must be acknowledged by the write stream and made visible
  39. * on the watch stream. It's possible for the watch stream to fall behind in which case the batches
  40. * at the head of the queue will be acknowledged but held until the watch stream sees the changes.
  41. *
  42. * If a batch is rejected while there are held write acknowledgements at the head of the queue
  43. * the rejected batch is converted to a tombstone: its mutations are removed but the batch remains
  44. * in the queue. This maintains a simple consecutive ordering of batches in the queue.
  45. *
  46. * Once the held write acknowledgements become visible they are removed from the head of the queue
  47. * along with any tombstones that follow.
  48. */
  49. @property(nonatomic, strong, readonly) NSMutableArray<FSTMutationBatch *> *queue;
  50. /** An ordered mapping between documents and the mutation batch IDs. */
  51. @property(nonatomic, strong) FSTImmutableSortedSet<FSTDocumentReference *> *batchesByDocumentKey;
  52. /** The next value to use when assigning sequential IDs to each mutation batch. */
  53. @property(nonatomic, assign) FSTBatchID nextBatchID;
  54. /** The highest acknowledged mutation in the queue. */
  55. @property(nonatomic, assign) FSTBatchID highestAcknowledgedBatchID;
  56. /**
  57. * The last received stream token from the server, used to acknowledge which responses the client
  58. * has processed. Stream tokens are opaque checkpoint markers whose only real value is their
  59. * inclusion in the next request.
  60. */
  61. @property(nonatomic, strong, nullable) NSData *lastStreamToken;
  62. @end
  63. @implementation FSTMemoryMutationQueue {
  64. FSTMemoryPersistence *_persistence;
  65. }
  66. - (instancetype)initWithPersistence:(FSTMemoryPersistence *)persistence {
  67. if (self = [super init]) {
  68. _persistence = persistence;
  69. _queue = [NSMutableArray array];
  70. _batchesByDocumentKey =
  71. [FSTImmutableSortedSet setWithComparator:FSTDocumentReferenceComparatorByKey];
  72. _nextBatchID = 1;
  73. _highestAcknowledgedBatchID = kFSTBatchIDUnknown;
  74. }
  75. return self;
  76. }
  77. #pragma mark - FSTMutationQueue implementation
  78. - (void)start {
  79. // Note: The queue may be shutdown / started multiple times, since we maintain the queue for the
  80. // duration of the app session in case a user logs out / back in. To behave like the
  81. // LevelDB-backed MutationQueue (and accommodate tests that expect as much), we reset nextBatchID
  82. // and highestAcknowledgedBatchID if the queue is empty.
  83. if (self.isEmpty) {
  84. self.nextBatchID = 1;
  85. self.highestAcknowledgedBatchID = kFSTBatchIDUnknown;
  86. }
  87. HARD_ASSERT(self.highestAcknowledgedBatchID < self.nextBatchID,
  88. "highestAcknowledgedBatchID must be less than the nextBatchID");
  89. }
  90. - (BOOL)isEmpty {
  91. // If the queue has any entries at all, the first entry must not be a tombstone (otherwise it
  92. // would have been removed already).
  93. return self.queue.count == 0;
  94. }
  95. - (FSTBatchID)highestAcknowledgedBatchID {
  96. return _highestAcknowledgedBatchID;
  97. }
  98. - (void)acknowledgeBatch:(FSTMutationBatch *)batch streamToken:(nullable NSData *)streamToken {
  99. NSMutableArray<FSTMutationBatch *> *queue = self.queue;
  100. FSTBatchID batchID = batch.batchID;
  101. HARD_ASSERT(batchID > self.highestAcknowledgedBatchID,
  102. "Mutation batchIDs must be acknowledged in order");
  103. NSInteger batchIndex = [self indexOfExistingBatchID:batchID action:@"acknowledged"];
  104. // Verify that the batch in the queue is the one to be acknowledged.
  105. FSTMutationBatch *check = queue[(NSUInteger)batchIndex];
  106. HARD_ASSERT(batchID == check.batchID, "Queue ordering failure: expected batch %s, got batch %s",
  107. batchID, check.batchID);
  108. HARD_ASSERT(![check isTombstone], "Can't acknowledge a previously removed batch");
  109. self.highestAcknowledgedBatchID = batchID;
  110. self.lastStreamToken = streamToken;
  111. }
  112. - (FSTMutationBatch *)addMutationBatchWithWriteTime:(FIRTimestamp *)localWriteTime
  113. mutations:(NSArray<FSTMutation *> *)mutations {
  114. HARD_ASSERT(mutations.count > 0, "Mutation batches should not be empty");
  115. FSTBatchID batchID = self.nextBatchID;
  116. self.nextBatchID += 1;
  117. NSMutableArray<FSTMutationBatch *> *queue = self.queue;
  118. if (queue.count > 0) {
  119. FSTMutationBatch *prior = queue[queue.count - 1];
  120. HARD_ASSERT(prior.batchID < batchID,
  121. "Mutation batchIDs must be monotonically increasing order");
  122. }
  123. FSTMutationBatch *batch = [[FSTMutationBatch alloc] initWithBatchID:batchID
  124. localWriteTime:localWriteTime
  125. mutations:mutations];
  126. [queue addObject:batch];
  127. // Track references by document key.
  128. FSTImmutableSortedSet<FSTDocumentReference *> *references = self.batchesByDocumentKey;
  129. for (FSTMutation *mutation in batch.mutations) {
  130. references = [references
  131. setByAddingObject:[[FSTDocumentReference alloc] initWithKey:mutation.key ID:batchID]];
  132. }
  133. self.batchesByDocumentKey = references;
  134. return batch;
  135. }
  136. - (nullable FSTMutationBatch *)lookupMutationBatch:(FSTBatchID)batchID {
  137. NSMutableArray<FSTMutationBatch *> *queue = self.queue;
  138. NSInteger index = [self indexOfBatchID:batchID];
  139. if (index < 0 || index >= queue.count) {
  140. return nil;
  141. }
  142. FSTMutationBatch *batch = queue[(NSUInteger)index];
  143. HARD_ASSERT(batch.batchID == batchID, "If found batch must match");
  144. return [batch isTombstone] ? nil : batch;
  145. }
  146. - (nullable FSTMutationBatch *)nextMutationBatchAfterBatchID:(FSTBatchID)batchID {
  147. NSMutableArray<FSTMutationBatch *> *queue = self.queue;
  148. NSUInteger count = queue.count;
  149. // All batches with batchID <= self.highestAcknowledgedBatchID have been acknowledged so the
  150. // first unacknowledged batch after batchID will have a batchID larger than both of these values.
  151. FSTBatchID nextBatchID = MAX(batchID, self.highestAcknowledgedBatchID) + 1;
  152. // The requested batchID may still be out of range so normalize it to the start of the queue.
  153. NSInteger rawIndex = [self indexOfBatchID:nextBatchID];
  154. NSUInteger index = rawIndex < 0 ? 0 : (NSUInteger)rawIndex;
  155. // Finally return the first non-tombstone batch.
  156. for (; index < count; index++) {
  157. FSTMutationBatch *batch = queue[index];
  158. if (![batch isTombstone]) {
  159. return batch;
  160. }
  161. }
  162. return nil;
  163. }
  164. - (NSArray<FSTMutationBatch *> *)allMutationBatches {
  165. return [self allLiveMutationBatchesBeforeIndex:self.queue.count];
  166. }
  167. - (NSArray<FSTMutationBatch *> *)allMutationBatchesThroughBatchID:(FSTBatchID)batchID {
  168. NSMutableArray<FSTMutationBatch *> *queue = self.queue;
  169. NSUInteger count = queue.count;
  170. NSInteger endIndex = [self indexOfBatchID:batchID];
  171. if (endIndex < 0) {
  172. endIndex = 0;
  173. } else if (endIndex >= count) {
  174. endIndex = count;
  175. } else {
  176. // The endIndex is in the queue so increment to pull everything in the queue including it.
  177. endIndex += 1;
  178. }
  179. return [self allLiveMutationBatchesBeforeIndex:(NSUInteger)endIndex];
  180. }
  181. - (NSArray<FSTMutationBatch *> *)allMutationBatchesAffectingDocumentKey:
  182. (const DocumentKey &)documentKey {
  183. FSTDocumentReference *start = [[FSTDocumentReference alloc] initWithKey:documentKey ID:0];
  184. NSMutableArray<FSTMutationBatch *> *result = [NSMutableArray array];
  185. FSTDocumentReferenceBlock block = ^(FSTDocumentReference *reference, BOOL *stop) {
  186. if (![documentKey isEqualToKey:reference.key]) {
  187. *stop = YES;
  188. return;
  189. }
  190. FSTMutationBatch *batch = [self lookupMutationBatch:reference.ID];
  191. HARD_ASSERT(batch, "Batches in the index must exist in the main table");
  192. [result addObject:batch];
  193. };
  194. [self.batchesByDocumentKey enumerateObjectsFrom:start to:nil usingBlock:block];
  195. return result;
  196. }
  197. - (NSArray<FSTMutationBatch *> *)allMutationBatchesAffectingQuery:(FSTQuery *)query {
  198. // Use the query path as a prefix for testing if a document matches the query.
  199. const ResourcePath &prefix = query.path;
  200. size_t immediateChildrenPathLength = prefix.size() + 1;
  201. // Construct a document reference for actually scanning the index. Unlike the prefix, the document
  202. // key in this reference must have an even number of segments. The empty segment can be used as
  203. // a suffix of the query path because it precedes all other segments in an ordered traversal.
  204. ResourcePath startPath = query.path;
  205. if (!DocumentKey::IsDocumentKey(startPath)) {
  206. startPath = startPath.Append("");
  207. }
  208. FSTDocumentReference *start =
  209. [[FSTDocumentReference alloc] initWithKey:DocumentKey{startPath} ID:0];
  210. // Find unique batchIDs referenced by all documents potentially matching the query.
  211. __block FSTImmutableSortedSet<NSNumber *> *uniqueBatchIDs =
  212. [FSTImmutableSortedSet setWithComparator:NumberComparator];
  213. FSTDocumentReferenceBlock block = ^(FSTDocumentReference *reference, BOOL *stop) {
  214. const ResourcePath &rowKeyPath = reference.key.path();
  215. if (!prefix.IsPrefixOf(rowKeyPath)) {
  216. *stop = YES;
  217. return;
  218. }
  219. // Rows with document keys more than one segment longer than the query path can't be matches.
  220. // For example, a query on 'rooms' can't match the document /rooms/abc/messages/xyx.
  221. // TODO(mcg): we'll need a different scanner when we implement ancestor queries.
  222. if (rowKeyPath.size() != immediateChildrenPathLength) {
  223. return;
  224. }
  225. uniqueBatchIDs = [uniqueBatchIDs setByAddingObject:@(reference.ID)];
  226. };
  227. [self.batchesByDocumentKey enumerateObjectsFrom:start to:nil usingBlock:block];
  228. // Construct an array of matching batches, sorted by batchID to ensure that multiple mutations
  229. // affecting the same document key are applied in order.
  230. NSMutableArray<FSTMutationBatch *> *result = [NSMutableArray array];
  231. [uniqueBatchIDs enumerateObjectsUsingBlock:^(NSNumber *batchID, BOOL *stop) {
  232. FSTMutationBatch *batch = [self lookupMutationBatch:[batchID intValue]];
  233. if (batch) {
  234. [result addObject:batch];
  235. }
  236. }];
  237. return result;
  238. }
  239. - (void)removeMutationBatches:(NSArray<FSTMutationBatch *> *)batches {
  240. NSUInteger batchCount = batches.count;
  241. HARD_ASSERT(batchCount > 0, "Should not remove mutations when none exist.");
  242. FSTBatchID firstBatchID = batches[0].batchID;
  243. NSMutableArray<FSTMutationBatch *> *queue = self.queue;
  244. NSUInteger queueCount = queue.count;
  245. // Find the position of the first batch for removal. This need not be the first entry in the
  246. // queue.
  247. NSUInteger startIndex = [self indexOfExistingBatchID:firstBatchID action:@"removed"];
  248. HARD_ASSERT(queue[startIndex].batchID == firstBatchID, "Removed batches must exist in the queue");
  249. // Check that removed batches are contiguous (while excluding tombstones).
  250. NSUInteger batchIndex = 1;
  251. NSUInteger queueIndex = startIndex + 1;
  252. while (batchIndex < batchCount && queueIndex < queueCount) {
  253. FSTMutationBatch *batch = queue[queueIndex];
  254. if ([batch isTombstone]) {
  255. queueIndex++;
  256. continue;
  257. }
  258. HARD_ASSERT(batch.batchID == batches[batchIndex].batchID,
  259. "Removed batches must be contiguous in the queue");
  260. batchIndex++;
  261. queueIndex++;
  262. }
  263. // Only actually remove batches if removing at the front of the queue. Previously rejected batches
  264. // may have left tombstones in the queue, so expand the removal range to include any tombstones.
  265. if (startIndex == 0) {
  266. for (; queueIndex < queueCount; queueIndex++) {
  267. FSTMutationBatch *batch = queue[queueIndex];
  268. if (![batch isTombstone]) {
  269. break;
  270. }
  271. }
  272. NSUInteger length = queueIndex - startIndex;
  273. [queue removeObjectsInRange:NSMakeRange(startIndex, length)];
  274. } else {
  275. // Mark tombstones
  276. for (NSUInteger i = startIndex; i < queueIndex; i++) {
  277. queue[i] = [queue[i] toTombstone];
  278. }
  279. }
  280. // Remove entries from the index too.
  281. id<FSTGarbageCollector> garbageCollector = self.garbageCollector;
  282. FSTImmutableSortedSet<FSTDocumentReference *> *references = self.batchesByDocumentKey;
  283. for (FSTMutationBatch *batch in batches) {
  284. FSTBatchID batchID = batch.batchID;
  285. for (FSTMutation *mutation in batch.mutations) {
  286. const DocumentKey &key = mutation.key;
  287. [garbageCollector addPotentialGarbageKey:key];
  288. [_persistence.referenceDelegate removeMutationReference:key];
  289. FSTDocumentReference *reference = [[FSTDocumentReference alloc] initWithKey:key ID:batchID];
  290. references = [references setByRemovingObject:reference];
  291. }
  292. }
  293. self.batchesByDocumentKey = references;
  294. }
  295. - (void)performConsistencyCheck {
  296. if (self.queue.count == 0) {
  297. HARD_ASSERT([self.batchesByDocumentKey isEmpty],
  298. "Document leak -- detected dangling mutation references when queue is empty.");
  299. }
  300. }
  301. #pragma mark - FSTGarbageSource implementation
  302. - (BOOL)containsKey:(const DocumentKey &)key {
  303. // Create a reference with a zero ID as the start position to find any document reference with
  304. // this key.
  305. FSTDocumentReference *reference = [[FSTDocumentReference alloc] initWithKey:key ID:0];
  306. NSEnumerator<FSTDocumentReference *> *enumerator =
  307. [self.batchesByDocumentKey objectEnumeratorFrom:reference];
  308. FSTDocumentReference *_Nullable firstReference = [enumerator nextObject];
  309. return firstReference && firstReference.key == reference.key;
  310. }
  311. #pragma mark - Helpers
  312. /**
  313. * A private helper that collects all the mutation batches in the queue up to but not including
  314. * the given endIndex. All tombstones in the queue are excluded.
  315. */
  316. - (NSArray<FSTMutationBatch *> *)allLiveMutationBatchesBeforeIndex:(NSUInteger)endIndex {
  317. NSMutableArray<FSTMutationBatch *> *result = [NSMutableArray arrayWithCapacity:endIndex];
  318. NSUInteger index = 0;
  319. for (FSTMutationBatch *batch in self.queue) {
  320. if (index++ >= endIndex) break;
  321. if (![batch isTombstone]) {
  322. [result addObject:batch];
  323. }
  324. }
  325. return result;
  326. }
  327. /**
  328. * Finds the index of the given batchID in the mutation queue. This operation is O(1).
  329. *
  330. * @return The computed index of the batch with the given batchID, based on the state of the
  331. * queue. Note this index can negative if the requested batchID has already been removed from
  332. * the queue or past the end of the queue if the batchID is larger than the last added batch.
  333. */
  334. - (NSInteger)indexOfBatchID:(FSTBatchID)batchID {
  335. NSMutableArray<FSTMutationBatch *> *queue = self.queue;
  336. NSUInteger count = queue.count;
  337. if (count == 0) {
  338. // As an index this is past the end of the queue
  339. return 0;
  340. }
  341. // Examine the front of the queue to figure out the difference between the batchID and indexes
  342. // in the array. Note that since the queue is ordered by batchID, if the first batch has a larger
  343. // batchID then the requested batchID doesn't exist in the queue.
  344. FSTMutationBatch *firstBatch = queue[0];
  345. FSTBatchID firstBatchID = firstBatch.batchID;
  346. return batchID - firstBatchID;
  347. }
  348. /**
  349. * Finds the index of the given batchID in the mutation queue and asserts that the resulting
  350. * index is within the bounds of the queue.
  351. *
  352. * @param batchID The batchID to search for
  353. * @param action A description of what the caller is doing, phrased in passive form (e.g.
  354. * "acknowledged" in a routine that acknowledges batches).
  355. */
  356. - (NSUInteger)indexOfExistingBatchID:(FSTBatchID)batchID action:(NSString *)action {
  357. NSInteger index = [self indexOfBatchID:batchID];
  358. HARD_ASSERT(index >= 0 && index < self.queue.count, "Batches must exist to be %s", action);
  359. return (NSUInteger)index;
  360. }
  361. @end
  362. NS_ASSUME_NONNULL_END