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_mem.h"
34
35
36 #define LOOP_NUM 500
37
TestCase(VOID)38 static UINT32 TestCase(VOID)
39 {
40 UINT32 ret;
41 void *p0 = NULL;
42 void *f0 = NULL;
43 UINT32 size;
44 int count;
45 int i, j, k;
46 int sizeadd;
47
48 MemInit();
49
50 for (count = 0; count < LOOP_NUM; count++) {
51 i = 0;
52 sizeadd = 4; // 4, init sizeadd.
53 size = 1 << sizeadd;
54 for (p0 = LOS_MemAlloc(g_memPool, size), f0 = p0; p0 != NULL; i++) {
55 if ((sizeadd += 1) == 9) { // 9, the limit of sizeadd.
56 sizeadd = 4; // 4, set 4 to sizeadd.
57 }
58 size = 1 << sizeadd;
59 p0 = LOS_MemAlloc(g_memPool, size);
60 }
61
62 if (MemGetFreeSize(g_memPool) >= (size + LOS_DLNK_NODE_HEAD_SIZE)) {
63 ICUNIT_GOTO_EQUAL(1, 0, i, EXIT);
64 }
65
66 sizeadd = 4; // 4, set 4 to sizeadd.
67 size = 1 << sizeadd;
68 for (j = 0; j < i; j++) {
69 ret = LOS_MemFree(g_memPool, f0);
70 f0 = (void *)((char *)f0 + ((UINT32)size + LOS_DLNK_NODE_HEAD_SIZE));
71
72 if ((sizeadd += 1) == 9) { // 9, the limit of sizeadd.
73 sizeadd = 4; // 4, set 4 to sizeadd.
74 }
75
76 size = 1 << sizeadd;
77
78 if (ret != LOS_OK) {
79 ICUNIT_GOTO_EQUAL(1, 0, j, EXIT);
80 }
81 }
82 }
83
84 for (count = 0; count < LOOP_NUM; count++) {
85 i = 0;
86 sizeadd = 4; // 4, set 4 to sizeadd.
87 size = 1 << sizeadd;
88 for (p0 = LOS_MemAlloc(g_memPool, size); p0 != NULL; i++) {
89 f0 = p0;
90 if ((sizeadd += 1) == 9) { // 9, the limit of sizeadd.
91 sizeadd = 4; // 4, set 4 to sizeadd.
92 }
93 size = 1 << sizeadd;
94 p0 = LOS_MemAlloc(g_memPool, size);
95 }
96
97 if (MemGetFreeSize(g_memPool) >= (size + LOS_DLNK_NODE_HEAD_SIZE)) {
98 ICUNIT_GOTO_EQUAL(1, 0, i, EXIT);
99 }
100
101 if (sizeadd == 4) { // 4, when sizeadd == 4, set 8 to sizeadd.
102 sizeadd = 8; // 8, set 8 to sizeadd.
103 size = 1 << sizeadd;
104 } else {
105 sizeadd--;
106 size = 1 << sizeadd;
107 }
108
109 for (j = 0; j < i; j++) {
110 ret = LOS_MemFree(g_memPool, f0);
111
112 if ((sizeadd -= 1) == 3) { // 3, when (sizeadd -= 1) == 3, set 8 to sizeadd.
113 sizeadd = 8; // 8, set 8 to sizeadd.
114 }
115
116 size = 1 << sizeadd;
117 f0 = (void *)((char *)f0 - ((UINT32)size + LOS_DLNK_NODE_HEAD_SIZE));
118
119 if (ret != LOS_OK) {
120 ICUNIT_GOTO_EQUAL(1, 0, j, EXIT);
121 }
122 }
123 }
124
125 for (count = 0; count < LOOP_NUM; count++) {
126 i = 0;
127 sizeadd = 4; // 4, set 4 to sizeadd.
128 size = 1 << sizeadd;
129 for (p0 = LOS_MemAlloc(g_memPool, size), f0 = p0; p0 != NULL; i++) {
130 if ((sizeadd += 1) == 9) { // 9, the limit of sizeadd.
131 sizeadd = 4; // 4, set 4 to sizeadd.
132 }
133 size = 1 << sizeadd;
134 p0 = LOS_MemAlloc(g_memPool, size);
135 }
136
137 if (MemGetFreeSize(g_memPool) >= (size + LOS_DLNK_NODE_HEAD_SIZE)) {
138 ICUNIT_GOTO_EQUAL(1, 0, i, EXIT);
139 }
140
141 p0 = f0;
142 sizeadd = 4; // 4, set 4 to sizeadd.
143 size = 1 << sizeadd;
144 k = 0;
145 for (j = 0; j < i; j++) {
146 if (!(k % 2)) { // 2, judge k is even number or not.
147 ret = LOS_MemFree(g_memPool, f0);
148 }
149
150 f0 = (void *)((char *)f0 + ((UINT32)size + LOS_DLNK_NODE_HEAD_SIZE));
151 if ((sizeadd += 1) == 9) { // 9, the limit of sizeadd.
152 sizeadd = 4; // 4, set 4 to sizeadd.
153 }
154
155 size = 1 << sizeadd;
156
157 if ((k += 1) == 5) { // 5, judge k
158 k = 0;
159 }
160
161 if (ret != LOS_OK) {
162 ICUNIT_GOTO_EQUAL(1, 0, j, EXIT);
163 }
164 }
165
166 f0 = p0;
167 sizeadd = 4; // 4, set 4 to sizeadd.
168 size = 1 << sizeadd;
169 k = 0;
170 for (j = 0; j < i; j++) {
171 if ((k % 2)) { // 2, judge k is odd number or not.
172 ret = LOS_MemFree(g_memPool, f0);
173 }
174
175 f0 = (void *)((char *)f0 + ((UINT32)size + LOS_DLNK_NODE_HEAD_SIZE));
176 if ((sizeadd += 1) == 9) { // 9, the limit of sizeadd.
177 sizeadd = 4; // 4, set 4 to sizeadd.
178 }
179
180 size = 1 << sizeadd;
181
182 if ((k += 1) == 5) { // 5, judge k
183 k = 0;
184 }
185
186 if (ret != LOS_OK) {
187 ICUNIT_GOTO_EQUAL(1, 0, j, EXIT);
188 }
189 }
190 }
191
192 EXIT:
193 MemFree();
194 return LOS_OK;
195 }
196
ItLosMem036(void)197 VOID ItLosMem036(void)
198 {
199 TEST_ADD_CASE("ItLosMem036", TestCase, TEST_LOS, TEST_MEM, TEST_LEVEL3, TEST_PRESSURE);
200 }
201
202