• 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 
36 #define QUEUE_MAX_LEN 10
37 #define QUEUE_MAX_NODE_SIZE 10
38 
39 extern UINT32 g_usSemID;
40 extern UINT32 g_testQueueID01;
41 
SwtmrF01(VOID)42 static VOID SwtmrF01(VOID)
43 {
44     UINT32 ret;
45     UINT32 eventMask;
46 
47     eventMask = 0x1;
48     eventMask = eventMask << g_testCount;
49 
50     ret = LOS_EventWrite(&g_pevent, eventMask);
51     ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
52 
53     g_testCount++;
54 }
55 
TaskF01(VOID)56 static VOID TaskF01(VOID)
57 {
58     UINT32 ret;
59     CHAR str[10];
60 
61     ret = LOS_EventRead(&g_pevent, 0x1, LOS_WAITMODE_AND, LOS_WAIT_FOREVER);
62     ICUNIT_GOTO_EQUAL(ret, 0x1, ret, EXIT);
63 
64     ret = LOS_QueueWrite(g_testQueueID01, str, QUEUE_MAX_NODE_SIZE, LOS_WAIT_FOREVER);
65     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT1);
66 
67     ret = LOS_QueueRead(g_testQueueID01, str, QUEUE_MAX_NODE_SIZE, LOS_WAIT_FOREVER);
68     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT1);
69 
70     ret = LOS_EventRead(&g_pevent, 0x2, LOS_WAITMODE_AND, LOS_WAIT_FOREVER);
71     ICUNIT_GOTO_EQUAL(ret, 0x2, ret, EXIT1);
72 
73     ret = LOS_SemPost(g_usSemID);
74     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT2);
75 
76     ret = LOS_SemPend(g_usSemID, LOS_WAIT_FOREVER);
77     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT2);
78 
79 EXIT2:
80     ret = LOS_SemDelete(g_usSemID);
81     ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
82 
83 EXIT1:
84     ret = LOS_QueueDelete(g_testQueueID01);
85     ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
86 
87 EXIT:
88     LOS_TaskDelete(g_testTaskID01);
89 
90     ret = LOS_EventClear(&g_pevent, 0);
91     ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
92 
93     ret = LOS_EventDestroy(&g_pevent);
94     ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
95 }
96 
Testcase(VOID)97 static UINT32 Testcase(VOID)
98 {
99     UINT32 ret;
100 
101     UINT32 swTmrID;
102 
103     TSK_INIT_PARAM_S task1;
104     (void)memset_s(&task1, sizeof(TSK_INIT_PARAM_S), 0, sizeof(TSK_INIT_PARAM_S));
105     task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
106     task1.pcName = "EventTsk28";
107     task1.uwStackSize = TASK_STACK_SIZE_TEST;
108     task1.usTaskPrio = TASK_PRIO_TEST - 2; // 2, set new task priority, it is higher than the test task.
109     task1.uwResved = LOS_TASK_STATUS_DETACHED;
110 
111     g_testCount = 0;
112 
113     ret = LOS_SemCreate(1, &g_usSemID);
114     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
115 
116     ret = LOS_QueueCreate("EventTsk28_Queue", QUEUE_MAX_LEN, &g_testQueueID01, 0, QUEUE_MAX_NODE_SIZE);
117     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT1);
118 
119 #if (LOSCFG_BASE_CORE_SWTMR_ALIGN == 1)
120     /* 4, Timeout interval of a periodic software timer. */
121     ret = LOS_SwtmrCreate(4, LOS_SWTMR_MODE_PERIOD, (SWTMR_PROC_FUNC)SwtmrF01, &swTmrID, 0xffff,
122         OS_SWTMR_ROUSES_ALLOW, OS_SWTMR_ALIGN_INSENSITIVE);
123 #else
124     ret = LOS_SwtmrCreate(4, LOS_SWTMR_MODE_PERIOD, (SWTMR_PROC_FUNC)SwtmrF01, &swTmrID, 0xffff); // 4, Timeout interval of a periodic software timer.
125 #endif
126     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT2);
127 
128     LOS_SwtmrStart(swTmrID);
129 
130     ret = LOS_TaskCreate(&g_testTaskID01, &task1);
131     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT3);
132 
133     LOS_TaskDelay(10); // 10, set delay time.
134 
135 EXIT3:
136     LOS_TaskDelete(g_testTaskID01);
137 
138 EXIT2:
139     ret = LOS_SwtmrDelete(swTmrID);
140     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
141 
142 EXIT1:
143     LOS_QueueDelete(g_testQueueID01);
144 
145 EXIT:
146     LOS_SemDelete(g_usSemID);
147     return LOS_OK;
148 }
149 
ItLosEvent028(VOID)150 VOID ItLosEvent028(VOID) // IT_Layer_ModuleORFeature_No
151 {
152     TEST_ADD_CASE("ItLosEvent028", Testcase, TEST_LOS, TEST_EVENT, TEST_LEVEL3, TEST_FUNCTION);
153 }
154