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 buff2[QUEUE_SHORT_BUFFER_LENGTH] = "";
39
40 g_testCount++;
41
42 ret = LOS_QueueRead(g_testQueueID01, &buff2, QUEUE_BASE_MSGSIZE, 0);
43 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
44
45 g_testCount++;
46
47 EXIT:
48 LOS_TaskDelete(g_testTaskID01);
49 }
50
51
Testcase(VOID)52 static UINT32 Testcase(VOID)
53 {
54 UINT32 ret;
55 CHAR buff1[8] = "UniDSP";
56
57 TSK_INIT_PARAM_S task1 = { 0 };
58 task1.pfnTaskEntry = (TSK_ENTRY_FUNC)TaskF01;
59 task1.pcName = "TskName40";
60 task1.uwStackSize = TASK_STACK_SIZE_TEST;
61 task1.usTaskPrio = 23; // 23, Set the priority according to the task purpose,a smaller number means a higher priority.
62
63 g_testCount = 0;
64
65 ret = LOS_QueueCreate("Q1", QUEUE_BASE_NUM, &g_testQueueID01, 0, QUEUE_BASE_MSGSIZE);
66 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
67
68 ret = LOS_QueueWrite(g_testQueueID01, &buff1, QUEUE_BASE_MSGSIZE, 0);
69 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
70
71 ret = LOS_TaskCreate(&g_testTaskID01, &task1);
72 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
73
74 ICUNIT_GOTO_EQUAL(g_testCount, 2, g_testCount, EXIT); // Compare wiht the expected value 2.
75
76 ret = LOS_QueueDelete(g_testQueueID01);
77 ICUNIT_ASSERT_EQUAL(ret, LOS_OK, ret);
78
79 return LOS_OK;
80 EXIT:
81 LOS_TaskDelete(g_testTaskID01);
82 LOS_QueueDelete(g_testQueueID01);
83 return LOS_OK;
84 }
85
ItLosQueue040(VOID)86 VOID ItLosQueue040(VOID)
87 {
88 TEST_ADD_CASE("ItLosQueue040", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL1, TEST_FUNCTION);
89 }
90
91