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
TestCase(VOID)36 static UINT32 TestCase(VOID)
37 {
38 UINT32 ret;
39 UINT32 size = 0x500;
40
41 void *p[(TEST_MEM_SIZE) / 0x500] = {NULL};
42 void *p0 = NULL;
43 int i = 0;
44
45 MemInit();
46
47 for (p0 = LOS_MemAlloc(g_memPool, size); p0 != NULL; i++) {
48 p[i] = p0;
49 p0 = LOS_MemAlloc(g_memPool, size);
50 }
51
52 if (MemGetFreeSize(g_memPool) >= (size + LOS_MEM_NODE_HEAD_SIZE + LOS_MEM_POOL_SIZE)) {
53 ICUNIT_GOTO_EQUAL(1, 0, i, EXIT);
54 }
55
56 ret = LOS_MemFree(g_memPool, p[i / 2]); // 2， release a memory node.
57 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
58
59 p0 = LOS_MemAlloc(g_memPool, size);
60 // 2, assert the point to new node is equal to the one has been released
61 ICUNIT_GOTO_EQUAL(p0, p[i / 2], p0, EXIT);
62
63 ret = LOS_MemFree(g_memPool, p0);
64 ICUNIT_GOTO_EQUAL(ret, LOS_OK, ret, EXIT);
65
66 EXIT:
67 MemFree();
68 return LOS_OK;
69 }
70
ItLosMem008(void)71 VOID ItLosMem008(void)
72 {
73 TEST_ADD_CASE("ItLosMem008", TestCase, TEST_LOS, TEST_MEM, TEST_LEVEL1, TEST_FUNCTION);
74 }
75
76