mirror of
https://github.com/eried/portapack-mayhem.git
synced 2024-12-11 00:34:29 -05:00
118 lines
3.1 KiB
C
Executable File
118 lines
3.1 KiB
C
Executable File
/*
|
|
ChibiOS/RT - Copyright (C) 2006-2013 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_pools Memory Pools test
|
|
*
|
|
* File: @ref testpools.c
|
|
*
|
|
* <h2>Description</h2>
|
|
* This module implements the test sequence for the @ref pools subsystem.
|
|
*
|
|
* <h2>Objective</h2>
|
|
* Objective of the test module is to cover 100% of the @ref pools code.
|
|
*
|
|
* <h2>Preconditions</h2>
|
|
* The module requires the following kernel options:
|
|
* - @p CH_USE_MEMPOOLS
|
|
* .
|
|
* In case some of the required options are not enabled then some or all tests
|
|
* may be skipped.
|
|
*
|
|
* <h2>Test Cases</h2>
|
|
* - @subpage test_pools_001
|
|
* .
|
|
* @file testpools.c
|
|
* @brief Memory Pools test source file
|
|
* @file testpools.h
|
|
* @brief Memory Pools test header file
|
|
*/
|
|
|
|
#if CH_USE_MEMPOOLS || defined(__DOXYGEN__)
|
|
|
|
static MEMORYPOOL_DECL(mp1, THD_WA_SIZE(THREADS_STACK_SIZE), NULL);
|
|
|
|
/**
|
|
* @page test_pools_001 Allocation and enqueuing test
|
|
*
|
|
* <h2>Description</h2>
|
|
* Five memory blocks are added to a memory pool then removed.<br>
|
|
* The test expects to find the pool queue in the proper status after each
|
|
* operation.
|
|
*/
|
|
|
|
static void *null_provider(size_t size) {
|
|
|
|
(void)size;
|
|
return NULL;
|
|
}
|
|
|
|
static void pools1_setup(void) {
|
|
|
|
chPoolInit(&mp1, THD_WA_SIZE(THREADS_STACK_SIZE), NULL);
|
|
}
|
|
|
|
static void pools1_execute(void) {
|
|
int i;
|
|
|
|
/* Adding the WAs to the pool.*/
|
|
chPoolLoadArray(&mp1, wa[0], MAX_THREADS);
|
|
|
|
/* Emptying the pool.*/
|
|
for (i = 0; i < MAX_THREADS; i++)
|
|
test_assert(1, chPoolAlloc(&mp1) != NULL, "list empty");
|
|
|
|
/* Now must be empty.*/
|
|
test_assert(2, chPoolAlloc(&mp1) == NULL, "list not empty");
|
|
|
|
/* Adding the WAs to the pool, one by one this time.*/
|
|
for (i = 0; i < MAX_THREADS; i++)
|
|
chPoolFree(&mp1, wa[i]);
|
|
|
|
/* Emptying the pool again.*/
|
|
for (i = 0; i < MAX_THREADS; i++)
|
|
test_assert(3, chPoolAlloc(&mp1) != NULL, "list empty");
|
|
|
|
/* Now must be empty again.*/
|
|
test_assert(4, chPoolAlloc(&mp1) == NULL, "list not empty");
|
|
|
|
/* Covering the case where a provider is unable to return more memory.*/
|
|
chPoolInit(&mp1, 16, null_provider);
|
|
test_assert(5, chPoolAlloc(&mp1) == NULL, "provider returned memory");
|
|
}
|
|
|
|
ROMCONST struct testcase testpools1 = {
|
|
"Memory Pools, queue/dequeue",
|
|
pools1_setup,
|
|
NULL,
|
|
pools1_execute
|
|
};
|
|
|
|
#endif /* CH_USE_MEMPOOLS */
|
|
|
|
/*
|
|
* @brief Test sequence for pools.
|
|
*/
|
|
ROMCONST struct testcase * ROMCONST patternpools[] = {
|
|
#if CH_USE_MEMPOOLS || defined(__DOXYGEN__)
|
|
&testpools1,
|
|
#endif
|
|
NULL
|
|
};
|