Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
逆着光、寻觅
rt-thread
提交
76474b3e
R
rt-thread
项目概览
逆着光、寻觅
/
rt-thread
与 Fork 源项目一致
Fork自
RT-Thread / rt-thread
通知
1
Star
1
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,发现更多精彩内容 >>
提交
76474b3e
编写于
3月 13, 2018
作者:
armink_ztl
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[Components][Finsh] Fix list object name align issue.
上级
0b5ac759
变更
1
显示空白变更内容
内联
并排
Showing
1 changed file
with
30 addition
and
31 deletion
+30
-31
components/finsh/cmd.c
components/finsh/cmd.c
+30
-31
未找到文件。
components/finsh/cmd.c
浏览文件 @
76474b3e
...
...
@@ -67,11 +67,11 @@ long version(void)
FINSH_FUNCTION_EXPORT
(
version
,
show
RT
-
Thread
version
information
);
MSH_CMD_EXPORT
(
version
,
show
RT
-
Thread
version
information
);
static
int
object_name_maxlen
(
struct
rt_list_node
*
list
)
static
int
object_name_maxlen
(
const
char
*
type_name
,
struct
rt_list_node
*
list
)
{
struct
rt_list_node
*
node
;
struct
rt_object
*
object
=
NULL
;
int
max_length
=
0
,
length
;
int
max_length
=
rt_strlen
(
type_name
)
,
length
;
rt_enter_critical
();
for
(
node
=
list
->
next
;
node
!=
list
;
node
=
node
->
next
)
...
...
@@ -99,10 +99,11 @@ static long _list_thread(struct rt_list_node *list)
rt_uint8_t
*
ptr
;
struct
rt_thread
*
thread
;
struct
rt_list_node
*
node
;
const
char
*
item_title
=
"thread"
;
maxlen
=
object_name_maxlen
(
list
);
maxlen
=
object_name_maxlen
(
item_title
,
list
);
rt_kprintf
(
"%-*.s pri status sp stack size max used left tick error
\n
"
,
maxlen
,
"thread"
);
object_split
(
maxlen
);
rt_kprintf
(
"%-*.s pri status sp stack size max used left tick error
\n
"
,
maxlen
,
item_title
);
object_split
(
maxlen
);
rt_kprintf
(
" --- ------- ---------- ---------- ------ ---------- ---
\n
"
);
for
(
node
=
list
->
next
;
node
!=
list
;
node
=
node
->
next
)
{
...
...
@@ -162,11 +163,11 @@ static long _list_sem(struct rt_list_node *list)
int
maxlen
;
struct
rt_semaphore
*
sem
;
struct
rt_list_node
*
node
;
const
char
*
item_title
=
"semaphore"
;
maxlen
=
object_name_maxlen
(
list
);
if
(
maxlen
<
9
)
maxlen
=
9
;
maxlen
=
object_name_maxlen
(
item_title
,
list
);
rt_kprintf
(
"%-*.s v suspend thread
\n
"
,
maxlen
,
"semaphore"
);
object_split
(
maxlen
);
rt_kprintf
(
"%-*.s v suspend thread
\n
"
,
maxlen
,
item_title
);
object_split
(
maxlen
);
rt_kprintf
(
" --- --------------
\n
"
);
for
(
node
=
list
->
next
;
node
!=
list
;
node
=
node
->
next
)
{
...
...
@@ -212,10 +213,11 @@ static long _list_event(struct rt_list_node *list)
int
maxlen
;
struct
rt_event
*
e
;
struct
rt_list_node
*
node
;
const
char
*
item_title
=
"event"
;
maxlen
=
object_name_maxlen
(
list
);
maxlen
=
object_name_maxlen
(
item_title
,
list
);
rt_kprintf
(
"%-*.s set suspend thread
\n
"
,
maxlen
,
"event"
);
object_split
(
maxlen
);
rt_kprintf
(
"%-*.s set suspend thread
\n
"
,
maxlen
,
item_title
);
object_split
(
maxlen
);
rt_kprintf
(
" ---------- --------------
\n
"
);
for
(
node
=
list
->
next
;
node
!=
list
;
node
=
node
->
next
)
{
...
...
@@ -257,9 +259,11 @@ static long _list_mutex(struct rt_list_node *list)
int
maxlen
;
struct
rt_mutex
*
m
;
struct
rt_list_node
*
node
;
const
char
*
item_title
=
"mutex"
;
maxlen
=
object_name_maxlen
(
list
);
rt_kprintf
(
"%-*.s owner hold suspend thread
\n
"
,
maxlen
,
"mutex"
);
object_split
(
maxlen
);
maxlen
=
object_name_maxlen
(
item_title
,
list
);
rt_kprintf
(
"%-*.s owner hold suspend thread
\n
"
,
maxlen
,
item_title
);
object_split
(
maxlen
);
rt_kprintf
(
" -------- ---- --------------
\n
"
);
for
(
node
=
list
->
next
;
node
!=
list
;
node
=
node
->
next
)
{
...
...
@@ -294,12 +298,9 @@ static long _list_mailbox(struct rt_list_node *list)
int
maxlen
;
struct
rt_mailbox
*
m
;
struct
rt_list_node
*
node
;
int
item_title_len
;
const
char
*
item_title
=
"mailbox"
;
item_title_len
=
rt_strlen
(
item_title
);
maxlen
=
object_name_maxlen
(
list
);
if
(
maxlen
<
item_title_len
)
maxlen
=
item_title_len
;
maxlen
=
object_name_maxlen
(
item_title
,
list
);
rt_kprintf
(
"%-*.s entry size suspend thread
\n
"
,
maxlen
,
item_title
);
object_split
(
maxlen
);
rt_kprintf
(
" ---- ---- --------------
\n
"
);
...
...
@@ -348,12 +349,9 @@ static long _list_msgqueue(struct rt_list_node *list)
int
maxlen
;
struct
rt_messagequeue
*
m
;
struct
rt_list_node
*
node
;
int
item_title_len
;
const
char
*
item_title
=
"msgqueue"
;
item_title_len
=
rt_strlen
(
item_title
);
maxlen
=
object_name_maxlen
(
list
);
if
(
maxlen
<
item_title_len
)
maxlen
=
item_title_len
;
maxlen
=
object_name_maxlen
(
item_title
,
list
);
rt_kprintf
(
"%-*.s entry suspend thread
\n
"
,
maxlen
,
item_title
);
object_split
(
maxlen
);
rt_kprintf
(
" ---- --------------
\n
"
);
...
...
@@ -400,10 +398,11 @@ static long _list_memheap(struct rt_list_node *list)
int
maxlen
;
struct
rt_memheap
*
mh
;
struct
rt_list_node
*
node
;
const
char
*
item_title
=
"memheap"
;
maxlen
=
object_name_maxlen
(
list
);
maxlen
=
object_name_maxlen
(
item_title
,
list
);
rt_kprintf
(
"%-*.s pool size max used size available size
\n
"
,
maxlen
,
"memheap"
);
object_split
(
maxlen
);
rt_kprintf
(
"%-*.s pool size max used size available size
\n
"
,
maxlen
,
item_title
);
object_split
(
maxlen
);
rt_kprintf
(
" ---------- ------------- --------------
\n
"
);
for
(
node
=
list
->
next
;
node
!=
list
;
node
=
node
->
next
)
{
...
...
@@ -437,10 +436,11 @@ static long _list_mempool(struct rt_list_node *list)
int
maxlen
;
struct
rt_mempool
*
mp
;
struct
rt_list_node
*
node
;
const
char
*
item_title
=
"mempool"
;
maxlen
=
object_name_maxlen
(
list
);
maxlen
=
object_name_maxlen
(
item_title
,
list
);
rt_kprintf
(
"%-*.s block total free suspend thread
\n
"
,
maxlen
,
"mempool"
);
object_split
(
maxlen
);
rt_kprintf
(
"%-*.s block total free suspend thread
\n
"
,
maxlen
,
item_title
);
object_split
(
maxlen
);
rt_kprintf
(
" ---- ---- ---- --------------
\n
"
);
for
(
node
=
list
->
next
;
node
!=
list
;
node
=
node
->
next
)
{
...
...
@@ -488,10 +488,11 @@ static long _list_timer(struct rt_list_node *list)
int
maxlen
;
struct
rt_timer
*
timer
;
struct
rt_list_node
*
node
;
const
char
*
item_title
=
"timer"
;
maxlen
=
object_name_maxlen
(
list
);
maxlen
=
object_name_maxlen
(
item_title
,
list
);
rt_kprintf
(
"%-*.s periodic timeout flag
\n
"
,
maxlen
,
"timer"
);
object_split
(
maxlen
);
rt_kprintf
(
"%-*.s periodic timeout flag
\n
"
,
maxlen
,
item_title
);
object_split
(
maxlen
);
rt_kprintf
(
" ---------- ---------- -----------
\n
"
);
for
(
node
=
list
->
next
;
node
!=
list
;
node
=
node
->
next
)
{
...
...
@@ -551,12 +552,9 @@ static long _list_device(struct rt_list_node *list)
"Miscellaneous Device"
,
"Unknown"
};
int
item_title_len
;
const
char
*
item_title
=
"device"
;
item_title_len
=
rt_strlen
(
item_title
);
maxlen
=
object_name_maxlen
(
list
);
if
(
maxlen
<
item_title_len
)
maxlen
=
item_title_len
;
maxlen
=
object_name_maxlen
(
item_title
,
list
);
rt_kprintf
(
"%-*.s type ref count
\n
"
,
maxlen
,
item_title
);
object_split
(
maxlen
);
rt_kprintf
(
" -------------------- ----------
\n
"
);
...
...
@@ -595,13 +593,14 @@ int list_module(void)
struct
rt_module
*
module
;
struct
rt_list_node
*
list
,
*
node
;
struct
rt_object_information
*
info
;
const
char
*
item_title
=
"module"
;
info
=
rt_object_get_information
(
RT_Object_Class_Module
);
list
=
&
info
->
object_list
;
maxlen
=
object_name_maxlen
(
list
);
maxlen
=
object_name_maxlen
(
item_title
,
list
);
rt_kprintf
(
"%-*.s ref address
\n
"
,
maxlen
,
"module"
);
object_split
(
maxlen
);
rt_kprintf
(
"%-*.s ref address
\n
"
,
maxlen
,
item_title
);
object_split
(
maxlen
);
rt_kprintf
(
" -------- ------------
\n
"
);
for
(
node
=
list
->
next
;
node
!=
list
;
node
=
node
->
next
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录