• 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 static UINT32 g_actMuxUsedcnt = 0;
38 
TaskF02(void)39 static VOID TaskF02(void)
40 {
41     UINT32 ret;
42     UINT32 i;
43     UINT32 index;
44 
45     for (index = 0; index < g_actMuxUsedcnt; index++) {
46         for (i = 0; i < IT_SEMLOOP; i++) {
47             ret = LOS_SemPost(g_usSemID3[index]);
48             ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
49         }
50     }
51 
52     g_testCount++;
53     LOS_TaskDelete(g_testTaskID02);
54 }
55 
TaskF01(void)56 static VOID TaskF01(void)
57 {
58     UINT32 ret;
59     UINT32 i;
60     UINT32 index;
61 
62     for (index = 0; index < g_actMuxUsedcnt; index++) {
63         for (i = 0; i < IT_SEMLOOP; i++) {
64             ret = LOS_SemPost(g_usSemID3[index]);
65             ICUNIT_ASSERT_EQUAL_VOID(ret, LOS_OK, ret);
66         }
67     }
68 
69     g_testCount++;
70     LOS_TaskDelete(g_testTaskID01);
71 }
72 
Testcase(VOID)73 static UINT32 Testcase(VOID)
74 {
75     UINT32 ret;
76     UINT32 loop;
77     UINT32 index;
78     TSK_INIT_PARAM_S task = { 0 };
79 
80     LosSemCB *semNode = NULL;
81 
82     UINT32 osMuxUsedcnt = 0;
83 
84     for (loop = 0; loop < LOSCFG_BASE_IPC_SEM_LIMIT; loop++) {
85         semNode = g_allSem + loop;
86         if (semNode->semStat == OS_SEM_USED) {
87             osMuxUsedcnt++;
88         }
89     }
90 
91     g_actMuxUsedcnt = LOSCFG_BASE_IPC_SEM_LIMIT - osMuxUsedcnt;
92 
93     for (loop = 0; loop < IT_SEMLOOP; loop++) {
94         task.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
95         task.pcName = "SemTsk5";
96         task.uwStackSize = TASK_STACK_SIZE_TEST;
97         task.usTaskPrio = TASK_PRIO_TEST - 2; // 2, set new task priority, it is higher than the current task.
98 
99         g_testCount = 0;
100 
101         for (index = 0; index < g_actMuxUsedcnt; index++) {
102             ret = LOS_SemCreate(0, &g_usSemID3[index]);
103             ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
104         }
105 
106         ret = LOS_TaskCreate(&g_testTaskID01, &task);
107         ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
108 
109         ICUNIT_GOTO_EQUAL(g_testCount, 1, g_testCount, EXIT);
110         g_testCount++;
111 
112         task.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF02;
113         task.pcName = "SemTsk5_1";
114         task.usTaskPrio = TASK_PRIO_TEST - 1;
115         ret = LOS_TaskCreate(&g_testTaskID02, &task);
116         ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
117 
118         ICUNIT_GOTO_EQUAL(g_testCount, 3, g_testCount, EXIT); // 3, Here, assert that g_testCount is equal to 3.
119 
120     EXIT:
121         for (index = 0; index < g_actMuxUsedcnt; index++) {
122             ret = LOS_SemDelete(g_usSemID3[index]);
123             ICUNIT_TRACK_EQUAL(ret, LOS_OK, ret);
124         }
125     }
126 
127     return LOS_OK;
128 }
129 
ItLosSem039(void)130 VOID ItLosSem039(void)
131 {
132     TEST_ADD_CASE("ItLosSem039", Testcase, TEST_LOS, TEST_SEM, TEST_LEVEL2, TEST_PRESSURE);
133 }
134 
135