Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
py_free-物联智能
rt-thread
提交
1bd8d0f7
R
rt-thread
项目概览
py_free-物联智能
/
rt-thread
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
rt-thread
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
1bd8d0f7
编写于
6月 02, 2016
作者:
armink_ztl
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[finsh] Beautify the list_thread command.
上级
7db31229
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
42 addition
and
6 deletion
+42
-6
components/finsh/cmd.c
components/finsh/cmd.c
+42
-6
未找到文件。
components/finsh/cmd.c
浏览文件 @
1bd8d0f7
...
...
@@ -43,6 +43,7 @@
* 2012-04-29 goprife improve the command line auto-complete feature.
* 2012-06-02 lgnq add list_memheap
* 2012-10-22 Bernard add MS VC++ patch.
* 2016-06-02 armink beautify the list_thread command
*/
#include <rtthread.h>
...
...
@@ -85,14 +86,48 @@ static long _list_thread(struct rt_list_node *list)
{
struct
rt_thread
*
thread
;
struct
rt_list_node
*
node
;
rt_uint8_t
*
ptr
;
rt_uint8_t
*
ptr
,
cur_max_name_len
=
0
,
cur_thread_name_len
;
char
thread_header
[
RT_NAME_MAX
],
thread_split
[
RT_NAME_MAX
];
const
char
*
thread_str
=
"thread"
;
rt_size_t
i
,
thread_str_len
=
rt_strlen
(
thread_str
),
thread_str_index
;
rt_kprintf
(
" thread pri status sp stack size max used left tick error
\n
"
);
rt_kprintf
(
"-------- ---- ------- ---------- ---------- ---------- ---------- ---
\n
"
);
/* calculate the maximum thread name length */
for
(
node
=
list
->
next
;
node
!=
list
;
node
=
node
->
next
)
{
thread
=
rt_list_entry
(
node
,
struct
rt_thread
,
list
);
cur_thread_name_len
=
rt_strlen
(
thread
->
name
);
if
(
cur_max_name_len
<
cur_thread_name_len
)
{
cur_max_name_len
=
cur_thread_name_len
;
}
}
if
(
cur_max_name_len
<
thread_str_len
)
{
cur_max_name_len
=
thread_str_len
;
}
/* calculate the "thread" string in header index */
thread_str_index
=
(
cur_max_name_len
-
thread_str_len
)
/
2
;
for
(
i
=
0
;
i
<
cur_max_name_len
;
i
++
)
{
thread_split
[
i
]
=
'-'
;
if
(
thread_str_len
<
cur_max_name_len
)
{
if
(
i
<
thread_str_index
)
{
thread_header
[
i
]
=
' '
;
thread_header
[
cur_max_name_len
-
i
-
1
]
=
' '
;
}
else
if
(
i
<
thread_str_index
+
thread_str_len
)
{
thread_header
[
i
]
=
thread_str
[
i
-
thread_str_index
];
}
else
{
thread_header
[
i
]
=
' '
;
}
}
}
thread_header
[
cur_max_name_len
]
=
'\0'
;
thread_split
[
cur_max_name_len
]
=
'\0'
;
rt_kprintf
(
"%s pri status sp stack size max used left tick error
\n
"
,
thread_header
);
rt_kprintf
(
"%s ---- ------- ---------- ---------- --- ---------- ---
\n
"
,
thread_split
);
for
(
node
=
list
->
next
;
node
!=
list
;
node
=
node
->
next
)
{
thread
=
rt_list_entry
(
node
,
struct
rt_thread
,
list
);
rt_kprintf
(
"%-
8.*s 0x%02x"
,
RT_NAME_MAX
,
thread
->
name
,
thread
->
current_priority
);
rt_kprintf
(
"%-
*.*s %02d "
,
cur_max_name_len
,
cur_max_name_len
,
thread
->
name
,
thread
->
current_priority
);
if
(
thread
->
stat
==
RT_THREAD_READY
)
rt_kprintf
(
" ready "
);
else
if
(
thread
->
stat
==
RT_THREAD_SUSPEND
)
rt_kprintf
(
" suspend"
);
...
...
@@ -102,10 +137,11 @@ static long _list_thread(struct rt_list_node *list)
ptr
=
(
rt_uint8_t
*
)
thread
->
stack_addr
;
while
(
*
ptr
==
'#'
)
ptr
++
;
rt_kprintf
(
" 0x%08x 0x%08x
0x%08x
0x%08x %03d
\n
"
,
rt_kprintf
(
" 0x%08x 0x%08x
%02d%%
0x%08x %03d
\n
"
,
thread
->
stack_size
+
((
rt_uint32_t
)
thread
->
stack_addr
-
(
rt_uint32_t
)
thread
->
sp
),
thread
->
stack_size
,
thread
->
stack_size
-
((
rt_uint32_t
)
ptr
-
(
rt_uint32_t
)
thread
->
stack_addr
),
(
thread
->
stack_size
-
((
rt_uint32_t
)
ptr
-
(
rt_uint32_t
)
thread
->
stack_addr
))
*
100
/
thread
->
stack_size
,
thread
->
remaining_tick
,
thread
->
error
);
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录