FSTMemoryMutationQueue.mm 17 KB

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