-
Notifications
You must be signed in to change notification settings - Fork 93
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Introduced geLimitWhenIncrementedReactive to Redis implementation
- Loading branch information
Showing
8 changed files
with
148 additions
and
18 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,6 +1,6 @@ | ||
#Thu Jul 27 20:04:44 AEST 2017 | ||
#Thu Jul 27 20:27:54 AEST 2017 | ||
distributionBase=GRADLE_USER_HOME | ||
distributionPath=wrapper/dists | ||
zipStoreBase=GRADLE_USER_HOME | ||
zipStorePath=wrapper/dists | ||
distributionUrl=https\://services.gradle.org/distributions/gradle-4.0.2-bin.zip | ||
distributionUrl=https\://services.gradle.org/distributions/gradle-4.0.2-all.zip |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
83 changes: 83 additions & 0 deletions
83
ratelimitj-redis/out/production/resources/sliding-window-ratelimit.lua
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,83 @@ | ||
-- Credit: http://www.dr-josiah.com/2014/11/introduction-to-rate-limiting-with_26.html | ||
|
||
local limits = cjson.decode(ARGV[1]) | ||
local now = tonumber(ARGV[2]) | ||
local weight = tonumber(ARGV[3] or '1') | ||
local strictly_greater = tonumber(ARGV[4] or '1') == 1 | ||
local longest_duration = limits[1][1] or 0 | ||
local saved_keys = {} | ||
local ge_limit = '0' | ||
|
||
-- handle cleanup and limit checks | ||
for i, limit in ipairs(limits) do | ||
local duration = limit[1] | ||
longest_duration = math.max(longest_duration, duration) | ||
local precision = limit[3] or duration | ||
precision = math.min(precision, duration) | ||
local blocks = math.ceil(duration / precision) | ||
local saved = {} | ||
table.insert(saved_keys, saved) | ||
saved.block_id = math.floor(now / precision) | ||
saved.trim_before = saved.block_id - blocks + 1 | ||
saved.count_key = duration .. ':' .. precision .. ':' | ||
saved.ts_key = saved.count_key .. 'o' | ||
|
||
for j, key in ipairs(KEYS) do | ||
local old_ts = redis.call('HGET', key, saved.ts_key) | ||
old_ts = old_ts and tonumber(old_ts) or saved.trim_before | ||
if old_ts > now then | ||
-- don't write in the past | ||
return '1' | ||
end | ||
-- discover what needs to be cleaned up | ||
local decr = 0 | ||
local dele = {} | ||
local trim = math.min(saved.trim_before, old_ts + blocks) | ||
for old_block = old_ts, trim - 1 do | ||
local bkey = saved.count_key .. old_block | ||
local bcount = redis.call('HGET', key, bkey) | ||
if bcount then | ||
decr = decr + tonumber(bcount) | ||
table.insert(dele, bkey) | ||
end | ||
end | ||
-- handle cleanup | ||
local cur | ||
if #dele > 0 then | ||
redis.call('HDEL', key, unpack(dele)) | ||
-- Guard against "-0" => "ERR value is not an integer or out of range" | ||
if decr ~= 0 then | ||
cur = redis.call('HINCRBY', key, saved.count_key, -decr) | ||
end | ||
else | ||
cur = redis.call('HGET', key, saved.count_key) | ||
end | ||
-- check our limits | ||
local count = tonumber(cur or '0') + weight | ||
if count > limit[2] then | ||
return '1' -- over limit, don't record request | ||
elseif count == limit[2] and not strictly_greater then | ||
ge_limit = '1' -- at limit, do record request | ||
end | ||
end | ||
end | ||
|
||
-- there is enough resources, update the counts IFF needed | ||
for i, limit in ipairs(limits) do | ||
local saved = saved_keys[i] | ||
for j, key in ipairs(KEYS) do | ||
-- update the current timestamp, count, and bucket count | ||
redis.call('HSET', key, saved.ts_key, saved.trim_before) | ||
redis.call('HINCRBY', key, saved.count_key, weight) | ||
redis.call('HINCRBY', key, saved.count_key .. saved.block_id, weight) | ||
end | ||
end | ||
|
||
-- We calculated the longest-duration limit so we can EXPIRE | ||
-- the whole HASH for quick and easy idle-time cleanup :) | ||
if longest_duration > 0 then | ||
for _, key in ipairs(KEYS) do | ||
redis.call('EXPIRE', key, longest_duration) | ||
end | ||
end | ||
return ge_limit |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,17 @@ | ||
<configuration> | ||
|
||
<appender name="STDOUT" class="ch.qos.logback.core.ConsoleAppender"> | ||
<encoder> | ||
<pattern>%d{HH:mm:ss.SSS} [%thread] %-5level %logger{36} - %msg%n</pattern> | ||
</encoder> | ||
</appender> | ||
|
||
<logger name="es.moki" level="debug" | ||
additivity="false"> | ||
<appender-ref ref="STDOUT"/> | ||
</logger> | ||
|
||
<root level="warn"> | ||
<appender-ref ref="STDOUT"/> | ||
</root> | ||
</configuration> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters