144 for (index = 0; index < LOSCFG_BASE_IPC_QUEUE_LIMIT; index++) {
145 SCHEDULER_LOCK(intSave);
146 (VOID)memcpy_s(&queueNode,
sizeof(
LosQueueCB),
150 SCHEDULER_UNLOCK(intSave);
151 if ((queueNode.
queueState == OS_QUEUE_UNUSED) ||
152 ((queueNode.
queueState == OS_QUEUE_INUSED) && (queueDebugNode.
creater == NULL))) {
155 if ((queueNode.
queueState == OS_QUEUE_INUSED) &&
160 PRINTK(
"Queue ID <0x%x> may leak, No task uses it, "
161 "QueueLen is 0x%x, ",
166 if (indexArray != NULL) {
167 *(indexArray + count) = index;
176 if (indexArray != NULL) {
LITE_OS_SEC_ALW_INLINE STATIC INLINE BOOL LOS_ListEmpty(LOS_DL_LIST *list)
Identify whether a specified doubly linked list is empty. | 判断链表是否为空
VOID * LOS_MemAlloc(VOID *pool, UINT32 size)
从指定内存池中申请size长度的内存,注意这可不是从内核堆空间中申请内存
STATIC QueueDebugCB * g_queueDebugArray
STATIC VOID SortQueueIndexArray(UINT32 *indexArray, UINT32 count)
STATIC INLINE VOID OsQueueInfoOutPut(const LosQueueCB *node)
STATIC INLINE VOID OsQueueOpsOutput(const QueueDebugCB *node)
UINT16 readWriteableCnt[OS_QUEUE_N_RW]
LOS_DL_LIST readWriteList[OS_QUEUE_N_RW]