• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*
2  * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
3  * Copyright (c) 2020-2021 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 
33 #include "osTest.h"
34 #include "It_los_event.h"
35 
TaskF01(VOID)36 static VOID TaskF01(VOID)
37 {
38     UINT32 ret;
39 
40     g_testCount++;
41 
42     ret = LOS_EventRead(&g_pevent, 0xFFFFFFFF, LOS_WAITMODE_AND, LOS_WAIT_FOREVER);
43     ICUNIT_GOTO_EQUAL(ret, LOS_ERRNO_EVENT_SETBIT_INVALID, ret, EXIT);
44     ICUNIT_GOTO_EQUAL(g_testCount, 1, g_testCount, EXIT);
45 
46     g_testCount++;
47 
48 EXIT:
49     LOS_TaskDelete(g_testTaskID01);
50     return;
51 }
52 
Testcase(VOID)53 static UINT32 Testcase(VOID)
54 {
55     UINT32 ret;
56     TSK_INIT_PARAM_S task1;
57     (void)memset_s(&task1, sizeof(TSK_INIT_PARAM_S), 0, sizeof(TSK_INIT_PARAM_S));
58     task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
59     task1.pcName = "EventTsk4";
60     task1.uwStackSize = TASK_STACK_SIZE_TEST;
61     task1.usTaskPrio = TASK_PRIO_TEST - 2; // 2, set new task priority, it is higher than the test task.
62     task1.uwResved = LOS_TASK_STATUS_DETACHED;
63 
64     g_testCount = 0;
65 
66     g_pevent.uwEventID = 0;
67     LOS_EventInit(&g_pevent);
68 
69     ret = LOS_TaskCreate(&g_testTaskID01, &task1);
70     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
71     ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT); // 2, Here, assert that g_testCount is equal to 2.
72 
73     g_testCount++;
74 
75     ret = LOS_EventWrite(&g_pevent, 0xFFFFFFFF);
76     ICUNIT_GOTO_EQUAL(ret, LOS_ERRNO_EVENT_SETBIT_INVALID, ret, EXIT1);
77     ICUNIT_GOTO_EQUAL(g_testCount, 3, g_testCount, EXIT1); // 3, Here, assert that g_testCount is equal to 3.
78 
79 EXIT1:
80 
81     ret = LOS_EventClear(&g_pevent, 0);
82     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
83 
84     ret = LOS_EventDestroy(&g_pevent);
85     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
86 
87 EXIT:
88     LOS_TaskDelete(g_testTaskID01);
89     return LOS_OK;
90 }
91 
ItLosEvent004(VOID)92 VOID ItLosEvent004(VOID)
93 {
94     TEST_ADD_CASE("ItLosEvent004", Testcase, TEST_LOS, TEST_EVENT, TEST_LEVEL1, TEST_FUNCTION);
95 }
96