diff options
Diffstat (limited to 'test/rt/testheap.c')
| -rw-r--r-- | test/rt/testheap.c | 159 |
1 files changed, 0 insertions, 159 deletions
diff --git a/test/rt/testheap.c b/test/rt/testheap.c deleted file mode 100644 index 4a8eeb063..000000000 --- a/test/rt/testheap.c +++ /dev/null @@ -1,159 +0,0 @@ -/*
- ChibiOS - Copyright (C) 2006..2016 Giovanni Di Sirio
-
- Licensed under the Apache License, Version 2.0 (the "License");
- you may not use this file except in compliance with the License.
- You may obtain a copy of the License at
-
- http://www.apache.org/licenses/LICENSE-2.0
-
- Unless required by applicable law or agreed to in writing, software
- distributed under the License is distributed on an "AS IS" BASIS,
- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- See the License for the specific language governing permissions and
- limitations under the License.
-*/
-
-#include "ch.h"
-#include "test.h"
-
-/**
- * @page test_heap Memory Heap test
- *
- * File: @ref testheap.c
- *
- * <h2>Description</h2>
- * This module implements the test sequence for the @ref heaps subsystem.
- *
- * <h2>Objective</h2>
- * Objective of the test module is to cover 100% of the @ref heaps subsystem.
- *
- * <h2>Preconditions</h2>
- * The module requires the following kernel options:
- * - @p CH_CFG_USE_HEAP
- * .
- * In case some of the required options are not enabled then some or all tests
- * may be skipped.
- *
- * <h2>Test Cases</h2>
- * - @subpage test_heap_001
- * .
- * @file testheap.c
- * @brief Heap test source file
- * @file testheap.h
- * @brief Heap header file
- */
-
-#if CH_CFG_USE_HEAP || defined(__DOXYGEN__)
-
-#define SIZE 16
-
-static memory_heap_t test_heap;
-
-/**
- * @page test_heap_001 Allocation and fragmentation test
- *
- * <h2>Description</h2>
- * Series of allocations/deallocations are performed in carefully designed
- * sequences in order to stimulate all the possible code paths inside the
- * allocator.<br>
- * The test expects to find the heap back to the initial status after each
- * sequence.
- */
-
-static void heap1_setup(void) {
-
- chHeapObjectInit(&test_heap, test.buffer, sizeof(union test_buffers));
-}
-
-static void heap1_execute(void) {
- void *p1, *p2, *p3;
- size_t n, sz;
-
- /* Unrelated, for coverage only.*/
- (void)chCoreGetStatusX();
-
- /*
- * Test on the default heap in order to cover the core allocator at
- * least one time.
- */
- (void)chHeapStatus(NULL, &sz, NULL);
- p1 = chHeapAlloc(NULL, SIZE);
- test_assert(1, p1 != NULL, "allocation failed");
- chHeapFree(p1);
- p1 = chHeapAlloc(NULL, (size_t)-256);
- test_assert(2, p1 == NULL, "allocation not failed");
-
- /* Initial local heap state.*/
- (void)chHeapStatus(&test_heap, &sz, NULL);
-
- /* Same order.*/
- p1 = chHeapAlloc(&test_heap, SIZE);
- p2 = chHeapAlloc(&test_heap, SIZE);
- p3 = chHeapAlloc(&test_heap, SIZE);
- chHeapFree(p1); /* Does not merge.*/
- chHeapFree(p2); /* Merges backward.*/
- chHeapFree(p3); /* Merges both sides.*/
- test_assert(3, chHeapStatus(&test_heap, &n, NULL) == 1, "heap fragmented");
-
- /* Reverse order.*/
- p1 = chHeapAlloc(&test_heap, SIZE);
- p2 = chHeapAlloc(&test_heap, SIZE);
- p3 = chHeapAlloc(&test_heap, SIZE);
- chHeapFree(p3); /* Merges forward.*/
- chHeapFree(p2); /* Merges forward.*/
- chHeapFree(p1); /* Merges forward.*/
- test_assert(4, chHeapStatus(&test_heap, &n, NULL) == 1, "heap fragmented");
-
- /* Small fragments handling.*/
- p1 = chHeapAlloc(&test_heap, SIZE + 1);
- p2 = chHeapAlloc(&test_heap, SIZE);
- chHeapFree(p1);
- test_assert(5, chHeapStatus(&test_heap, &n, NULL) == 2, "invalid state");
- p1 = chHeapAlloc(&test_heap, SIZE);
- /* Note, the first situation happens when the alignment size is smaller
- than the header size, the second in the other cases.*/
- test_assert(6, (chHeapStatus(&test_heap, &n, NULL) == 1) ||
- (chHeapStatus(&test_heap, &n, NULL) == 2), "heap fragmented");
- chHeapFree(p2);
- chHeapFree(p1);
- test_assert(7, chHeapStatus(&test_heap, &n, NULL) == 1, "heap fragmented");
-
- /* Skip fragment handling.*/
- p1 = chHeapAlloc(&test_heap, SIZE);
- p2 = chHeapAlloc(&test_heap, SIZE);
- chHeapFree(p1);
- test_assert(8, chHeapStatus(&test_heap, &n, NULL) == 2, "invalid state");
- p1 = chHeapAlloc(&test_heap, SIZE * 2); /* Skips first fragment.*/
- chHeapFree(p1);
- chHeapFree(p2);
- test_assert(9, chHeapStatus(&test_heap, &n, NULL) == 1, "heap fragmented");
-
- /* Allocate all handling.*/
- (void)chHeapStatus(&test_heap, &n, NULL);
- p1 = chHeapAlloc(&test_heap, n);
- test_assert(10, chHeapStatus(&test_heap, &n, NULL) == 0, "not empty");
- chHeapFree(p1);
-
- test_assert(11, chHeapStatus(&test_heap, &n, NULL) == 1, "heap fragmented");
- test_assert(12, n == sz, "size changed");
-}
-
-ROMCONST struct testcase testheap1 = {
- "Heap, allocation and fragmentation test",
- heap1_setup,
- NULL,
- heap1_execute
-};
-
-#endif /* CH_CFG_USE_HEAP.*/
-
-/**
- * @brief Test sequence for heap.
- */
-ROMCONST struct testcase * ROMCONST patternheap[] = {
-#if CH_CFG_USE_HEAP || defined(__DOXYGEN__)
- &testheap1,
-#endif
- NULL
-};
|