00001 /*This file is prepared for Doxygen automatic documentation generation.*/ 00015 /* Copyright (c) 2009 Atmel Corporation. All rights reserved. 00016 * 00017 * Redistribution and use in source and binary forms, with or without 00018 * modification, are permitted provided that the following conditions are met: 00019 * 00020 * 1. Redistributions of source code must retain the above copyright notice, this 00021 * list of conditions and the following disclaimer. 00022 * 00023 * 2. Redistributions in binary form must reproduce the above copyright notice, 00024 * this list of conditions and the following disclaimer in the documentation 00025 * and/or other materials provided with the distribution. 00026 * 00027 * 3. The name of Atmel may not be used to endorse or promote products derived 00028 * from this software without specific prior written permission. 00029 * 00030 * 4. This software may only be redistributed and used in connection with an Atmel 00031 * AVR product. 00032 * 00033 * THIS SOFTWARE IS PROVIDED BY ATMEL "AS IS" AND ANY EXPRESS OR IMPLIED 00034 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 00035 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT ARE 00036 * EXPRESSLY AND SPECIFICALLY DISCLAIMED. IN NO EVENT SHALL ATMEL BE LIABLE FOR 00037 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 00038 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 00039 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND 00040 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 00041 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00042 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE 00043 * 00044 */ 00045 00046 #include "dsp.h" 00047 #include "preprocessor.h" 00048 00049 #if defined(FORCE_ALL_GENERICS) || \ 00050 defined(FORCE_GENERIC_VECT16_MIN) || \ 00051 !defined(TARGET_SPECIFIC_VECT16_MIN) 00052 00053 #define DSP16_MINIMUM(x_num, data) \ 00054 if (min > vect1[x_num]) \ 00055 min = vect1[x_num]; 00056 00057 /********************************************************************************************* 00058 * This function is the ending function of the minimum. It is used to compute the last items of a vector. 00059 *********************************************************************************************/ 00060 #define DSP16_MIN_KERNEL_X_FCT(x_num, data) \ 00061 static dsp16_t TPASTE2(dsp16_vect_min_kernel_x, x_num)(dsp16_t *vect1, dsp16_t min) \ 00062 { \ 00063 MREPEAT(x_num, DSP16_MINIMUM, ""); \ 00064 return min; \ 00065 } 00066 /*********************************************************************************************/ 00067 00068 DSP16_MIN_KERNEL_X_FCT(0, "") 00069 DSP16_MIN_KERNEL_X_FCT(1, "") 00070 DSP16_MIN_KERNEL_X_FCT(2, "") 00071 DSP16_MIN_KERNEL_X_FCT(3, "") 00072 00073 dsp16_t dsp16_vect_min(dsp16_t *vect1, int size) 00074 { 00075 typedef dsp16_t (*min_kernel_opti_t)(dsp16_t *, dsp16_t); 00076 static const min_kernel_opti_t min_end_kernel_opti[4] = { 00077 dsp16_vect_min_kernel_x0, 00078 dsp16_vect_min_kernel_x1, 00079 dsp16_vect_min_kernel_x2, 00080 dsp16_vect_min_kernel_x3 00081 }; 00082 int n; 00083 dsp16_t min = (dsp16_t) DSP_Q_MAX(DSP16_QA, DSP16_QB); 00084 00085 for(n=0; n<size-3; n+=4) 00086 { 00087 DSP16_MINIMUM(n, "") 00088 DSP16_MINIMUM(n+1, "") 00089 DSP16_MINIMUM(n+2, "") 00090 DSP16_MINIMUM(n+3, "") 00091 } 00092 00093 // Jump on different functions depending on the length of the vectors to compute 00094 return min_end_kernel_opti[size&0x3](&vect1[n], min); 00095 } 00096 00097 #endif