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_lms.h"
34
TestCase(VOID)35 static UINT32 TestCase(VOID)
36 {
37 #define PTR_NUM 100
38 #define SIZE_NUM 2
39 CHAR *str[PTR_NUM] = {NULL};
40 UINT32 size[SIZE_NUM] = {20, 10}; /* mem size 20, 10 */
41 UINT32 index;
42 UINT32 i, j, k;
43 UINT32 boundary;
44 for (k = 0; k < SIZE_NUM; k++) {
45 index = 0;
46 for (j = 0; j < 10; j++) { /* loop 10 times each size */
47 for (i = 2; i < 8; i++, index++) { /* boundary loop from 2 to 8 */
48 boundary = 1 << i;
49 PRINT_DEBUG("size = %d, boundary = %d\n", size[k], boundary);
50 str[index] = (char *)LOS_MemAllocAlign(m_aucSysMem0, size[k], boundary);
51 ICUNIT_GOTO_NOT_EQUAL(str[index], NULL, str[index], EXIT);
52 }
53 }
54 for (i = 0; i < index; i++) {
55 (VOID)LOS_MemFree(m_aucSysMem0, str[i]);
56 }
57 }
58
59 return LOS_OK;
60 EXIT:
61 for (i = 0; i < index; i++) {
62 (VOID)LOS_MemFree(m_aucSysMem0, str[i]);
63 }
64 return LOS_OK;
65 }
66
67 /* LmsTestMemAlignFree */
ItLosLms004(void)68 VOID ItLosLms004(void)
69 {
70 TEST_ADD_CASE("ItLosLms004", TestCase, TEST_LOS, TEST_LMS, TEST_LEVEL1, TEST_FUNCTION);
71 }
72
73