Lines Matching refs:opsNode
43 LosLmkOpsNode *opsNode = NULL;
48 LOS_DL_LIST_FOR_EACH_ENTRY(opsNode, &g_losLmkOps.lmkOpsList, LosLmkOpsNode, node) {
49 if (lmkNode == opsNode) {
59 LosLmkOpsNode *opsNode = NULL;
77 opsNode = LOS_DL_LIST_ENTRY(g_losLmkOps.lmkOpsList.pstNext, LosLmkOpsNode, node);
78 if (lmkNode->priority <= opsNode->priority) {
85 opsNode = LOS_DL_LIST_ENTRY(g_losLmkOps.lmkOpsList.pstPrev, LosLmkOpsNode, node);
86 if (lmkNode->priority >= opsNode->priority) {
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);
126 LosLmkOpsNode *opsNode = NULL;
138 LOS_DL_LIST_FOR_EACH_ENTRY(opsNode, &g_losLmkOps.lmkOpsList, LosLmkOpsNode, node) {
139 freeMem = opsNode->freeMem;
158 LosLmkOpsNode *opsNode = NULL;
170 LOS_DL_LIST_FOR_EACH_ENTRY(opsNode, &g_losLmkOps.lmkOpsList, LosLmkOpsNode, node) {
171 restore = opsNode->restoreTask;
190 LosLmkOpsNode *opsNode = NULL;
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);