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
35
Testcase(VOID)36 static UINT32 Testcase(VOID)
37 {
38 UINT32 ret;
39 UINT32 swTmrID;
40 CHAR buff1[QUEUE_SHORT_BUFFER_LENGTH] = "UniDSP";
41 CHAR buff2[QUEUE_SHORT_BUFFER_LENGTH];
42
43 ret = LOS_QueueCreate("Q1", QUEUE_BASE_NUM, &swTmrID, 0, QUEUE_SHORT_BUFFER_LENGTH);
44 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
45
46 ret = LOS_QueueWriteCopy(swTmrID, &buff1, QUEUE_SHORT_BUFFER_LENGTH, 0xffffffff);
47 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
48
49 (void)memset_s(buff2, QUEUE_SHORT_BUFFER_LENGTH, 0, QUEUE_SHORT_BUFFER_LENGTH);
50 ret = LOS_QueueRead(swTmrID, &buff2, QUEUE_SHORT_BUFFER_LENGTH, 0);
51 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
52
53 ret = LOS_QueueWriteCopy(swTmrID, &buff1, QUEUE_SHORT_BUFFER_LENGTH, 0xffffffff + 1);
54 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
55
56 (void)memset_s(buff2, QUEUE_SHORT_BUFFER_LENGTH, 0, QUEUE_SHORT_BUFFER_LENGTH);
57 ret = LOS_QueueRead(swTmrID, &buff2, QUEUE_SHORT_BUFFER_LENGTH, 0);
58 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
59
60 ret = LOS_QueueWriteCopy(swTmrID, &buff1, QUEUE_SHORT_BUFFER_LENGTH, 0xffffffff - 1);
61 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
62
63 (void)memset_s(buff2, QUEUE_SHORT_BUFFER_LENGTH, 0, QUEUE_SHORT_BUFFER_LENGTH);
64 ret = LOS_QueueRead(swTmrID, &buff2, QUEUE_SHORT_BUFFER_LENGTH, 0);
65 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
66
67 ret = LOS_QueueDelete(swTmrID);
68 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
69
70 return LOS_OK;
71
72 EXIT:
73 LOS_QueueDelete(swTmrID);
74 return LOS_OK;
75 }
76
ItLosQueue107(VOID)77 VOID ItLosQueue107(VOID)
78 {
79 TEST_ADD_CASE("ItLosQueue107", Testcase, TEST_LOS, TEST_QUE, TEST_LEVEL0, TEST_FUNCTION);
80 }
81
82