• 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 
34 
TaskF01(VOID)35 static VOID TaskF01(VOID)
36 {
37     UINT32 ret;
38     CHAR buff1[QUEUE_SHORT_BUFFER_LENGTH] = "UniDSP";
39     g_testCount++;
40 
41     ret = LOS_QueueWrite(g_testQueueID01, &buff1, QUEUE_BASE_MSGSIZE, 100); // 100, Set the timeout time
42     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
43 
44     g_testCount++;
45 
46 EXIT:
47     LOS_TaskDelete(g_testTaskID01);
48 }
49 
TaskF02(VOID)50 static VOID TaskF02(VOID)
51 {
52     UINT32 ret;
53     CHAR buff2[QUEUE_SHORT_BUFFER_LENGTH] = "";
54 
55     g_testCount++;
56 
57     ret = LOS_QueueRead(g_testQueueID01, &buff2, QUEUE_BASE_MSGSIZE, 0);
58     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
59 
60     g_testCount++;
61 
62 EXIT:
63     LOS_TaskDelete(g_testTaskID02);
64 }
Testcase(VOID)65 static UINT32 Testcase(VOID)
66 {
67     UINT32 ret;
68     CHAR buff1[8] = "UniDSP";
69 
70     TSK_INIT_PARAM_S task1 = { 0 };
71     TSK_INIT_PARAM_S task2 = { 0 };
72 
73     task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
74     task1.pcName = "TskName1";
75     task1.uwStackSize = TASK_STACK_SIZE_TEST;
76     task1.usTaskPrio = 22; // 22, Set the priority according to the task purpose,a smaller number means a higher priority.
77 
78     task2.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF02;
79     task2.pcName = "TskName2";
80     task2.uwStackSize = TASK_STACK_SIZE_TEST;
81     task2.usTaskPrio = 21; // 21, Set the priority according to the task purpose,a smaller number means a higher priority.
82 
83     g_testCount = 0;
84     ret = LOS_QueueCreate("Q1", 1, &g_testQueueID01, 0, QUEUE_BASE_MSGSIZE);
85     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
86 
87     ret = LOS_QueueWrite(g_testQueueID01, &buff1, QUEUE_BASE_MSGSIZE, 100); // 100, Set the timeout time
88     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
89 
90     ret = LOS_TaskCreate(&g_testTaskID01, &task1);
91     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
92 
93     ICUNIT_GOTO_EQUAL(g_testCount, 1, g_testCount, EXIT);
94     g_testCount++;
95 
96     ret = LOS_TaskCreate(&g_testTaskID02, &task2);
97     ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
98 
99     ICUNIT_GOTO_EQUAL(g_testCount, 5, g_testCount, EXIT); // Compare wiht the expected value 5.
100 
101     ret = LOS_QueueDelete(g_testQueueID01);
102     ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
103 
104     return LOS_OK;
105 
106 EXIT:
107     LOS_TaskDelete(g_testTaskID01);
108     LOS_QueueDelete(g_testQueueID02);
109     LOS_QueueDelete(g_testQueueID01);
110     return LOS_OK;
111 }
112 
ItLosQueue043(VOID)113 VOID ItLosQueue043(VOID)
114 {
115     TEST_ADD_CASE("ItLosQueue043", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL1, TEST_FUNCTION);
116 }
117 
118