• 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 #include "osTest.h"
33 #include "It_los_sem.h"
34 
35 
36 #define IT_SEMLOOP 5
37 
TaskF03(void)38 static VOID TaskF03(void)
39 {
40     UINT32 ret;
41     UINT32 i;
42 
43     ret = LOS_SemPend(g_usSemID, LOS_WAIT_FOREVER);
44     ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
45 
46     for (i = 0; i < IT_SEMLOOP; i++) {
47         ret = LOS_SemPost(g_usSemID);
48         ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
49 
50         ret = LOS_SemPend(g_usSemID, LOS_WAIT_FOREVER);
51         ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
52     }
53     LOS_TaskDelete(g_testTaskID03);
54 }
55 
TaskF02(void)56 static VOID TaskF02(void)
57 {
58     UINT32 ret;
59     UINT32 i;
60 
61     ret = LOS_SemPend(g_usSemID, LOS_WAIT_FOREVER);
62     ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
63 
64     for (i = 0; i < IT_SEMLOOP; i++) {
65         ret = LOS_SemPost(g_usSemID);
66         ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
67 
68         ret = LOS_SemPend(g_usSemID, LOS_WAIT_FOREVER);
69         ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
70     }
71     LOS_TaskDelete(g_testTaskID02);
72 }
73 
TaskF01(void)74 static VOID TaskF01(void)
75 {
76     UINT32 ret;
77     UINT32 i;
78 
79     ret = LOS_SemPend(g_usSemID, LOS_WAIT_FOREVER);
80     ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
81 
82     for (i = 0; i < IT_SEMLOOP; i++) {
83         ret = LOS_SemPost(g_usSemID);
84         ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
85 
86         ret = LOS_SemPend(g_usSemID, LOS_WAIT_FOREVER);
87         ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
88     }
89     LOS_TaskDelete(g_testTaskID01);
90 }
91 
Testcase(VOID)92 static UINT32 Testcase(VOID)
93 {
94     UINT32 ret;
95     TSK_INIT_PARAM_S task = { 0 };
96 
97     task.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
98     task.pcName = "SemTsk2";
99     task.uwStackSize = TASK_STACK_SIZE_TEST;
100     task.usTaskPrio = TASK_PRIO_TEST - 1;
101 
102     ret = LOS_SemCreate(0, &g_usSemID);
103     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
104 
105     ret = LOS_TaskCreate(&g_testTaskID01, &task);
106     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
107 
108     task.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF02;
109     task.pcName = "SemTsk2_1";
110     task.usTaskPrio = TASK_PRIO_TEST - 2; // 2, set new task priority, it is higher than the current task.
111     ret = LOS_TaskCreate(&g_testTaskID02, &task);
112     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT2);
113 
114     task.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF03;
115     task.pcName = "SemTsk2_2";
116     task.usTaskPrio = TASK_PRIO_TEST - 3; // 3, set new task priority, it is higher than the current task.
117     ret = LOS_TaskCreate(&g_testTaskID03, &task);
118     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT3);
119 
120     ret = LOS_SemPost(g_usSemID);
121     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT4);
122 
123     ret = LOS_SemPost(g_usSemID);
124     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT4);
125 
126     ret = LOS_SemPost(g_usSemID);
127     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT4);
128 
129 EXIT:
130     ret = LOS_SemDelete(g_usSemID);
131     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
132 
133     return LOS_OK;
134 EXIT4:
135     LOS_TaskDelete(g_testTaskID03);
136 EXIT3:
137     LOS_TaskDelete(g_testTaskID02);
138 EXIT2:
139     LOS_TaskDelete(g_testTaskID01);
140 
141     ret = LOS_SemDelete(g_usSemID);
142     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
143 
144     return LOS_OK;
145 }
146 
ItLosSem036(void)147 VOID ItLosSem036(void)
148 {
149     TEST_ADD_CASE("ItLosSem036", Testcase, TEST_LOS, TEST_SEM, TEST_LEVEL2, TEST_PRESSURE);
150 }
151 
152