redis实现访问限制

package redis;

import redis.clients.jedis.HostAndPort;
import redis.clients.jedis.JedisCluster;

import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;

public class RedisLimit {

    private JedisCluster jedisCluster;

    private String key;

    /**
     * 限制次数
     */
    private int limit;

    /**
     * 限制时间 毫秒
     */
    private long expire;

    private static final String LUA_SIMPLE_CHECK = " local size = redis.call('get',KEYS[1]) " +
            " if size and tonumber(size) >= tonumber(ARGV[1]) then " +
            "    return 1 " +
            " end " +
            " local incr = redis.call('incr',KEYS[1]) " +
            " if incr == 1 then " +
            "    redis.call('pexpire',KEYS[1],ARGV[2]) " +
            " end " +
            " return 0 ";

    private static String luaSimpleCheckSha;

    private static final String LUA_PRECISE_CHECK = " local size = redis.call('llen',KEYS[1]) " +
            " local timeNow = tonumber(ARGV[3])" +
            " if size >= tonumber(ARGV[1]) then " +
            "    local tiemOld = redis.call('lpop',KEYS[1]) " +
            "    redis.call('rpush',KEYS[1],timeNow) " +
            "    if timeNow - tonumber(tiemOld) < tonumber(ARGV[2]) then" +
            "       return 1 " +
            "    else " +
            "       return 0" +
            "    end " +
            " end " +
            " redis.call('rpush',KEYS[1],timeNow)" +
            " return 0";

    private static String luaPreciseCheckSha;


    public RedisLimit(JedisCluster jedisCluster, String key, int limit, int expire) {
        this.jedisCluster = jedisCluster;
        this.key = key;
        this.limit = limit;
        this.expire = expire;
    }

    /**
     * 在给定的时间内限制访问多少次。如果超过了则返回true
     * 简单判断不够准确 优点存储数据量低
     * 这些操作不是原子性的
     */
    public boolean simpleCheck() {
        String sizeStr = jedisCluster.get(key);
        if (sizeStr != null && Long.valueOf(sizeStr) >= limit) {
            return true;
        }
        Long incr = jedisCluster.incr(key);
        if (incr == 1) {
            jedisCluster.pexpire(key, expire);
        }
        return false;
    }

    /**
     * 在给定的时间内限制访问多少次。如果超过了则返回true
     * 简单判断不够准确 优点存储数据量低
     * 通过lua实现原子性操作
     */
    public boolean simpelCheckByLua() {
        if (luaSimpleCheckSha == null) {
            luaSimpleCheckSha = jedisCluster.scriptLoad(LUA_SIMPLE_CHECK, "luaSimpleCheck");
        }
        Long eval;
        try {
            eval = (Long) jedisCluster.evalsha(luaSimpleCheckSha, Arrays.asList(key),
                    Arrays.asList(String.valueOf(limit), String.valueOf(expire)));
        } catch (Exception e) {
            //TODO 打印日志
            e.printStackTrace();
            eval = (Long) jedisCluster.eval(LUA_SIMPLE_CHECK, Arrays.asList(key),
                    Arrays.asList(String.valueOf(limit), String.valueOf(expire)));
        }

        return eval == 1;
    }

    /**
     * 精确判断 缺点是存储数据量多 依赖服务器时间戳
     */
    public boolean preciseCheck() {
        Long card = jedisCluster.llen(key);
        if (card >= limit) {
            //移除最早访问时间
            String timeOld = jedisCluster.lpop(key);
            //当前访问时间
            long timeNow = System.currentTimeMillis();
            jedisCluster.rpush(key, String.valueOf(timeNow));
            if (timeNow - Long.valueOf(timeOld) < expire) {
                return true;
            } else {
                return false;
            }
        }
        long timeNow = System.currentTimeMillis();
        jedisCluster.rpush(key, String.valueOf(timeNow));
        return false;
    }

    public boolean preciseCheckByLua() {
        if (luaPreciseCheckSha == null) {
            luaPreciseCheckSha = jedisCluster.scriptLoad(LUA_PRECISE_CHECK, "luaPreciseCheck");
        }
        Long eval;
        try {
            eval = (Long) jedisCluster.evalsha(luaPreciseCheckSha, Arrays.asList(key),
                    Arrays.asList(String.valueOf(limit), String.valueOf(expire), String.valueOf(System.currentTimeMillis())));

        } catch (Exception e) {
            //TODO 打印日志
            e.printStackTrace();
            eval = (Long) jedisCluster.eval(LUA_PRECISE_CHECK, Arrays.asList(key),
                    Arrays.asList(String.valueOf(limit), String.valueOf(expire), String.valueOf(System.currentTimeMillis())));
        }
        return eval == 1;

    }

    public static void main(String[] args) {
        HostAndPort hostAndPort1 = new HostAndPort("ip", 20621);
        HostAndPort hostAndPort2 = new HostAndPort("ip", 20622);
        HostAndPort hostAndPort3 = new HostAndPort("ip", 20622);
        Set<HostAndPort> set = new HashSet<>();
        set.add(hostAndPort1);
        set.add(hostAndPort2);
        set.add(hostAndPort3);
        JedisCluster jedisCluster = new JedisCluster(set);

        RedisLimit redisLimit = new RedisLimit(jedisCluster, "localhostzhpincr", 10, 100);
        for (int i = 0; i < 50; i++) {
            if (redisLimit.simpelCheckByLua()) {
                System.out.println("超过限制");
            } else {
                System.out.println("可以执行");
            }
        }
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值