/* * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved. * Copyright (c) 2020-2021 Huawei Device Co., Ltd. All rights reserved. * * 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 "It_los_queue.h" #ifdef __cplusplus #if __cplusplus extern "C" { #endif /* __cpluscplus */ #endif /* __cpluscplus */ static CHAR g_buff1[QUEUE_SHORT_BUFFER_LENGTH] = "UniDSP"; static CHAR g_buff2[QUEUE_SHORT_BUFFER_LENGTH] = ""; static VOID TaskF01(VOID) { UINT32 ret; ICUNIT_ASSERT_EQUAL_VOID(g_testCount, 0, g_testCount); LOS_AtomicInc(&g_testCount); ret = LOS_QueueRead(g_testQueueID01, &g_buff2, 8, LOS_WAIT_FOREVER); // 8, Read the setting size of queue buffer. ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret); TestDumpCpuid(); LOS_AtomicInc(&g_testCount); return; } static VOID HwiF01(VOID) { UINT32 ret; ret = LOS_QueueWrite(g_testQueueID01, &g_buff1, 8, LOS_NO_WAIT); // 8, Write the setting size of queue buffer. ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret); TestDumpCpuid(); LOS_AtomicInc(&g_testCount); return; } static UINT32 Testcase(VOID) { UINT32 ret, currCpuid; TSK_INIT_PARAM_S testTask; g_testCount = 0; ret = LOS_QueueCreate("Q1", 1, &g_testQueueID01, 0, 8); // 8, Set the maximum data length of the message queue. ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret); currCpuid = (ArchCurrCpuid() + 1) % (LOSCFG_KERNEL_CORE_NUM); ret = LOS_HwiCreate(HWI_NUM_TEST, 1, 0, (HWI_PROC_FUNC)HwiF01, 0); ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret); HalIrqSetAffinity(HWI_NUM_TEST, CPUID_TO_AFFI_MASK(currCpuid)); // other cpu TEST_TASK_PARAM_INIT_AFFI(testTask, "it_event_009_task", TaskF01, TASK_PRIO_TEST - 1, CPUID_TO_AFFI_MASK(ArchCurrCpuid())); // current cpu ret = LOS_TaskCreate(&g_testTaskID01, &testTask); ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret); ICUNIT_GOTO_EQUAL(g_testCount, 1, g_testCount, EXIT); TestHwiTrigger(HWI_NUM_TEST); TestAssertBusyTaskDelay(100, 3); // 100, Set the timeout of runtime; 3, test runing count. ICUNIT_GOTO_EQUAL(g_testCount, 3, g_testCount, EXIT); // 3, Here, assert that g_testCount is equal to 3. ret = LOS_QueueDelete(g_testQueueID01); ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret); EXIT: LOS_TaskDelete(g_testTaskID01); ret = LOS_HwiDelete(HWI_NUM_TEST, NULL); ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret); LOS_QueueDelete(g_testQueueID01); return LOS_OK; } VOID ItSmpLosQueue012(VOID) // IT_Layer_ModuleORFeature_No { TEST_ADD_CASE("ItSmpLosQueue012", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL2, TEST_FUNCTION); } #ifdef __cplusplus #if __cplusplus } #endif /* __cpluscplus */ #endif /* __cpluscplus */