Skip to content

R
rt-thread

宁楠萍 / rt-thread
与 Fork 源项目一致

Fork自 RT-Thread / rt-thread

通知 2
Star 0
Fork 0
R
rt-thread

体验新版 GitCode，发现更多精彩内容 >>

提交 5941d736 编写于 作者: G gbcwbz
浏览文件
操作

Convert tab into spaces

上级 517e909c
隐藏空白更改
内联 并排
Showing with 13 addition and 13 deletion
components/finsh/cmd.c
浏览文件 @ 5941d736
...@@ -293,12 +293,12 @@ static long _list_mailbox(struct rt_list_node *list) ...@@ -293,12 +293,12 @@ static long _list_mailbox(struct rt_list_node *list)
int maxlen; int maxlen;
struct rt_mailbox *m; struct rt_mailbox *m;
struct rt_list_node *node; struct rt_list_node *node;
int item_title_len; int item_title_len;
const char *item_title = "mailbox"; const char *item_title = "mailbox";
item_title_len = rt_strlen(item_title); item_title_len = rt_strlen(item_title);
maxlen = object_name_maxlen(list); maxlen = object_name_maxlen(list);
if(maxlen < item_title_len) maxlen = item_title_len; if(maxlen < item_title_len) maxlen = item_title_len;
rt_kprintf("%-*.s entry size suspend thread\n", maxlen, item_title); object_split(maxlen); rt_kprintf("%-*.s entry size suspend thread\n", maxlen, item_title); object_split(maxlen);
rt_kprintf( " ---- ---- --------------\n"); rt_kprintf( " ---- ---- --------------\n");
...@@ -344,12 +344,12 @@ static long _list_msgqueue(struct rt_list_node *list) ...@@ -344,12 +344,12 @@ static long _list_msgqueue(struct rt_list_node *list)
int maxlen; int maxlen;
struct rt_messagequeue *m; struct rt_messagequeue *m;
struct rt_list_node *node; struct rt_list_node *node;
int item_title_len; int item_title_len;
const char *item_title = "msgqueue"; const char *item_title = "msgqueue";
item_title_len = rt_strlen(item_title); item_title_len = rt_strlen(item_title);
maxlen = object_name_maxlen(list); maxlen = object_name_maxlen(list);
if(maxlen < item_title_len) maxlen = item_title_len; if(maxlen < item_title_len) maxlen = item_title_len;
rt_kprintf("%-*.s entry suspend thread\n", maxlen, item_title); object_split(maxlen); rt_kprintf("%-*.s entry suspend thread\n", maxlen, item_title); object_split(maxlen);
rt_kprintf( " ---- --------------\n"); rt_kprintf( " ---- --------------\n");
...@@ -535,12 +535,12 @@ static long _list_device(struct rt_list_node *list) ...@@ -535,12 +535,12 @@ static long _list_device(struct rt_list_node *list)
"Miscellaneous Device", "Miscellaneous Device",
"Unknown" "Unknown"
}; };
int item_title_len; int item_title_len;
const char *item_title = "device"; const char *item_title = "device";
item_title_len = rt_strlen(item_title); item_title_len = rt_strlen(item_title);
maxlen = object_name_maxlen(list); maxlen = object_name_maxlen(list);
if(maxlen < item_title_len) maxlen = item_title_len; if(maxlen < item_title_len) maxlen = item_title_len;
rt_kprintf("%-*.s type ref count\n", maxlen, item_title); object_split(maxlen); rt_kprintf("%-*.s type ref count\n", maxlen, item_title); object_split(maxlen);
rt_kprintf( " -------------------- ----------\n"); rt_kprintf( " -------------------- ----------\n");
......
Markdown is supported
0% 或 .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑！
想要评论请 注册 或