1 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
2 <html xmlns="http://www.w3.org/1999/xhtml">
4 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
5 <title>CMSIS DSP Software Library: arm_biquad_cascade_df2T_f32.c Source File</title>
6 <link href="tabs.css" rel="stylesheet" type="text/css"/>
7 <link href="search/search.css" rel="stylesheet" type="text/css"/>
8 <script type="text/javaScript" src="search/search.js"></script>
9 <link href="doxygen.css" rel="stylesheet" type="text/css"/>
11 <body onload='searchBox.OnSelectItem(0);'>
12 <!-- Generated by Doxygen 1.7.2 -->
13 <script type="text/javascript"><!--
14 var searchBox = new SearchBox("searchBox", "search",false,'Search');
16 <div class="navigation" id="top">
19 <li><a href="index.html"><span>Main Page</span></a></li>
20 <li><a href="modules.html"><span>Modules</span></a></li>
21 <li><a href="annotated.html"><span>Data Structures</span></a></li>
22 <li class="current"><a href="files.html"><span>Files</span></a></li>
23 <li><a href="examples.html"><span>Examples</span></a></li>
25 <div id="MSearchBox" class="MSearchBoxInactive">
27 <img id="MSearchSelect" src="search/mag_sel.png"
28 onmouseover="return searchBox.OnSearchSelectShow()"
29 onmouseout="return searchBox.OnSearchSelectHide()"
31 <input type="text" id="MSearchField" value="Search" accesskey="S"
32 onfocus="searchBox.OnSearchFieldFocus(true)"
33 onblur="searchBox.OnSearchFieldFocus(false)"
34 onkeyup="searchBox.OnSearchFieldChange(event)"/>
35 </span><span class="right">
36 <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
44 <li><a href="files.html"><span>File List</span></a></li>
45 <li><a href="globals.html"><span>Globals</span></a></li>
49 <div class="headertitle">
50 <h1>arm_biquad_cascade_df2T_f32.c</h1> </div>
52 <div class="contents">
53 <a href="arm__biquad__cascade__df2_t__f32_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>
54 <a name="l00002"></a>00002 <span class="comment">* Copyright (C) 2010 ARM Limited. All rights reserved. </span>
55 <a name="l00003"></a>00003 <span class="comment">* </span>
56 <a name="l00004"></a>00004 <span class="comment">* $Date: 15. July 2011 </span>
57 <a name="l00005"></a>00005 <span class="comment">* $Revision: V1.0.10 </span>
58 <a name="l00006"></a>00006 <span class="comment">* </span>
59 <a name="l00007"></a>00007 <span class="comment">* Project: CMSIS DSP Library </span>
60 <a name="l00008"></a>00008 <span class="comment">* Title: arm_biquad_cascade_df2T_f32.c </span>
61 <a name="l00009"></a>00009 <span class="comment">* </span>
62 <a name="l00010"></a>00010 <span class="comment">* Description: Processing function for the floating-point transposed </span>
63 <a name="l00011"></a>00011 <span class="comment">* direct form II Biquad cascade filter. </span>
64 <a name="l00012"></a>00012 <span class="comment">* </span>
65 <a name="l00013"></a>00013 <span class="comment">* Target Processor: Cortex-M4/Cortex-M3/Cortex-M0</span>
66 <a name="l00014"></a>00014 <span class="comment">* </span>
67 <a name="l00015"></a>00015 <span class="comment">* Version 1.0.10 2011/7/15 </span>
68 <a name="l00016"></a>00016 <span class="comment">* Big Endian support added and Merged M0 and M3/M4 Source code. </span>
69 <a name="l00017"></a>00017 <span class="comment">* </span>
70 <a name="l00018"></a>00018 <span class="comment">* Version 1.0.3 2010/11/29 </span>
71 <a name="l00019"></a>00019 <span class="comment">* Re-organized the CMSIS folders and updated documentation. </span>
72 <a name="l00020"></a>00020 <span class="comment">* </span>
73 <a name="l00021"></a>00021 <span class="comment">* Version 1.0.2 2010/11/11 </span>
74 <a name="l00022"></a>00022 <span class="comment">* Documentation updated. </span>
75 <a name="l00023"></a>00023 <span class="comment">* </span>
76 <a name="l00024"></a>00024 <span class="comment">* Version 1.0.1 2010/10/05 </span>
77 <a name="l00025"></a>00025 <span class="comment">* Production release and review comments incorporated. </span>
78 <a name="l00026"></a>00026 <span class="comment">* </span>
79 <a name="l00027"></a>00027 <span class="comment">* Version 1.0.0 2010/09/20 </span>
80 <a name="l00028"></a>00028 <span class="comment">* Production release and review comments incorporated </span>
81 <a name="l00029"></a>00029 <span class="comment">* </span>
82 <a name="l00030"></a>00030 <span class="comment">* Version 0.0.7 2010/06/10 </span>
83 <a name="l00031"></a>00031 <span class="comment">* Misra-C changes done </span>
84 <a name="l00032"></a>00032 <span class="comment">* -------------------------------------------------------------------- */</span>
85 <a name="l00033"></a>00033
86 <a name="l00034"></a>00034 <span class="preprocessor">#include "<a class="code" href="arm__math_8h.html">arm_math.h</a>"</span>
87 <a name="l00035"></a>00035
88 <a name="l00143"></a><a class="code" href="group___biquad_cascade_d_f2_t.html#ga646c25998bf35991c60299b1431460f7">00143</a> <span class="keywordtype">void</span> <a class="code" href="group___biquad_cascade_d_f2_t.html#ga646c25998bf35991c60299b1431460f7" title="Processing function for the floating-point transposed direct form II Biquad cascade filter...">arm_biquad_cascade_df2T_f32</a>(
89 <a name="l00144"></a>00144 <span class="keyword">const</span> <a class="code" href="structarm__biquad__cascade__df2_t__instance__f32.html" title="Instance structure for the floating-point transposed direct form II Biquad cascade filter...">arm_biquad_cascade_df2T_instance_f32</a> * S,
90 <a name="l00145"></a>00145 <a class="code" href="arm__math_8h.html#a4611b605e45ab401f02cab15c5e38715" title="32-bit floating-point type definition.">float32_t</a> * pSrc,
91 <a name="l00146"></a>00146 <a class="code" href="arm__math_8h.html#a4611b605e45ab401f02cab15c5e38715" title="32-bit floating-point type definition.">float32_t</a> * pDst,
92 <a name="l00147"></a>00147 uint32_t <a class="code" href="arm__fir__example__f32_8c.html#ab6558f40a619c2502fbc24c880fd4fb0">blockSize</a>)
93 <a name="l00148"></a>00148 {
94 <a name="l00149"></a>00149
95 <a name="l00150"></a>00150 <a class="code" href="arm__math_8h.html#a4611b605e45ab401f02cab15c5e38715" title="32-bit floating-point type definition.">float32_t</a> *pIn = pSrc; <span class="comment">/* source pointer */</span>
96 <a name="l00151"></a>00151 <a class="code" href="arm__math_8h.html#a4611b605e45ab401f02cab15c5e38715" title="32-bit floating-point type definition.">float32_t</a> *pOut = pDst; <span class="comment">/* destination pointer */</span>
97 <a name="l00152"></a>00152 <a class="code" href="arm__math_8h.html#a4611b605e45ab401f02cab15c5e38715" title="32-bit floating-point type definition.">float32_t</a> *pState = S-><a class="code" href="structarm__biquad__cascade__df2_t__instance__f32.html#a24d223addfd926a7177088cf2efe76b1">pState</a>; <span class="comment">/* State pointer */</span>
98 <a name="l00153"></a>00153 <a class="code" href="arm__math_8h.html#a4611b605e45ab401f02cab15c5e38715" title="32-bit floating-point type definition.">float32_t</a> *pCoeffs = S-><a class="code" href="structarm__biquad__cascade__df2_t__instance__f32.html#a49a24fe1b6ad3b0b26779c32d8d80b2e">pCoeffs</a>; <span class="comment">/* coefficient pointer */</span>
99 <a name="l00154"></a>00154 <a class="code" href="arm__math_8h.html#a4611b605e45ab401f02cab15c5e38715" title="32-bit floating-point type definition.">float32_t</a> acc0; <span class="comment">/* Simulates the accumulator */</span>
100 <a name="l00155"></a>00155 <a class="code" href="arm__math_8h.html#a4611b605e45ab401f02cab15c5e38715" title="32-bit floating-point type definition.">float32_t</a> b0, b1, b2, a1, a2; <span class="comment">/* Filter coefficients */</span>
101 <a name="l00156"></a>00156 <a class="code" href="arm__math_8h.html#a4611b605e45ab401f02cab15c5e38715" title="32-bit floating-point type definition.">float32_t</a> Xn; <span class="comment">/* temporary input */</span>
102 <a name="l00157"></a>00157 <a class="code" href="arm__math_8h.html#a4611b605e45ab401f02cab15c5e38715" title="32-bit floating-point type definition.">float32_t</a> d1, d2; <span class="comment">/* state variables */</span>
103 <a name="l00158"></a>00158 uint32_t sample, stage = S-><a class="code" href="structarm__biquad__cascade__df2_t__instance__f32.html#a4d17958c33c3d0a905f974bac50f033f">numStages</a>; <span class="comment">/* loop counters */</span>
104 <a name="l00159"></a>00159
105 <a name="l00160"></a>00160
106 <a name="l00161"></a>00161 <span class="preprocessor">#ifndef ARM_MATH_CM0</span>
107 <a name="l00162"></a>00162 <span class="preprocessor"></span>
108 <a name="l00163"></a>00163 <span class="comment">/* Run the below code for Cortex-M4 and Cortex-M3 */</span>
109 <a name="l00164"></a>00164
110 <a name="l00165"></a>00165 <span class="keywordflow">do</span>
111 <a name="l00166"></a>00166 {
112 <a name="l00167"></a>00167 <span class="comment">/* Reading the coefficients */</span>
113 <a name="l00168"></a>00168 b0 = *pCoeffs++;
114 <a name="l00169"></a>00169 b1 = *pCoeffs++;
115 <a name="l00170"></a>00170 b2 = *pCoeffs++;
116 <a name="l00171"></a>00171 a1 = *pCoeffs++;
117 <a name="l00172"></a>00172 a2 = *pCoeffs++;
118 <a name="l00173"></a>00173
119 <a name="l00174"></a>00174 <span class="comment">/*Reading the state values */</span>
120 <a name="l00175"></a>00175 d1 = pState[0];
121 <a name="l00176"></a>00176 d2 = pState[1];
122 <a name="l00177"></a>00177
123 <a name="l00178"></a>00178 <span class="comment">/* Apply loop unrolling and compute 4 output values simultaneously. */</span>
124 <a name="l00179"></a>00179 sample = blockSize >> 2u;
125 <a name="l00180"></a>00180
126 <a name="l00181"></a>00181 <span class="comment">/* First part of the processing with loop unrolling. Compute 4 outputs at a time. </span>
127 <a name="l00182"></a>00182 <span class="comment"> ** a second loop below computes the remaining 1 to 3 samples. */</span>
128 <a name="l00183"></a>00183 <span class="keywordflow">while</span>(sample > 0u)
129 <a name="l00184"></a>00184 {
130 <a name="l00185"></a>00185 <span class="comment">/* Read the first input */</span>
131 <a name="l00186"></a>00186 Xn = *pIn++;
132 <a name="l00187"></a>00187
133 <a name="l00188"></a>00188 <span class="comment">/* y[n] = b0 * x[n] + d1 */</span>
134 <a name="l00189"></a>00189 acc0 = (b0 * Xn) + d1;
135 <a name="l00190"></a>00190
136 <a name="l00191"></a>00191 <span class="comment">/* Store the result in the accumulator in the destination buffer. */</span>
137 <a name="l00192"></a>00192 *pOut++ = acc0;
138 <a name="l00193"></a>00193
139 <a name="l00194"></a>00194 <span class="comment">/* Every time after the output is computed state should be updated. */</span>
140 <a name="l00195"></a>00195 <span class="comment">/* d1 = b1 * x[n] + a1 * y[n] + d2 */</span>
141 <a name="l00196"></a>00196 d1 = ((b1 * Xn) + (a1 * acc0)) + d2;
142 <a name="l00197"></a>00197
143 <a name="l00198"></a>00198 <span class="comment">/* d2 = b2 * x[n] + a2 * y[n] */</span>
144 <a name="l00199"></a>00199 d2 = (b2 * Xn) + (a2 * acc0);
145 <a name="l00200"></a>00200
146 <a name="l00201"></a>00201 <span class="comment">/* Read the second input */</span>
147 <a name="l00202"></a>00202 Xn = *pIn++;
148 <a name="l00203"></a>00203
149 <a name="l00204"></a>00204 <span class="comment">/* y[n] = b0 * x[n] + d1 */</span>
150 <a name="l00205"></a>00205 acc0 = (b0 * Xn) + d1;
151 <a name="l00206"></a>00206
152 <a name="l00207"></a>00207 <span class="comment">/* Store the result in the accumulator in the destination buffer. */</span>
153 <a name="l00208"></a>00208 *pOut++ = acc0;
154 <a name="l00209"></a>00209
155 <a name="l00210"></a>00210 <span class="comment">/* Every time after the output is computed state should be updated. */</span>
156 <a name="l00211"></a>00211 <span class="comment">/* d1 = b1 * x[n] + a1 * y[n] + d2 */</span>
157 <a name="l00212"></a>00212 d1 = ((b1 * Xn) + (a1 * acc0)) + d2;
158 <a name="l00213"></a>00213
159 <a name="l00214"></a>00214 <span class="comment">/* d2 = b2 * x[n] + a2 * y[n] */</span>
160 <a name="l00215"></a>00215 d2 = (b2 * Xn) + (a2 * acc0);
161 <a name="l00216"></a>00216
162 <a name="l00217"></a>00217 <span class="comment">/* Read the third input */</span>
163 <a name="l00218"></a>00218 Xn = *pIn++;
164 <a name="l00219"></a>00219
165 <a name="l00220"></a>00220 <span class="comment">/* y[n] = b0 * x[n] + d1 */</span>
166 <a name="l00221"></a>00221 acc0 = (b0 * Xn) + d1;
167 <a name="l00222"></a>00222
168 <a name="l00223"></a>00223 <span class="comment">/* Store the result in the accumulator in the destination buffer. */</span>
169 <a name="l00224"></a>00224 *pOut++ = acc0;
170 <a name="l00225"></a>00225
171 <a name="l00226"></a>00226 <span class="comment">/* Every time after the output is computed state should be updated. */</span>
172 <a name="l00227"></a>00227 <span class="comment">/* d1 = b1 * x[n] + a1 * y[n] + d2 */</span>
173 <a name="l00228"></a>00228 d1 = ((b1 * Xn) + (a1 * acc0)) + d2;
174 <a name="l00229"></a>00229
175 <a name="l00230"></a>00230 <span class="comment">/* d2 = b2 * x[n] + a2 * y[n] */</span>
176 <a name="l00231"></a>00231 d2 = (b2 * Xn) + (a2 * acc0);
177 <a name="l00232"></a>00232
178 <a name="l00233"></a>00233 <span class="comment">/* Read the fourth input */</span>
179 <a name="l00234"></a>00234 Xn = *pIn++;
180 <a name="l00235"></a>00235
181 <a name="l00236"></a>00236 <span class="comment">/* y[n] = b0 * x[n] + d1 */</span>
182 <a name="l00237"></a>00237 acc0 = (b0 * Xn) + d1;
183 <a name="l00238"></a>00238
184 <a name="l00239"></a>00239 <span class="comment">/* Store the result in the accumulator in the destination buffer. */</span>
185 <a name="l00240"></a>00240 *pOut++ = acc0;
186 <a name="l00241"></a>00241
187 <a name="l00242"></a>00242 <span class="comment">/* Every time after the output is computed state should be updated. */</span>
188 <a name="l00243"></a>00243 <span class="comment">/* d1 = b1 * x[n] + a1 * y[n] + d2 */</span>
189 <a name="l00244"></a>00244 d1 = (b1 * Xn) + (a1 * acc0) + d2;
190 <a name="l00245"></a>00245
191 <a name="l00246"></a>00246 <span class="comment">/* d2 = b2 * x[n] + a2 * y[n] */</span>
192 <a name="l00247"></a>00247 d2 = (b2 * Xn) + (a2 * acc0);
193 <a name="l00248"></a>00248
194 <a name="l00249"></a>00249 <span class="comment">/* decrement the loop counter */</span>
195 <a name="l00250"></a>00250 sample--;
196 <a name="l00251"></a>00251
197 <a name="l00252"></a>00252 }
198 <a name="l00253"></a>00253
199 <a name="l00254"></a>00254 <span class="comment">/* If the blockSize is not a multiple of 4, compute any remaining output samples here. </span>
200 <a name="l00255"></a>00255 <span class="comment"> ** No loop unrolling is used. */</span>
201 <a name="l00256"></a>00256 sample = blockSize & 0x3u;
202 <a name="l00257"></a>00257
203 <a name="l00258"></a>00258 <span class="keywordflow">while</span>(sample > 0u)
204 <a name="l00259"></a>00259 {
205 <a name="l00260"></a>00260 <span class="comment">/* Read the input */</span>
206 <a name="l00261"></a>00261 Xn = *pIn++;
207 <a name="l00262"></a>00262
208 <a name="l00263"></a>00263 <span class="comment">/* y[n] = b0 * x[n] + d1 */</span>
209 <a name="l00264"></a>00264 acc0 = (b0 * Xn) + d1;
210 <a name="l00265"></a>00265
211 <a name="l00266"></a>00266 <span class="comment">/* Store the result in the accumulator in the destination buffer. */</span>
212 <a name="l00267"></a>00267 *pOut++ = acc0;
213 <a name="l00268"></a>00268
214 <a name="l00269"></a>00269 <span class="comment">/* Every time after the output is computed state should be updated. */</span>
215 <a name="l00270"></a>00270 <span class="comment">/* d1 = b1 * x[n] + a1 * y[n] + d2 */</span>
216 <a name="l00271"></a>00271 d1 = ((b1 * Xn) + (a1 * acc0)) + d2;
217 <a name="l00272"></a>00272
218 <a name="l00273"></a>00273 <span class="comment">/* d2 = b2 * x[n] + a2 * y[n] */</span>
219 <a name="l00274"></a>00274 d2 = (b2 * Xn) + (a2 * acc0);
220 <a name="l00275"></a>00275
221 <a name="l00276"></a>00276 <span class="comment">/* decrement the loop counter */</span>
222 <a name="l00277"></a>00277 sample--;
223 <a name="l00278"></a>00278 }
224 <a name="l00279"></a>00279
225 <a name="l00280"></a>00280 <span class="comment">/* Store the updated state variables back into the state array */</span>
226 <a name="l00281"></a>00281 *pState++ = d1;
227 <a name="l00282"></a>00282 *pState++ = d2;
228 <a name="l00283"></a>00283
229 <a name="l00284"></a>00284 <span class="comment">/* The current stage input is given as the output to the next stage */</span>
230 <a name="l00285"></a>00285 pIn = pDst;
231 <a name="l00286"></a>00286
232 <a name="l00287"></a>00287 <span class="comment">/*Reset the output working pointer */</span>
233 <a name="l00288"></a>00288 pOut = pDst;
234 <a name="l00289"></a>00289
235 <a name="l00290"></a>00290 <span class="comment">/* decrement the loop counter */</span>
236 <a name="l00291"></a>00291 stage--;
237 <a name="l00292"></a>00292
238 <a name="l00293"></a>00293 } <span class="keywordflow">while</span>(stage > 0u);
239 <a name="l00294"></a>00294
240 <a name="l00295"></a>00295 <span class="preprocessor">#else</span>
241 <a name="l00296"></a>00296 <span class="preprocessor"></span>
242 <a name="l00297"></a>00297 <span class="comment">/* Run the below code for Cortex-M0 */</span>
243 <a name="l00298"></a>00298
244 <a name="l00299"></a>00299 <span class="keywordflow">do</span>
245 <a name="l00300"></a>00300 {
246 <a name="l00301"></a>00301 <span class="comment">/* Reading the coefficients */</span>
247 <a name="l00302"></a>00302 b0 = *pCoeffs++;
248 <a name="l00303"></a>00303 b1 = *pCoeffs++;
249 <a name="l00304"></a>00304 b2 = *pCoeffs++;
250 <a name="l00305"></a>00305 a1 = *pCoeffs++;
251 <a name="l00306"></a>00306 a2 = *pCoeffs++;
252 <a name="l00307"></a>00307
253 <a name="l00308"></a>00308 <span class="comment">/*Reading the state values */</span>
254 <a name="l00309"></a>00309 d1 = pState[0];
255 <a name="l00310"></a>00310 d2 = pState[1];
256 <a name="l00311"></a>00311
257 <a name="l00312"></a>00312
258 <a name="l00313"></a>00313 sample = <a class="code" href="arm__fir__example__f32_8c.html#ab6558f40a619c2502fbc24c880fd4fb0">blockSize</a>;
259 <a name="l00314"></a>00314
260 <a name="l00315"></a>00315 <span class="keywordflow">while</span>(sample > 0u)
261 <a name="l00316"></a>00316 {
262 <a name="l00317"></a>00317 <span class="comment">/* Read the input */</span>
263 <a name="l00318"></a>00318 Xn = *pIn++;
264 <a name="l00319"></a>00319
265 <a name="l00320"></a>00320 <span class="comment">/* y[n] = b0 * x[n] + d1 */</span>
266 <a name="l00321"></a>00321 acc0 = (b0 * Xn) + d1;
267 <a name="l00322"></a>00322
268 <a name="l00323"></a>00323 <span class="comment">/* Store the result in the accumulator in the destination buffer. */</span>
269 <a name="l00324"></a>00324 *pOut++ = acc0;
270 <a name="l00325"></a>00325
271 <a name="l00326"></a>00326 <span class="comment">/* Every time after the output is computed state should be updated. */</span>
272 <a name="l00327"></a>00327 <span class="comment">/* d1 = b1 * x[n] + a1 * y[n] + d2 */</span>
273 <a name="l00328"></a>00328 d1 = ((b1 * Xn) + (a1 * acc0)) + d2;
274 <a name="l00329"></a>00329
275 <a name="l00330"></a>00330 <span class="comment">/* d2 = b2 * x[n] + a2 * y[n] */</span>
276 <a name="l00331"></a>00331 d2 = (b2 * Xn) + (a2 * acc0);
277 <a name="l00332"></a>00332
278 <a name="l00333"></a>00333 <span class="comment">/* decrement the loop counter */</span>
279 <a name="l00334"></a>00334 sample--;
280 <a name="l00335"></a>00335 }
281 <a name="l00336"></a>00336
282 <a name="l00337"></a>00337 <span class="comment">/* Store the updated state variables back into the state array */</span>
283 <a name="l00338"></a>00338 *pState++ = d1;
284 <a name="l00339"></a>00339 *pState++ = d2;
285 <a name="l00340"></a>00340
286 <a name="l00341"></a>00341 <span class="comment">/* The current stage input is given as the output to the next stage */</span>
287 <a name="l00342"></a>00342 pIn = pDst;
288 <a name="l00343"></a>00343
289 <a name="l00344"></a>00344 <span class="comment">/*Reset the output working pointer */</span>
290 <a name="l00345"></a>00345 pOut = pDst;
291 <a name="l00346"></a>00346
292 <a name="l00347"></a>00347 <span class="comment">/* decrement the loop counter */</span>
293 <a name="l00348"></a>00348 stage--;
294 <a name="l00349"></a>00349
295 <a name="l00350"></a>00350 } <span class="keywordflow">while</span>(stage > 0u);
296 <a name="l00351"></a>00351
297 <a name="l00352"></a>00352 <span class="preprocessor">#endif </span><span class="comment">/* #ifndef ARM_MATH_CM0 */</span>
298 <a name="l00353"></a>00353
299 <a name="l00354"></a>00354 }
300 <a name="l00355"></a>00355
301 <a name="l00356"></a>00356
304 <!--- window showing the filter options -->
305 <div id="MSearchSelectWindow"
306 onmouseover="return searchBox.OnSearchSelectShow()"
307 onmouseout="return searchBox.OnSearchSelectHide()"
308 onkeydown="return searchBox.OnSearchSelectKey(event)">
309 <a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Data Structures</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Defines</a></div>
311 <!-- iframe showing the search results (closed by default) -->
312 <div id="MSearchResultsWindow">
313 <iframe src="" frameborder="0"
314 name="MSearchResults" id="MSearchResults">
318 <hr class="footer"/><address class="footer"><small>Generated on Fri Jul 15 2011 13:16:15 for CMSIS DSP Software Library by 
319 <a href="http://www.doxygen.org/index.html">
320 <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.2 </small></address>
projects / fw / stlink / blob