Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Kernel Liteos M
提交
93f029b4
K
Kernel Liteos M
项目概览
OpenHarmony
/
Kernel Liteos M
大约 1 年 前同步成功
通知
20
Star
28
Fork
1
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
K
Kernel Liteos M
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
93f029b4
编写于
8月 11, 2021
作者:
O
openharmony_ci
提交者:
Gitee
8月 11, 2021
浏览文件
操作
浏览文件
下载
差异文件
!250 某些编译器下编译告警消除
Merge pull request !250 from 野生毛霉君/master
上级
fa0b8b0d
8dea15c4
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
10 addition
and
10 deletion
+10
-10
kernel/src/mm/los_memory.c
kernel/src/mm/los_memory.c
+10
-10
未找到文件。
kernel/src/mm/los_memory.c
浏览文件 @
93f029b4
...
...
@@ -531,7 +531,7 @@ VOID LOS_MemUsedNodeShow(VOID *pool)
struct
OsMemPoolHead
*
poolInfo
=
(
struct
OsMemPoolHead
*
)
pool
;
struct
OsMemNodeHead
*
tmpNode
=
NULL
;
struct
OsMemNodeHead
*
endNode
=
NULL
;
UINT32
intSave
;
UINT32
intSave
=
0
;
UINT32
count
;
PRINTK
(
"
\n\r
node size "
);
...
...
@@ -1002,7 +1002,7 @@ VOID *LOS_MemAlloc(VOID *pool, UINT32 size)
struct
OsMemPoolHead
*
poolHead
=
(
struct
OsMemPoolHead
*
)
pool
;
VOID
*
ptr
=
NULL
;
UINT32
intSave
;
UINT32
intSave
=
0
;
MEM_LOCK
(
poolHead
,
intSave
);
do
{
...
...
@@ -1046,7 +1046,7 @@ VOID *LOS_MemAllocAlign(VOID *pool, UINT32 size, UINT32 boundary)
}
struct
OsMemPoolHead
*
poolHead
=
(
struct
OsMemPoolHead
*
)
pool
;
UINT32
intSave
;
UINT32
intSave
=
0
;
VOID
*
ptr
=
NULL
;
VOID
*
alignedPtr
=
NULL
;
...
...
@@ -1249,7 +1249,7 @@ UINT32 LOS_MemFree(VOID *pool, VOID *ptr)
UINT32
ret
=
LOS_NOK
;
struct
OsMemPoolHead
*
poolHead
=
(
struct
OsMemPoolHead
*
)
pool
;
struct
OsMemNodeHead
*
node
=
NULL
;
UINT32
intSave
;
UINT32
intSave
=
0
;
MEM_LOCK
(
poolHead
,
intSave
);
do
{
...
...
@@ -1356,7 +1356,7 @@ VOID *LOS_MemRealloc(VOID *pool, VOID *ptr, UINT32 size)
struct
OsMemPoolHead
*
poolHead
=
(
struct
OsMemPoolHead
*
)
pool
;
struct
OsMemNodeHead
*
node
=
NULL
;
VOID
*
newPtr
=
NULL
;
UINT32
intSave
;
UINT32
intSave
=
0
;
MEM_LOCK
(
poolHead
,
intSave
);
do
{
...
...
@@ -1392,7 +1392,7 @@ UINT32 LOS_MemFreeByTaskID(VOID *pool, UINT32 taskID)
struct
OsMemNodeHead
*
tmpNode
=
NULL
;
struct
OsMemUsedNodeHead
*
node
=
NULL
;
struct
OsMemNodeHead
*
endNode
=
NULL
;
UINT32
intSave
;
UINT32
intSave
=
0
;
MEM_LOCK
(
poolHead
,
intSave
);
endNode
=
OS_MEM_END_NODE
(
pool
,
poolHead
->
info
.
totalSize
);
...
...
@@ -1444,7 +1444,7 @@ UINT32 LOS_MemTotalUsedGet(VOID *pool)
struct
OsMemPoolHead
*
poolInfo
=
(
struct
OsMemPoolHead
*
)
pool
;
struct
OsMemNodeHead
*
endNode
=
NULL
;
UINT32
memUsed
=
0
;
UINT32
intSave
;
UINT32
intSave
=
0
;
if
(
pool
==
NULL
)
{
return
LOS_NOK
;
...
...
@@ -1834,7 +1834,7 @@ UINT32 LOS_MemInfoGet(VOID *pool, LOS_MEM_POOL_STATUS *poolStatus)
struct
OsMemNodeHead
*
tmpNode
=
NULL
;
struct
OsMemNodeHead
*
endNode
=
NULL
;
UINT32
intSave
;
UINT32
intSave
=
0
;
MEM_LOCK
(
poolInfo
,
intSave
);
endNode
=
OS_MEM_END_NODE
(
pool
,
poolInfo
->
info
.
totalSize
);
...
...
@@ -1914,7 +1914,7 @@ UINT32 LOS_MemFreeNodeShow(VOID *pool)
struct
OsMemFreeNodeHead
*
node
=
NULL
;
UINT32
countNum
[
OS_MEM_FREE_LIST_COUNT
]
=
{
0
};
UINT32
index
;
UINT32
intSave
;
UINT32
intSave
=
0
;
MEM_LOCK
(
poolInfo
,
intSave
);
for
(
index
=
0
;
index
<
OS_MEM_FREE_LIST_COUNT
;
index
++
)
{
...
...
@@ -1976,7 +1976,7 @@ STATIC VOID OsMemExcInfoGetSub(struct OsMemPoolHead *pool, MemInfoCB *memExcInfo
{
struct
OsMemNodeHead
*
tmpNode
=
NULL
;
UINT32
taskID
=
OS_TASK_ERRORID
;
UINT32
intSave
;
UINT32
intSave
=
0
;
(
VOID
)
memset_s
(
memExcInfo
,
sizeof
(
MemInfoCB
),
0
,
sizeof
(
MemInfoCB
));
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录