mirror of
https://salsa.debian.org/gnuk-team/gnuk/gnuk.git
synced 2024-09-21 19:30:08 +00:00
213 lines
23 KiB
HTML
213 lines
23 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
|
|
<title>ChibiOS/RT: testheap.c Source File</title>
|
|
<link href="custom.css" rel="stylesheet" type="text/css">
|
|
<link href="tabs.css" rel="stylesheet" type="text/css">
|
|
</head><body>
|
|
<table style="text-align: center; width: 100%;" border="0"
|
|
cellpadding="2" cellspacing="2">
|
|
<tbody>
|
|
<tr>
|
|
<td style="width: 80px;"><img alt="ChibiOS/RT Logo" src="logo_small.png"></td>
|
|
<td><big><big>ChibiOS/RT</big></big><br><br>Architecture - Reference Manual - Guides</td>
|
|
<td style="width: 80px;"></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<hr size="1">
|
|
<!-- Generated by Doxygen 1.6.3 -->
|
|
<div class="navigation" id="top">
|
|
<div class="tabs">
|
|
<ul>
|
|
<li><a href="main.html"><span>Main Page</span></a></li>
|
|
<li><a href="modules.html"><span>Modules</span></a></li>
|
|
<li><a href="annotated.html"><span>Data Structures</span></a></li>
|
|
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<div class="tabs">
|
|
<ul>
|
|
<li><a href="files.html"><span>File List</span></a></li>
|
|
<li><a href="globals.html"><span>Globals</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<h1>testheap.c</h1><a href="testheap_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
|
|
<a name="l00002"></a>00002 <span class="comment"> ChibiOS/RT - Copyright (C) 2006,2007,2008,2009,2010 Giovanni Di Sirio.</span>
|
|
<a name="l00003"></a>00003 <span class="comment"></span>
|
|
<a name="l00004"></a>00004 <span class="comment"> This file is part of ChibiOS/RT.</span>
|
|
<a name="l00005"></a>00005 <span class="comment"></span>
|
|
<a name="l00006"></a>00006 <span class="comment"> ChibiOS/RT is free software; you can redistribute it and/or modify</span>
|
|
<a name="l00007"></a>00007 <span class="comment"> it under the terms of the GNU General Public License as published by</span>
|
|
<a name="l00008"></a>00008 <span class="comment"> the Free Software Foundation; either version 3 of the License, or</span>
|
|
<a name="l00009"></a>00009 <span class="comment"> (at your option) any later version.</span>
|
|
<a name="l00010"></a>00010 <span class="comment"></span>
|
|
<a name="l00011"></a>00011 <span class="comment"> ChibiOS/RT is distributed in the hope that it will be useful,</span>
|
|
<a name="l00012"></a>00012 <span class="comment"> but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
|
|
<a name="l00013"></a>00013 <span class="comment"> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
|
|
<a name="l00014"></a>00014 <span class="comment"> GNU General Public License for more details.</span>
|
|
<a name="l00015"></a>00015 <span class="comment"></span>
|
|
<a name="l00016"></a>00016 <span class="comment"> You should have received a copy of the GNU General Public License</span>
|
|
<a name="l00017"></a>00017 <span class="comment"> along with this program. If not, see <http://www.gnu.org/licenses/>.</span>
|
|
<a name="l00018"></a>00018 <span class="comment"></span>
|
|
<a name="l00019"></a>00019 <span class="comment"> ---</span>
|
|
<a name="l00020"></a>00020 <span class="comment"></span>
|
|
<a name="l00021"></a>00021 <span class="comment"> A special exception to the GPL can be applied should you wish to distribute</span>
|
|
<a name="l00022"></a>00022 <span class="comment"> a combined work that includes ChibiOS/RT, without being obliged to provide</span>
|
|
<a name="l00023"></a>00023 <span class="comment"> the source code for any proprietary components. See the file exception.txt</span>
|
|
<a name="l00024"></a>00024 <span class="comment"> for full details of how and when the exception can be applied.</span>
|
|
<a name="l00025"></a>00025 <span class="comment">*/</span>
|
|
<a name="l00026"></a>00026
|
|
<a name="l00027"></a>00027 <span class="preprocessor">#include "<a class="code" href="ch_8h.html" title="ChibiOS/RT main include file.">ch.h</a>"</span>
|
|
<a name="l00028"></a>00028 <span class="preprocessor">#include "<a class="code" href="test_8h.html" title="Tests support header.">test.h</a>"</span>
|
|
<a name="l00029"></a>00029 <span class="comment"></span>
|
|
<a name="l00030"></a>00030 <span class="comment">/**</span>
|
|
<a name="l00031"></a>00031 <span class="comment"> * @page test_heap Memory Heap test</span>
|
|
<a name="l00032"></a>00032 <span class="comment"> *</span>
|
|
<a name="l00033"></a>00033 <span class="comment"> * File: @ref testheap.c</span>
|
|
<a name="l00034"></a>00034 <span class="comment"> *</span>
|
|
<a name="l00035"></a>00035 <span class="comment"> * <h2>Description</h2></span>
|
|
<a name="l00036"></a>00036 <span class="comment"> * This module implements the test sequence for the @ref heaps subsystem.</span>
|
|
<a name="l00037"></a>00037 <span class="comment"> *</span>
|
|
<a name="l00038"></a>00038 <span class="comment"> * <h2>Objective</h2></span>
|
|
<a name="l00039"></a>00039 <span class="comment"> * Objective of the test module is to cover 100% of the @ref heaps subsystem.</span>
|
|
<a name="l00040"></a>00040 <span class="comment"> *</span>
|
|
<a name="l00041"></a>00041 <span class="comment"> * <h2>Preconditions</h2></span>
|
|
<a name="l00042"></a>00042 <span class="comment"> * The module requires the following kernel options:</span>
|
|
<a name="l00043"></a>00043 <span class="comment"> * - @p CH_USE_HEAP</span>
|
|
<a name="l00044"></a>00044 <span class="comment"> * .</span>
|
|
<a name="l00045"></a>00045 <span class="comment"> * In case some of the required options are not enabled then some or all tests</span>
|
|
<a name="l00046"></a>00046 <span class="comment"> * may be skipped.</span>
|
|
<a name="l00047"></a>00047 <span class="comment"> *</span>
|
|
<a name="l00048"></a>00048 <span class="comment"> * <h2>Test Cases</h2></span>
|
|
<a name="l00049"></a>00049 <span class="comment"> * - @subpage test_heap_001</span>
|
|
<a name="l00050"></a>00050 <span class="comment"> * .</span>
|
|
<a name="l00051"></a>00051 <span class="comment"> * @file testheap.c</span>
|
|
<a name="l00052"></a>00052 <span class="comment"> * @brief Heap test source file</span>
|
|
<a name="l00053"></a>00053 <span class="comment"> * @file testheap.h</span>
|
|
<a name="l00054"></a>00054 <span class="comment"> * @brief Heap header file</span>
|
|
<a name="l00055"></a>00055 <span class="comment"> */</span>
|
|
<a name="l00056"></a>00056
|
|
<a name="l00057"></a>00057 <span class="preprocessor">#if CH_USE_HEAP</span>
|
|
<a name="l00058"></a>00058 <span class="preprocessor"></span>
|
|
<a name="l00059"></a>00059 <span class="preprocessor">#define SIZE 16</span>
|
|
<a name="l00060"></a>00060 <span class="preprocessor"></span>
|
|
<a name="l00061"></a>00061 <span class="keyword">static</span> <a class="code" href="structmemory__heap.html" title="Structure describing a memory heap.">MemoryHeap</a> test_heap;
|
|
<a name="l00062"></a>00062 <span class="comment"></span>
|
|
<a name="l00063"></a>00063 <span class="comment">/**</span>
|
|
<a name="l00064"></a>00064 <span class="comment"> * @page test_heap_001 Allocation and fragmentation test</span>
|
|
<a name="l00065"></a>00065 <span class="comment"> *</span>
|
|
<a name="l00066"></a>00066 <span class="comment"> * <h2>Description</h2></span>
|
|
<a name="l00067"></a>00067 <span class="comment"> * Series of allocations/deallocations are performed in carefully designed</span>
|
|
<a name="l00068"></a>00068 <span class="comment"> * sequences in order to stimulate all the possible code paths inside the</span>
|
|
<a name="l00069"></a>00069 <span class="comment"> * allocator.<br></span>
|
|
<a name="l00070"></a>00070 <span class="comment"> * The test expects to find the heap back to the initial status after each</span>
|
|
<a name="l00071"></a>00071 <span class="comment"> * sequence.</span>
|
|
<a name="l00072"></a>00072 <span class="comment"> */</span>
|
|
<a name="l00073"></a>00073
|
|
<a name="l00074"></a>00074 <span class="keyword">static</span> <span class="keywordtype">char</span> *heap1_gettest(<span class="keywordtype">void</span>) {
|
|
<a name="l00075"></a>00075
|
|
<a name="l00076"></a>00076 <span class="keywordflow">return</span> <span class="stringliteral">"Heap, allocation and fragmentation test"</span>;
|
|
<a name="l00077"></a>00077 }
|
|
<a name="l00078"></a>00078
|
|
<a name="l00079"></a>00079 <span class="keyword">static</span> <span class="keywordtype">void</span> heap1_setup(<span class="keywordtype">void</span>) {
|
|
<a name="l00080"></a>00080
|
|
<a name="l00081"></a>00081 <a class="code" href="group__heaps.html#ga7135c9ddbd1402a4a36ce44df948f4e4" title="Initializes a memory heap from a static memory area.">chHeapInit</a>(&test_heap, test.buffer, <span class="keyword">sizeof</span>(<span class="keyword">union</span> test_buffers));
|
|
<a name="l00082"></a>00082 }
|
|
<a name="l00083"></a>00083
|
|
<a name="l00084"></a>00084 <span class="keyword">static</span> <span class="keywordtype">void</span> heap1_execute(<span class="keywordtype">void</span>) {
|
|
<a name="l00085"></a>00085 <span class="keywordtype">void</span> *p1, *p2, *p3;
|
|
<a name="l00086"></a>00086 <span class="keywordtype">size_t</span> n, sz;
|
|
<a name="l00087"></a>00087
|
|
<a name="l00088"></a>00088 <span class="comment">/* Unrelated, for coverage only.*/</span>
|
|
<a name="l00089"></a>00089 (void)<a class="code" href="group__memcore.html#ga1404de855a685500cb66e6c8560d4b25" title="Core memory status.">chCoreStatus</a>();
|
|
<a name="l00090"></a>00090
|
|
<a name="l00091"></a>00091 <span class="comment">/*</span>
|
|
<a name="l00092"></a>00092 <span class="comment"> * Test on the default heap in order to cover the core allocator at</span>
|
|
<a name="l00093"></a>00093 <span class="comment"> * least one time.</span>
|
|
<a name="l00094"></a>00094 <span class="comment"> */</span>
|
|
<a name="l00095"></a>00095 (void)<a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(NULL, &sz);
|
|
<a name="l00096"></a>00096 p1 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(NULL, SIZE);
|
|
<a name="l00097"></a>00097 <a class="code" href="group__test.html#ga835cb17ca3869922b49435d95324a68b" title="Test assertion.">test_assert</a>(1, p1 != NULL, <span class="stringliteral">"allocation failed"</span>);
|
|
<a name="l00098"></a>00098 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p1);
|
|
<a name="l00099"></a>00099 p1 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(NULL, (<span class="keywordtype">size_t</span>)-256);
|
|
<a name="l00100"></a>00100 <a class="code" href="group__test.html#ga835cb17ca3869922b49435d95324a68b" title="Test assertion.">test_assert</a>(2, p1 == NULL, <span class="stringliteral">"allocation not failed"</span>);
|
|
<a name="l00101"></a>00101
|
|
<a name="l00102"></a>00102 <span class="comment">/* Initial local heap state.*/</span>
|
|
<a name="l00103"></a>00103 (void)<a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(&test_heap, &sz);
|
|
<a name="l00104"></a>00104
|
|
<a name="l00105"></a>00105 <span class="comment">/* Same order.*/</span>
|
|
<a name="l00106"></a>00106 p1 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, SIZE);
|
|
<a name="l00107"></a>00107 p2 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, SIZE);
|
|
<a name="l00108"></a>00108 p3 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, SIZE);
|
|
<a name="l00109"></a>00109 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p1); <span class="comment">/* Does not merge.*/</span>
|
|
<a name="l00110"></a>00110 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p2); <span class="comment">/* Merges backward.*/</span>
|
|
<a name="l00111"></a>00111 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p3); <span class="comment">/* Merges both sides.*/</span>
|
|
<a name="l00112"></a>00112 <a class="code" href="group__test.html#ga835cb17ca3869922b49435d95324a68b" title="Test assertion.">test_assert</a>(3, <a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(&test_heap, &n) == 1, <span class="stringliteral">"heap fragmented"</span>);
|
|
<a name="l00113"></a>00113
|
|
<a name="l00114"></a>00114 <span class="comment">/* Reverse order.*/</span>
|
|
<a name="l00115"></a>00115 p1 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, SIZE);
|
|
<a name="l00116"></a>00116 p2 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, SIZE);
|
|
<a name="l00117"></a>00117 p3 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, SIZE);
|
|
<a name="l00118"></a>00118 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p3); <span class="comment">/* Merges forward.*/</span>
|
|
<a name="l00119"></a>00119 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p2); <span class="comment">/* Merges forward.*/</span>
|
|
<a name="l00120"></a>00120 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p1); <span class="comment">/* Merges forward.*/</span>
|
|
<a name="l00121"></a>00121 <a class="code" href="group__test.html#ga835cb17ca3869922b49435d95324a68b" title="Test assertion.">test_assert</a>(4, <a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(&test_heap, &n) == 1, <span class="stringliteral">"heap fragmented"</span>);
|
|
<a name="l00122"></a>00122
|
|
<a name="l00123"></a>00123 <span class="comment">/* Small fragments handling.*/</span>
|
|
<a name="l00124"></a>00124 p1 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, SIZE + 1);
|
|
<a name="l00125"></a>00125 p2 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, SIZE);
|
|
<a name="l00126"></a>00126 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p1);
|
|
<a name="l00127"></a>00127 <a class="code" href="group__test.html#ga835cb17ca3869922b49435d95324a68b" title="Test assertion.">test_assert</a>(5, <a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(&test_heap, &n) == 2, <span class="stringliteral">"invalid state"</span>);
|
|
<a name="l00128"></a>00128 p1 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, SIZE);
|
|
<a name="l00129"></a>00129 <span class="comment">/* Note, the first situation happens when the alignment size is smaller</span>
|
|
<a name="l00130"></a>00130 <span class="comment"> than the header size, the second in the other cases.*/</span>
|
|
<a name="l00131"></a>00131 <a class="code" href="group__test.html#ga835cb17ca3869922b49435d95324a68b" title="Test assertion.">test_assert</a>(6, (<a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(&test_heap, &n) == 1) ||
|
|
<a name="l00132"></a>00132 (<a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(&test_heap, &n) == 2), <span class="stringliteral">"heap fragmented"</span>);
|
|
<a name="l00133"></a>00133 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p2);
|
|
<a name="l00134"></a>00134 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p1);
|
|
<a name="l00135"></a>00135 <a class="code" href="group__test.html#ga835cb17ca3869922b49435d95324a68b" title="Test assertion.">test_assert</a>(7, <a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(&test_heap, &n) == 1, <span class="stringliteral">"heap fragmented"</span>);
|
|
<a name="l00136"></a>00136
|
|
<a name="l00137"></a>00137 <span class="comment">/* Skip fragment handling.*/</span>
|
|
<a name="l00138"></a>00138 p1 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, SIZE);
|
|
<a name="l00139"></a>00139 p2 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, SIZE);
|
|
<a name="l00140"></a>00140 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p1);
|
|
<a name="l00141"></a>00141 <a class="code" href="group__test.html#ga835cb17ca3869922b49435d95324a68b" title="Test assertion.">test_assert</a>(8, <a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(&test_heap, &n) == 2, <span class="stringliteral">"invalid state"</span>);
|
|
<a name="l00142"></a>00142 p1 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, SIZE * 2); <span class="comment">/* Skips first fragment.*/</span>
|
|
<a name="l00143"></a>00143 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p1);
|
|
<a name="l00144"></a>00144 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p2);
|
|
<a name="l00145"></a>00145 <a class="code" href="group__test.html#ga835cb17ca3869922b49435d95324a68b" title="Test assertion.">test_assert</a>(9, <a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(&test_heap, &n) == 1, <span class="stringliteral">"heap fragmented"</span>);
|
|
<a name="l00146"></a>00146
|
|
<a name="l00147"></a>00147 <span class="comment">/* Allocate all handling.*/</span>
|
|
<a name="l00148"></a>00148 (void)<a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(&test_heap, &n);
|
|
<a name="l00149"></a>00149 p1 = <a class="code" href="group__heaps.html#ga3d364eec0bef8b1986f63b3288ebbd5f" title="Allocates a block of memory from the heap by using the first-fit algorithm.">chHeapAlloc</a>(&test_heap, n);
|
|
<a name="l00150"></a>00150 <a class="code" href="group__test.html#ga835cb17ca3869922b49435d95324a68b" title="Test assertion.">test_assert</a>(10, <a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(&test_heap, &n) == 0, <span class="stringliteral">"not empty"</span>);
|
|
<a name="l00151"></a>00151 <a class="code" href="group__heaps.html#ga0fc553df0138f02e0b233be91e413c79" title="Frees a previously allocated memory block.">chHeapFree</a>(p1);
|
|
<a name="l00152"></a>00152
|
|
<a name="l00153"></a>00153 <a class="code" href="group__test.html#ga835cb17ca3869922b49435d95324a68b" title="Test assertion.">test_assert</a>(11, <a class="code" href="group__heaps.html#ga944ffb8c5b83c26b984e6a072d871a8b" title="Reports the heap status.">chHeapStatus</a>(&test_heap, &n) == 1, <span class="stringliteral">"heap fragmented"</span>);
|
|
<a name="l00154"></a>00154 <a class="code" href="group__test.html#ga835cb17ca3869922b49435d95324a68b" title="Test assertion.">test_assert</a>(12, n == sz, <span class="stringliteral">"size changed"</span>);
|
|
<a name="l00155"></a>00155 }
|
|
<a name="l00156"></a>00156
|
|
<a name="l00157"></a>00157 <span class="keyword">const</span> <span class="keyword">struct </span><a class="code" href="structtestcase.html" title="Structure representing a test case.">testcase</a> testheap1 = {
|
|
<a name="l00158"></a>00158 heap1_gettest,
|
|
<a name="l00159"></a>00159 heap1_setup,
|
|
<a name="l00160"></a>00160 NULL,
|
|
<a name="l00161"></a>00161 heap1_execute
|
|
<a name="l00162"></a>00162 };
|
|
<a name="l00163"></a>00163
|
|
<a name="l00164"></a>00164 <span class="preprocessor">#endif </span><span class="comment">/* CH_USE_HEAP.*/</span>
|
|
<a name="l00165"></a>00165 <span class="comment"></span>
|
|
<a name="l00166"></a>00166 <span class="comment">/**</span>
|
|
<a name="l00167"></a>00167 <span class="comment"> * @brief Test sequence for heap.</span>
|
|
<a name="l00168"></a>00168 <span class="comment"> */</span>
|
|
<a name="l00169"></a><a class="code" href="testheap_8h.html#a5fbd0631733f8927ec129d234461d7ff">00169</a> <span class="keyword">const</span> <span class="keyword">struct </span><a class="code" href="structtestcase.html" title="Structure representing a test case.">testcase</a> * <span class="keyword">const</span> <a class="code" href="testheap_8c.html#a5573379e505168afe49bf5d440911438" title="Test sequence for heap.">patternheap</a>[] = {
|
|
<a name="l00170"></a>00170 <span class="preprocessor">#if CH_USE_HEAP</span>
|
|
<a name="l00171"></a>00171 <span class="preprocessor"></span> &testheap1,
|
|
<a name="l00172"></a>00172 <span class="preprocessor">#endif</span>
|
|
<a name="l00173"></a>00173 <span class="preprocessor"></span> NULL
|
|
<a name="l00174"></a>00174 };
|
|
</pre></div></div>
|
|
<hr size="1"><address style="text-align: right;"><small>
|
|
Generated on Sun Jul 11 13:13:01 2010 for ChibiOS/RT by <a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.6.3</small></address>
|
|
</body>
|
|
</html>
|