• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*
2  * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
3  * Copyright (c) 2020-2022 Huawei Device Co., Ltd. All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without modification,
6  * are permitted provided that the following conditions are met:
7  *
8  * 1. Redistributions of source code must retain the above copyright notice, this list of
9  *    conditions and the following disclaimer.
10  *
11  * 2. Redistributions in binary form must reproduce the above copyright notice, this list
12  *    of conditions and the following disclaimer in the documentation and/or other materials
13  *    provided with the distribution.
14  *
15  * 3. Neither the name of the copyright holder nor the names of its contributors may be used
16  *    to endorse or promote products derived from this software without specific prior written
17  *    permission.
18  *
19  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
21  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22  * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
23  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
24  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
26  * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
27  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
28  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
29  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30  */
31 
32 #include "los_lmk.h"
33 #include "los_interrupt.h"
34 #if (LOSCFG_KERNEL_LMK_DEBUG == 1)
35 #include "los_debug.h"
36 #endif
37 
38 #if (LOSCFG_KERNEL_LMK == 1)
39 STATIC LosLmkOps g_losLmkOps;
40 
OsIsLmkOpsNodeRegistered(LosLmkOpsNode * lmkNode)41 STATIC BOOL OsIsLmkOpsNodeRegistered(LosLmkOpsNode *lmkNode)
42 {
43     LosLmkOpsNode *opsNode = NULL;
44 
45     if (LOS_ListEmpty(&g_losLmkOps.lmkOpsList)) {
46         return FALSE;
47     }
48     LOS_DL_LIST_FOR_EACH_ENTRY(opsNode, &g_losLmkOps.lmkOpsList, LosLmkOpsNode, node) {
49         if (lmkNode == opsNode) {
50             return TRUE;
51         }
52     }
53     return FALSE;
54 }
55 
LOS_LmkOpsNodeRegister(LosLmkOpsNode * lmkNode)56 UINT32 LOS_LmkOpsNodeRegister(LosLmkOpsNode *lmkNode)
57 {
58     UINT32 intSave;
59     LosLmkOpsNode *opsNode = NULL;
60 
61     if (lmkNode == NULL) {
62         return LOS_ERRNO_LMK_INVALID_PARAMETER;
63     }
64 
65     intSave = LOS_IntLock();
66     if (OsIsLmkOpsNodeRegistered(lmkNode)) {
67         LOS_IntRestore(intSave);
68         return LOS_ERRNO_LMK_ALREADY_REGISTERED;
69     }
70     if (LOS_ListEmpty(&g_losLmkOps.lmkOpsList)) {
71         LOS_ListHeadInsert(&g_losLmkOps.lmkOpsList, &lmkNode->node);
72         LOS_IntRestore(intSave);
73         return LOS_OK;
74     }
75 
76     // the priority of registered node <= the first node
77     opsNode = LOS_DL_LIST_ENTRY(g_losLmkOps.lmkOpsList.pstNext, LosLmkOpsNode, node);
78     if (lmkNode->priority <= opsNode->priority) {
79         LOS_ListHeadInsert(&g_losLmkOps.lmkOpsList, &lmkNode->node);
80         LOS_IntRestore(intSave);
81         return LOS_OK;
82     }
83 
84     // the priority of registered node > the last node
85     opsNode = LOS_DL_LIST_ENTRY(g_losLmkOps.lmkOpsList.pstPrev, LosLmkOpsNode, node);
86     if (lmkNode->priority >= opsNode->priority) {
87         LOS_ListTailInsert(&g_losLmkOps.lmkOpsList, &lmkNode->node);
88         LOS_IntRestore(intSave);
89         return LOS_OK;
90     }
91 
92     // the priority of registered node > the first node and < the last node
93     LOS_DL_LIST_FOR_EACH_ENTRY(opsNode, &g_losLmkOps.lmkOpsList, LosLmkOpsNode, node) {
94         if (lmkNode->priority < opsNode->priority) {
95             LOS_ListHeadInsert((&opsNode->node)->pstPrev, &lmkNode->node);
96             break;
97         }
98     }
99 
100     LOS_IntRestore(intSave);
101     return LOS_OK;
102 }
103 
LOS_LmkOpsNodeUnregister(LosLmkOpsNode * lmkNode)104 UINT32 LOS_LmkOpsNodeUnregister(LosLmkOpsNode *lmkNode)
105 {
106     UINT32 intSave;
107 
108     if (lmkNode == NULL) {
109         return LOS_ERRNO_LMK_INVALID_PARAMETER;
110     }
111 
112     intSave = LOS_IntLock();
113     if (LOS_ListEmpty(&g_losLmkOps.lmkOpsList) || !OsIsLmkOpsNodeRegistered(lmkNode)) {
114         LOS_IntRestore(intSave);
115         return LOS_ERRNO_LMK_NOT_REGISTERED;
116     }
117     LOS_ListDelete(&lmkNode->node);
118     LOS_IntRestore(intSave);
119     return LOS_OK;
120 }
121 
LOS_LmkTasksKill(VOID)122 UINT32 LOS_LmkTasksKill(VOID)
123 {
124     UINT32 intSave;
125     UINT32 ret;
126     LosLmkOpsNode *opsNode = NULL;
127     FreeMemByKillingTask freeMem = NULL;
128 
129     intSave = LOS_IntLock();
130 
131     // if tasks already killed, no need to do it again.
132     if (g_losLmkOps.isMemFreed) {
133         LOS_IntRestore(intSave);
134         return LOS_ERRNO_LMK_MEMORY_ALREADY_FREED;
135     } else {
136         g_losLmkOps.isMemFreed = TRUE;
137     }
138     LOS_DL_LIST_FOR_EACH_ENTRY(opsNode, &g_losLmkOps.lmkOpsList, LosLmkOpsNode, node) {
139         freeMem = opsNode->freeMem;
140         LOS_IntRestore(intSave);
141         if (freeMem != NULL) {
142             ret = freeMem();
143             if (ret != LOS_OK) {
144                 return LOS_ERRNO_LMK_FREE_MEMORY_FAILURE;
145             }
146         }
147         intSave = LOS_IntLock();
148     }
149     LOS_IntRestore(intSave);
150 
151     return LOS_OK;
152 }
153 
LOS_LmkTasksRestore(VOID)154 UINT32 LOS_LmkTasksRestore(VOID)
155 {
156     UINT32 intSave;
157     UINT32 ret;
158     LosLmkOpsNode *opsNode = NULL;
159     RestoreKilledTask restore = NULL;
160 
161     intSave = LOS_IntLock();
162 
163     // if no tasks killed, no need to restore.
164     if (!g_losLmkOps.isMemFreed) {
165         LOS_IntRestore(intSave);
166         return LOS_ERRNO_LMK_RESTORE_NOT_NEEDED;
167     } else {
168         g_losLmkOps.isMemFreed = FALSE;
169     }
170     LOS_DL_LIST_FOR_EACH_ENTRY(opsNode, &g_losLmkOps.lmkOpsList, LosLmkOpsNode, node) {
171         restore = opsNode->restoreTask;
172         LOS_IntRestore(intSave);
173         if (restore != NULL) {
174             ret = restore();
175             if (ret != LOS_OK) {
176                 return LOS_ERRNO_LMK_RESTORE_TASKS_FAILURE;
177             }
178         }
179         intSave = LOS_IntLock();
180     }
181     LOS_IntRestore(intSave);
182 
183     return LOS_OK;
184 }
185 
186 #if (LOSCFG_KERNEL_LMK_DEBUG == 1)
LOS_LmkOpsNodeInfoShow(VOID)187 VOID LOS_LmkOpsNodeInfoShow(VOID)
188 {
189     UINT32 intSave;
190     LosLmkOpsNode *opsNode = NULL;
191 
192     intSave = LOS_IntLock();
193     LOS_DL_LIST_FOR_EACH_ENTRY(opsNode, &g_losLmkOps.lmkOpsList, LosLmkOpsNode, node) {
194         PRINTK("Priority: %-4u Free:0x%-8x Restore:0x%-8x\n", opsNode->priority,
195                (UINT32)(UINTPTR)opsNode->freeMem, (UINT32)(UINTPTR)opsNode->restoreTask);
196     }
197     LOS_IntRestore(intSave);
198 }
199 #endif
200 
OsLmkInit(VOID)201 VOID OsLmkInit(VOID)
202 {
203     g_losLmkOps.isMemFreed = FALSE;
204     LOS_ListInit(&g_losLmkOps.lmkOpsList);
205 }
206 #endif
207