Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
hanoi2005
redis
提交
335d16bc
R
redis
项目概览
hanoi2005
/
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,发现更多精彩内容 >>
提交
335d16bc
编写于
5月 21, 2010
作者:
P
Pieter Noordhuis
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
change iteration code to avoid allocating a new sds for each traversed entry
上级
08253bf4
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
19 addition
and
13 deletion
+19
-13
ziplist.c
ziplist.c
+19
-13
未找到文件。
ziplist.c
浏览文件 @
335d16bc
...
...
@@ -120,12 +120,11 @@ unsigned char *ziplistIndex(unsigned char *zl, unsigned int index) {
/* Store entry at current position in sds *value and return pointer
* to the next entry. */
unsigned
char
*
ziplistNext
(
unsigned
char
*
p
,
sds
*
value
)
{
unsigned
char
*
ziplistNext
(
unsigned
char
*
p
,
unsigned
char
**
entry
,
unsigned
int
*
elen
)
{
if
(
*
p
==
ZIP_END
)
return
NULL
;
if
(
value
)
{
unsigned
int
len
;
len
=
zipDecodeLength
(
p
);
*
value
=
sdsnewlen
(
p
+
zipEncodeLength
(
NULL
,
len
),
len
);
if
(
entry
)
{
*
elen
=
zipDecodeLength
(
p
);
*
entry
=
p
+
ZIP_LEN_BYTES
(
*
elen
);
}
p
+=
zipRawEntryLength
(
p
);
return
p
;
...
...
@@ -159,7 +158,8 @@ unsigned char *createList() {
}
int
main
(
int
argc
,
char
**
argv
)
{
unsigned
char
*
zl
,
*
p
;
unsigned
char
*
zl
,
*
p
,
*
entry
;
unsigned
int
elen
;
sds
s
;
zl
=
createList
();
...
...
@@ -177,8 +177,10 @@ int main(int argc, char **argv) {
{
zl
=
createList
();
p
=
ziplistIndex
(
zl
,
0
);
while
((
p
=
ziplistNext
(
p
,
&
s
))
!=
NULL
)
{
printf
(
"Entry: %s (length %ld)
\n
"
,
s
,
sdslen
(
s
));
while
((
p
=
ziplistNext
(
p
,
&
entry
,
&
elen
))
!=
NULL
)
{
printf
(
"Entry: "
);
fwrite
(
entry
,
elen
,
1
,
stdout
);
printf
(
" (length %d)
\n
"
,
elen
);
}
printf
(
"
\n
"
);
}
...
...
@@ -187,8 +189,10 @@ int main(int argc, char **argv) {
{
zl
=
createList
();
p
=
ziplistIndex
(
zl
,
1
);
while
((
p
=
ziplistNext
(
p
,
&
s
))
!=
NULL
)
{
printf
(
"Entry: %s (length %ld)
\n
"
,
s
,
sdslen
(
s
));
while
((
p
=
ziplistNext
(
p
,
&
entry
,
&
elen
))
!=
NULL
)
{
printf
(
"Entry: "
);
fwrite
(
entry
,
elen
,
1
,
stdout
);
printf
(
" (length %d)
\n
"
,
elen
);
}
printf
(
"
\n
"
);
}
...
...
@@ -197,8 +201,10 @@ int main(int argc, char **argv) {
{
zl
=
createList
();
p
=
ziplistIndex
(
zl
,
2
);
while
((
p
=
ziplistNext
(
p
,
&
s
))
!=
NULL
)
{
printf
(
"Entry: %s (length %ld)
\n
"
,
s
,
sdslen
(
s
));
while
((
p
=
ziplistNext
(
p
,
&
entry
,
&
elen
))
!=
NULL
)
{
printf
(
"Entry: "
);
fwrite
(
entry
,
elen
,
1
,
stdout
);
printf
(
" (length %d)
\n
"
,
elen
);
}
printf
(
"
\n
"
);
}
...
...
@@ -207,7 +213,7 @@ int main(int argc, char **argv) {
{
zl
=
createList
();
p
=
ziplistIndex
(
zl
,
3
);
if
(
ziplistNext
(
p
,
&
s
)
==
NULL
)
{
if
(
ziplistNext
(
p
,
&
entry
,
&
elen
)
==
NULL
)
{
printf
(
"No entry
\n
"
);
}
else
{
printf
(
"ERROR
\n
"
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录