Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
xindoo
redis
提交
fb068dc9
R
redis
项目概览
xindoo
/
redis
通知
2
Star
2
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,发现更多精彩内容 >>
提交
fb068dc9
编写于
3月 16, 2012
作者:
A
antirez
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Memory test function now less boring thanks to screen-wide progress bar.
上级
54e0fa1c
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
48 addition
and
5 deletion
+48
-5
src/memtest.c
src/memtest.c
+48
-5
未找到文件。
src/memtest.c
浏览文件 @
fb068dc9
...
...
@@ -4,6 +4,8 @@
#include <assert.h>
#include <limits.h>
#include <errno.h>
#include <termios.h>
#include <sys/ioctl.h>
#if (ULONG_MAX == 4294967295UL)
#define MEMTEST_32BIT
...
...
@@ -13,6 +15,37 @@
#error "ULONG_MAX value not supported."
#endif
static
struct
winsize
ws
;
size_t
progress_printed
;
/* Printed chars in screen-wide progress bar. */
size_t
progress_full
;
/* How many chars to write to fill the progress bar. */
void
memtest_progress_start
(
char
*
title
,
int
pass
)
{
int
j
;
printf
(
"
\x1b
[H
\x1b
[2J"
);
/* Cursor home, clear screen. */
/* Fill with dots. */
for
(
j
=
0
;
j
<
ws
.
ws_col
*
ws
.
ws_row
;
j
++
)
printf
(
"."
);
printf
(
"
\x1b
[H
\x1b
[2K"
);
/* Cursor home, clear current line. */
printf
(
"%s [%d]
\n
"
,
title
,
pass
);
/* Print title. */
progress_printed
=
0
;
progress_full
=
ws
.
ws_col
*
(
ws
.
ws_row
-
1
);
fflush
(
stdout
);
}
void
memtest_progress_end
(
void
)
{
printf
(
"
\x1b
[H
\x1b
[2J"
);
/* Cursor home, clear screen. */
}
void
memtest_progress_step
(
size_t
curr
,
size_t
size
,
char
c
)
{
size_t
chars
=
(
curr
*
progress_full
)
/
size
,
j
;
for
(
j
=
0
;
j
<
chars
-
progress_printed
;
j
++
)
{
printf
(
"%c"
,
c
);
progress_printed
++
;
}
fflush
(
stdout
);
}
/* Fill words stepping a single page at every write, so we continue to
* touch all the pages in the smallest amount of time reducing the
* effectiveness of caches, and making it hard for the OS to transfer
...
...
@@ -39,6 +72,8 @@ void memtest_fill(unsigned long *l, size_t bytes) {
#endif
l1
+=
step
;
l2
+=
step
;
if
((
w
&
0xffff
)
==
0
)
memtest_progress_step
(
w
+
iwords
*
off
,
words
,
'+'
);
}
}
}
...
...
@@ -58,13 +93,14 @@ void memtest_compare(unsigned long *l, size_t bytes) {
}
l1
++
;
l2
++
;
if
((
w
&
0xffff
)
==
0
)
memtest_progress_step
(
w
,
words
,
'='
);
}
}
void
memtest_test
(
size_t
megabytes
,
int
passes
)
{
size_t
bytes
=
megabytes
*
1024
*
1024
;
unsigned
long
*
m
=
malloc
(
bytes
);
int
pass
=
0
;
int
pass
=
0
,
j
;
if
(
m
==
NULL
)
{
fprintf
(
stderr
,
"Unable to allocate %zu megabytes: %s"
,
...
...
@@ -73,15 +109,22 @@ void memtest_test(size_t megabytes, int passes) {
}
while
(
pass
!=
passes
)
{
pass
++
;
printf
(
"PASS %d... "
,
pass
);
fflush
(
stdout
);
memtest_progress_start
(
"Random fill"
,
pass
);
memtest_fill
(
m
,
bytes
);
memtest_compare
(
m
,
bytes
);
printf
(
"ok
\n
"
);
memtest_progress_end
();
for
(
j
=
0
;
j
<
4
;
j
++
)
{
memtest_progress_start
(
"Compare"
,
pass
);
memtest_compare
(
m
,
bytes
);
memtest_progress_end
();
}
}
}
void
memtest
(
size_t
megabytes
,
int
passes
)
{
if
(
ioctl
(
1
,
TIOCGWINSZ
,
&
ws
)
==
-
1
)
{
ws
.
ws_col
=
80
;
ws
.
ws_row
=
20
;
}
memtest_test
(
megabytes
,
passes
);
printf
(
"
\n
Your memory passed this test.
\n
"
);
printf
(
"Please if you are stil in doubt use the following two tools:
\n
"
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录