atomic_cache 0.2.4.rc1 → 0.2.5.rc1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 372963cc5a7e83a92d2dd2ca4336cac86f9664efc0a8cabdffcf7dfb9ba86b17
-  data.tar.gz: 2db0bb7c54a07280c70349ce6527836d80898e671c0b49eb427f86340094ed6f
+  metadata.gz: 5c6e0bf96718fb99b6047009b67c12f3fb4da0b36fd18ba8eb7aded71b744cb2
+  data.tar.gz: 8443307bb59ff3e3ca393cb6401f6c30974ec97bc3729024848be74504c5abda
 SHA512:
-  metadata.gz: 32a9f8189dcdbb5793dc785d0521fd39c42743d017e8763d0ac20cdf030fea10bbe28d7365cdaf2386c3b0cc121db954b73f053f691d8450ca170fdd9eae9f19
-  data.tar.gz: f17e1bd01c14c07d43be161edb08f0601e85c526b4c2354ae2bd06e26ae5441f7437900e5af6afe8d83a618bbe434a231a77810201865ee6eb237a06239911fc
+  metadata.gz: f438b868a3b60d2d64be72fa314f8cb4ca2a04d9972286d623393bf9754b488577f150d4726c26ee236a0a0cbaae9444fc892fc808b8cda3b23052e2adb8fb8d
+  data.tar.gz: d84517bed76804507f0dc395205eaad4e114e0dfda3023b33f6a1e1191e396d1643b7fb501ebd66e677d8d682ef822b5fa5329660ee5c0c2947d3adb4009c99c

data/lib/atomic_cache/atomic_cache_client.rb

@@ -27,7 +27,6 @@ module AtomicCache
       raise ArgumentError.new("`storage` required but none given") unless @storage.present?
     end
 
-
     # Attempts to fetch the given keyspace, using an optional block to generate
     # a new value when the cache is expired
     #
@@ -60,13 +59,13 @@ module AtomicCache
 
       # quick check back to see if the other process has finished
       # or fall back to the last known value
-      value = quick_retry(keyspace, options, tags) || last_known_value(keyspace, options, tags)
+      value = quick_retry(key, options, tags) || last_known_value(keyspace, options, tags)
       return value if value.present?
 
       # wait for the other process if a last known value isn't there
       if key.present?
         return time('wait.run', tags: tags) do
-          wait_for_new_value(key, options, tags)
+          wait_for_new_value(keyspace, options, tags)
         end
       end
 
@@ -110,10 +109,8 @@ module AtomicCache
       nil
     end
 
-    def quick_retry(keyspace, options, tags)
-      key = @timestamp_manager.current_key(keyspace)
+    def quick_retry(key, options, tags)
       duration = option(:quick_retry_ms, options, DEFAULT_quick_retry_ms)
-
       if duration.present? and key.present?
         sleep(duration.to_f / 1000)
         value = @storage.read(key, options)
@@ -151,7 +148,7 @@ module AtomicCache
       nil
     end
 
-    def wait_for_new_value(key, options, tags)
+    def wait_for_new_value(keyspace, options, tags)
       max_retries = option(:max_retries, options, DEFAULT_MAX_RETRIES)
       max_retries.times do |attempt|
         metrics_tags = tags.clone.push("attempt:#{attempt}")
@@ -162,6 +159,8 @@ module AtomicCache
         backoff_duration_ms = option(:backoff_duration_ms, options, backoff_duration_ms)
         sleep((backoff_duration_ms.to_f / 1000) * attempt)
 
+        # re-fetch the key each time, to make sure we're actually getting the latest key with the correct LMT
+        key = @timestamp_manager.current_key(keyspace)
         value = @storage.read(key, options)
         if !value.nil?
           metrics(:increment, 'wait.present', tags: metrics_tags)
@@ -170,7 +169,7 @@ module AtomicCache
       end
 
       metrics(:increment, 'wait.give-up')
-      log(:warn, "Giving up fetching cache key `#{key}`. Exceeded max retries (#{max_retries}).")
+      log(:warn, "Giving up waiting. Exceeded max retries (#{max_retries}).")
       nil
     end
 

data/lib/atomic_cache/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module AtomicCache
-  VERSION = "0.2.4.rc1"
+  VERSION = "0.2.5.rc1"
 end

data/spec/atomic_cache/integration/waiting_spec.rb

