FSTMemoryMutationQueue.mm 17 KB

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