Method upsertDocToCache

db/revision_cache_lru.go:355–393

(ctx context.Context, cvKey IDandCV, legacyKey IDAndRev, docRev DocumentRevision, collectionID uint32)

}

func (rc *LRURevisionCache) upsertDocToCache(ctx context.Context, cvKey IDandCV, legacyKey IDAndRev, docRev DocumentRevision, collectionID uint32) (int64, *revCacheValue) {
	rc.lock.Lock()
	defer rc.lock.Unlock()

	newItem := true
	// lookup for element in hlv lookup map, if not found for some reason try rev lookup map
	var existingElem *list.Element
	var found bool
	existingElem, found = rc.hlvCache[cvKey]
	if !found {
		existingElem, found = rc.cache[legacyKey]
	}
	if found {
		revItem := existingElem.Value.(*revCacheValue)
		// decrement item bytes by the removed item
		rc._decrRevCacheMemoryUsage(ctx, -revItem.getItemBytes())
		rc.lruList.Remove(existingElem)
		newItem = false
	}

	// Add new value and overwrite existing cache key, pushing to front to maintain order
	// also ensure we add to rev id lookup map too
	value := &revCacheValue{id: docRev.DocID, cv: *docRev.CV, collectionID: collectionID}
	elem := rc.lruList.PushFront(value)
	rc.hlvCache[cvKey] = elem
	rc.cache[legacyKey] = elem

	// only increment if we are inserting new item to cache
	if newItem {
		rc.cacheNumItems.Add(1)
	}

	// Purge oldest item if over number capacity
	numItemsRemoved, numBytesEvicted := rc._numberCapacityEviction()
	if numBytesEvicted > 0 {
		rc._decrRevCacheMemoryUsage(ctx, -numBytesEvicted)
	}
	return numItemsRemoved, value
}

func (rc *LRURevisionCache) getValue(ctx context.Context, docID, revID string, collectionID uint32, create bool) (value *revCacheValue) {
	if docID == "" || revID == "" {