• 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 "It_los_queue.h"
33 #include "los_membox.h"
34 
35 #define LOS_MEMBOX_MAGIC_SIZE 4
36 static UINT32 g_uwQueueID122 = 0;
37 static unsigned char g_aucMailBoxPool[40 + LOS_MEMBOX_MAGIC_SIZE] = {0};
38 static BOOL  g_bTaskFinish1 = FALSE;
39 static BOOL  g_bTaskFinish2 = FALSE;
40 
41 
StTaskAllocWait(VOID)42 static VOID StTaskAllocWait(VOID)
43 {
44     UINT32 ret;
45     VOID *memBox = NULL;
46 
47     memBox = OsQueueMailAlloc(g_uwQueueID122, (VOID *)g_aucMailBoxPool, 20); // 20, set timeout
48     ICUNIT_GOTO_EQUAL(memBox, NULL, memBox, EXIT);
49 
50     memBox = OsQueueMailAlloc(g_uwQueueID122, (VOID *)g_aucMailBoxPool, 50); // 50, set timeout
51     ICUNIT_GOTO_NOT_EQUAL(memBox, NULL, memBox, EXIT);
52 
53     ret = OsQueueMailFree(g_uwQueueID122, (VOID *)g_aucMailBoxPool, memBox);
54     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
55 
56 EXIT:
57     g_bTaskFinish1 = TRUE;
58     return;
59 }
60 
61 
StTaskAllocNoWait(VOID)62 static VOID StTaskAllocNoWait(VOID)
63 {
64     VOID *memBox = NULL;
65 
66     memBox = OsQueueMailAlloc(g_uwQueueID122, (VOID *)g_aucMailBoxPool, LOS_NO_WAIT);
67     ICUNIT_GOTO_EQUAL(memBox, NULL, memBox, EXIT);
68 
69 EXIT:
70     g_bTaskFinish2 = TRUE;
71     return;
72 }
73 
74 
Testcase(VOID)75 static UINT32 Testcase(VOID)
76 {
77     UINT32 ret;
78     TSK_INIT_PARAM_S task1221 = {0};
79     TSK_INIT_PARAM_S task1222 = {0};
80     UINT32 taskID1221, taskID1222;
81     QUEUE_INFO_S queueInfo;
82     VOID *memBox = NULL;
83 
84     task1221.pfnTaskEntry = (TSK_ENTRY_FUNC)StTaskAllocWait;
85     task1221.pcName       = "TskName122_1";
86     task1221.uwStackSize  = TASK_STACK_SIZE_TEST;
87     task1221.usTaskPrio   = 23; // 23, Set the priority according to the task purpose,a smaller number means a higher priority.
88     task1221.uwResved     = LOS_TASK_STATUS_DETACHED;
89 
90     task1222.pfnTaskEntry = (TSK_ENTRY_FUNC)StTaskAllocNoWait;
91     task1222.pcName       = "TskName122_2";
92     task1222.uwStackSize  = TASK_STACK_SIZE_TEST;
93     task1222.usTaskPrio   = 23; // 23, Set the priority according to the task purpose,a smaller number means a higher priority.
94     task1222.uwResved     = LOS_TASK_STATUS_DETACHED;
95 
96     ret = LOS_QueueCreate("Q122", 1, &g_uwQueueID122, 0, QUEUE_BASE_MSGSIZE);
97     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
98 
99     ret = LOS_MemboxInit((VOID *)g_aucMailBoxPool, sizeof(g_aucMailBoxPool) * 2, sizeof(g_aucMailBoxPool));
100     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
101 
102     memBox = OsQueueMailAlloc(g_uwQueueID122, (VOID *)g_aucMailBoxPool, LOS_NO_WAIT);
103     ICUNIT_GOTO_NOT_EQUAL(memBox, NULL, memBox, EXIT);
104 
105     ret = LOS_TaskCreate(&taskID1221, &task1221);
106     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
107 
108     ret = LOS_TaskCreate(&taskID1222, &task1222);
109     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
110 
111     /* make sure the first OsQueueMailAlloc is failed of task1 and task2. */
112     LOS_TaskDelay(10); // 10, set delay time
113 
114     ret = LOS_QueueInfoGet(g_uwQueueID122, &queueInfo);
115     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
116 
117     ret = LOS_QueueDelete(g_uwQueueID122);
118     ICUNIT_ASSERT_EQUAL(ret, LOS_ERRNO_QUEUE_IN_TSKUSE, ret);
119 
120     LOS_TaskDelay(20); // 20, set delay time
121 
122     ret = OsQueueMailFree(g_uwQueueID122, (VOID *)g_aucMailBoxPool, memBox);
123     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
124 
125     /* keep waitting until task1 and task2 exit. */
126     while (!(g_bTaskFinish1 && g_bTaskFinish2)) {
127         LOS_TaskDelay(5); // 5, set delay time
128     }
129 
130 EXIT:
131     ret = LOS_QueueDelete(g_uwQueueID122);
132     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
133 
134     return LOS_OK;
135 }
136 
LltLosQueue003(VOID)137 VOID LltLosQueue003(VOID)
138 {
139     TEST_ADD_CASE("LltLosQueue003", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL1, TEST_FUNCTION);
140 }
141