@@ -0,0 +1,102 @@
+# frozen_string_literal: true
+
+require 'spec_helper'
+
+describe 'Integration' do
+  let(:key_storage) { AtomicCache::Storage::SharedMemory.new }
+  let(:cache_storage) { AtomicCache::Storage::SharedMemory.new }
+  let(:keyspace) { AtomicCache::Keyspace.new(namespace: 'int.waiting') }
+  let(:timestamp_manager) { AtomicCache::LastModTimeKeyManager.new(keyspace: keyspace, storage: key_storage) }
+
+  let(:generating_client) { AtomicCache::AtomicCacheClient.new(storage: cache_storage, timestamp_manager: timestamp_manager) }
+  let(:waiting_client) { AtomicCache::AtomicCacheClient.new(storage: cache_storage, timestamp_manager: timestamp_manager) }
+
+  it 'correctly waits for a key when no last know value is available' do
+    generating_thread = ClientThread.new(generating_client, keyspace)
+    generating_thread.start
+    waiting_thread = ClientThread.new(waiting_client, keyspace)
+    waiting_thread.start
+
+    generating_thread.generate
+    sleep 0.05
+    waiting_thread.fetch
+    sleep 0.05
+    generating_thread.complete
+    sleep 0.05
+
+    generating_thread.terminate
+    waiting_thread.terminate
+
+    expect(generating_thread.result).to eq([1, 2, 3])
+    expect(waiting_thread.result).to eq([1, 2, 3])
+  end
+end
+
+
+# Avert your eyes:
+# this class allows atomic client interaction to happen asynchronously so that
+# the waiting behavior of the client can be tested simultaneous to controlling how
+# long the 'generate' behavior takes
+#
+# It works by accepting an incoming 'message' which it places onto one of two queues
+class ClientThread
+  attr_reader :result
+
+  def initialize(client, keyspace)
+    @keyspace = keyspace
+    @client = client
+    @msg_queue = Queue.new
+    @generate_queue = Queue.new
+    @result = nil
+  end
+
+  def start
+    @thread = Thread.new(&method(:run))
+  end
+
+  def fetch
+    @msg_queue << :fetch
+  end
+
+  def generate
+    @msg_queue << :generate
+  end
+
+  def complete
+    @generate_queue << :complete
+  end
+
+  def terminate
+    @msg_queue << :terminate
+  end
+
+  private
+
+  def run
+    loop do
+      msg = @msg_queue.pop
+      sleep 0.001; next unless msg
+
+      case msg
+      when :terminate
+        Thread.stop
+      when :generate
+        do_generate
+      when :fetch
+        @result = @client.fetch(@keyspace)
+      end
+    end
+  end
+
+  def do_generate
+    @client.fetch(@keyspace) do
+      loop do
+        msg = @generate_queue.pop
+        sleep 0.001; next unless msg
+        break if msg == :complete
+      end
+      @result = [1, 2, 3] # generated value
+      @result
+    end
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: atomic_cache
 version: !ruby/object:Gem::Version
-  version: 0.2.4.rc1
+  version: 0.2.5.rc1
 platform: ruby
 authors:
 - Ibotta Developers
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2021-06-24 00:00:00.000000000 Z
+date: 2021-06-28 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -171,7 +171,8 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '0.1'
-description: desc
+description: A gem which prevents the thundering herd problem through a distributed
+  lock
 email: osscompliance@ibotta.com
 executables: []
 extensions: []
@@ -200,6 +201,7 @@ files:
 - spec/atomic_cache/atomic_cache_client_spec.rb
 - spec/atomic_cache/concerns/global_lmt_cache_concern_spec.rb
 - spec/atomic_cache/default_config_spec.rb
+- spec/atomic_cache/integration/waiting_spec.rb
 - spec/atomic_cache/key/keyspace_spec.rb
 - spec/atomic_cache/key/last_mod_time_key_manager_spec.rb
 - spec/atomic_cache/storage/dalli_spec.rb
@@ -229,5 +231,9 @@ requirements: []
 rubygems_version: 3.0.8
 signing_key: 
 specification_version: 4
-summary: summary
+summary: In a nutshell:* The key of every cached value includes a timestamp* Once
+  a cache key is written to, it is never written over* When a newer version of a cached
+  value is available, it is written to a new key* When a new value is being generated
+  for a new key only 1 process is allowed to do so at a time* While the new value
+  is being generated, other processes read one key older than most recent
 test_files: []