Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Turbo码先生
redis
提交
4fdd7a05
R
redis
项目概览
Turbo码先生
/
redis
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
redis
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
4fdd7a05
编写于
3月 20, 2014
作者:
J
Jan-Erik Rediger
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fixed a few typos.
上级
a9836992
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
3 addition
and
3 deletion
+3
-3
src/redis.c
src/redis.c
+3
-3
未找到文件。
src/redis.c
浏览文件 @
4fdd7a05
...
...
@@ -2807,12 +2807,12 @@ void monitorCommand(redisClient *c) {
* LRU approximation algorithm
*
* Redis uses an approximation of the LRU algorithm that runs in constant
* memory. Every time there is a key to expire, we sample
a
N keys (with
* memory. Every time there is a key to expire, we sample N keys (with
* N very small, usually in around 5) to populate a pool of best keys to
* evict of M keys (the pool size is defined by REDIS_EVICTION_POOL_SIZE).
*
* The N keys sampled are added in the pool of good keys to expire (the one
* with an old access time) if they are better th
e
n one of the current keys
* with an old access time) if they are better th
a
n one of the current keys
* in the pool.
*
* After the pool is populated, the best key we have in the pool is expired.
...
...
@@ -2890,7 +2890,7 @@ void evictionPoolPopulate(dict *sampledict, dict *keydict, struct evictionPoolEn
pool
[
k
].
key
&&
pool
[
k
].
idle
<
idle
)
k
++
;
if
(
k
==
0
&&
pool
[
REDIS_EVICTION_POOL_SIZE
-
1
].
key
!=
NULL
)
{
/* Can't insert i
s
the element is < the worst element we have
/* Can't insert i
f
the element is < the worst element we have
* and there are no empty buckets. */
continue
;
}
else
if
(
k
<
REDIS_EVICTION_POOL_SIZE
&&
pool
[
k
].
key
==
NULL
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录