You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
192 lines
5.8 KiB
192 lines
5.8 KiB
/* ----------------------------------------------------------------------------
|
|
* Copyright (c) Huawei Technologies Co., Ltd. 2013-2019. All rights reserved.
|
|
* Description: Misc Functions
|
|
* Author: Huawei LiteOS Team
|
|
* Create: 2013-01-01
|
|
* Redistribution and use in source and binary forms, with or without modification,
|
|
* are permitted provided that the following conditions are met:
|
|
* 1. Redistributions of source code must retain the above copyright notice, this list of
|
|
* conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice, this list
|
|
* of conditions and the following disclaimer in the documentation and/or other materials
|
|
* provided with the distribution.
|
|
* 3. Neither the name of the copyright holder nor the names of its contributors may be used
|
|
* to endorse or promote products derived from this software without specific prior written
|
|
* permission.
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
|
|
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
|
|
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
* --------------------------------------------------------------------------- */
|
|
|
|
#include "los_task_pri.h"
|
|
#include "los_misc_pri.h"
|
|
#include "los_memory_pri.h"
|
|
#ifdef LOSCFG_SHELL_EXCINFO_DUMP
|
|
#include "los_exc_pri.h"
|
|
#endif
|
|
|
|
#ifdef LOSCFG_KERNEL_TRACE
|
|
#include "los_trace_pri.h"
|
|
#endif
|
|
|
|
#ifdef LOSCFG_KERNEL_LMS
|
|
#include "los_lms_pri.h"
|
|
#endif
|
|
|
|
#ifdef __cplusplus
|
|
#if __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
#endif /* __cplusplus */
|
|
|
|
#ifdef LOSCFG_LIB_CONFIGURABLE
|
|
LITE_OS_SEC_BSS UINT32 g_osSysClock;
|
|
LITE_OS_SEC_BSS UINT32 g_semLimit;
|
|
LITE_OS_SEC_BSS UINT32 g_muxLimit;
|
|
LITE_OS_SEC_BSS UINT32 g_queueLimit;
|
|
|
|
LITE_OS_SEC_BSS UINT32 g_swtmrLimit;
|
|
LITE_OS_SEC_BSS UINT32 g_taskLimit;
|
|
LITE_OS_SEC_BSS UINT32 g_minusOneTickPerSecond;
|
|
LITE_OS_SEC_BSS UINT32 g_taskMinStkSize;
|
|
LITE_OS_SEC_BSS UINT32 g_taskIdleStkSize;
|
|
LITE_OS_SEC_BSS UINT32 g_taskSwtmrStkSize;
|
|
LITE_OS_SEC_BSS UINT32 g_taskDfltStkSize;
|
|
LITE_OS_SEC_BSS UINT32 g_timeSliceTimeOut;
|
|
|
|
LITE_OS_SEC_DATA BOOL g_nxEnabled = FALSE;
|
|
LITE_OS_SEC_BSS UINTPTR g_dlNxHeapBase;
|
|
LITE_OS_SEC_BSS UINT32 g_dlNxHeapSize;
|
|
#endif
|
|
|
|
#ifdef LOSCFG_KERNEL_TRACE
|
|
TRACE_EVENT_HOOK g_traceEventHook = NULL;
|
|
TRACE_DUMP_HOOK g_traceDumpHook = NULL;
|
|
#endif
|
|
|
|
#ifdef LOSCFG_KERNEL_LMS
|
|
LMS_INIT_HOOK g_lmsMemInitHook = NULL;
|
|
LMS_FUNC_HOOK g_lmsMallocHook = NULL;
|
|
LMS_FUNC_HOOK g_lmsFreeHook = NULL;
|
|
#endif
|
|
LITE_OS_SEC_TEXT UINTPTR LOS_Align(UINTPTR addr, UINT32 boundary)
|
|
{
|
|
return (addr + boundary - 1) & ~((UINTPTR)(boundary - 1));
|
|
}
|
|
|
|
LITE_OS_SEC_TEXT_MINOR VOID LOS_Msleep(UINT32 msecs)
|
|
{
|
|
UINT32 interval;
|
|
|
|
if (msecs == 0) {
|
|
interval = 0; /* The value 0 indicates direct scheduling. */
|
|
} else {
|
|
interval = LOS_MS2Tick(msecs);
|
|
if (interval < UINT32_MAX) {
|
|
interval += 1; /* Add a tick to compensate for the inaccurate tick count. */
|
|
}
|
|
}
|
|
|
|
(VOID)LOS_TaskDelay(interval);
|
|
}
|
|
|
|
VOID OsDumpMemByte(size_t length, UINTPTR addr)
|
|
{
|
|
size_t dataLen;
|
|
UINTPTR *alignAddr = NULL;
|
|
UINT32 count = 0;
|
|
|
|
dataLen = ALIGN(length, sizeof(UINTPTR));
|
|
alignAddr = (UINTPTR *)TRUNCATE(addr, sizeof(UINTPTR));
|
|
if ((dataLen == 0) || (alignAddr == NULL)) {
|
|
return;
|
|
}
|
|
while (dataLen) {
|
|
if (IS_ALIGNED(count, sizeof(CHAR *))) {
|
|
PRINTK("\n 0x%lx :", alignAddr);
|
|
#ifdef LOSCFG_SHELL_EXCINFO_DUMP
|
|
WriteExcInfoToBuf("\n 0x%lx :", alignAddr);
|
|
#endif
|
|
}
|
|
#ifdef __LP64__
|
|
PRINTK("%0+16lx ", *alignAddr);
|
|
#else
|
|
PRINTK("%0+8lx ", *alignAddr);
|
|
#endif
|
|
#ifdef LOSCFG_SHELL_EXCINFO_DUMP
|
|
#ifdef __LP64__
|
|
WriteExcInfoToBuf("0x%0+16x ", *alignAddr);
|
|
#else
|
|
WriteExcInfoToBuf("0x%0+8x ", *alignAddr);
|
|
#endif
|
|
#endif
|
|
alignAddr++;
|
|
dataLen -= sizeof(CHAR *);
|
|
count++;
|
|
}
|
|
PRINTK("\n");
|
|
#ifdef LOSCFG_SHELL_EXCINFO_DUMP
|
|
WriteExcInfoToBuf("\n");
|
|
#endif
|
|
|
|
return;
|
|
}
|
|
|
|
#if defined(LOSCFG_DEBUG_SEMAPHORE) || defined(LOSCFG_DEBUG_MUTEX) || defined(LOSCFG_DEBUG_QUEUE)
|
|
VOID OsArraySort(UINT32 *sortArray, UINT32 start, UINT32 end,
|
|
const SortParam *sortParam, OsCompareFunc compareFunc)
|
|
{
|
|
UINT32 left = start;
|
|
UINT32 right = end;
|
|
UINT32 idx = start;
|
|
UINT32 pivot = sortArray[start];
|
|
|
|
while (left < right) {
|
|
while ((left < right) && (sortArray[right] < sortParam->ctrlBlockCnt) && (pivot < sortParam->ctrlBlockCnt) &&
|
|
compareFunc(sortParam, sortArray[right], pivot)) {
|
|
right--;
|
|
}
|
|
|
|
if (left < right) {
|
|
sortArray[left] = sortArray[right];
|
|
idx = right;
|
|
left++;
|
|
}
|
|
|
|
while ((left < right) && (sortArray[left] < sortParam->ctrlBlockCnt) && (pivot < sortParam->ctrlBlockCnt) &&
|
|
compareFunc(sortParam, pivot, sortArray[left])) {
|
|
left++;
|
|
}
|
|
|
|
if (left < right) {
|
|
sortArray[right] = sortArray[left];
|
|
idx = left;
|
|
right--;
|
|
}
|
|
}
|
|
|
|
sortArray[idx] = pivot;
|
|
|
|
if (start < idx) {
|
|
OsArraySort(sortArray, start, idx - 1, sortParam, compareFunc);
|
|
}
|
|
if (idx < end) {
|
|
OsArraySort(sortArray, idx + 1, end, sortParam, compareFunc);
|
|
}
|
|
}
|
|
#endif
|
|
|
|
#ifdef __cplusplus
|
|
#if __cplusplus
|
|
}
|
|
#endif
|
|
#endif /* __cplusplus */
|