CMSIS DSP Lib
Fork of mbed-dsp by
cmsis_dsp/StatisticsFunctions/arm_max_f32.c@4:9cee975aadce, 2014-06-23 (annotated)
- Committer:
- mbed_official
- Date:
- Mon Jun 23 09:30:09 2014 +0100
- Revision:
- 4:9cee975aadce
- Parent:
- 3:7a284390b0ce
Synchronized with git revision 6e7c7bcec41226f536474daae3c13d49e4c0e865
Full URL: https://github.com/mbedmicro/mbed/commit/6e7c7bcec41226f536474daae3c13d49e4c0e865/
Fix signed unsigned compare in dsp library
Who changed what in which revision?
User | Revision | Line number | New contents of line |
---|---|---|---|
emilmont | 1:fdd22bb7aa52 | 1 | /* ---------------------------------------------------------------------- |
mbed_official | 3:7a284390b0ce | 2 | * Copyright (C) 2010-2013 ARM Limited. All rights reserved. |
emilmont | 1:fdd22bb7aa52 | 3 | * |
mbed_official | 3:7a284390b0ce | 4 | * $Date: 17. January 2013 |
mbed_official | 3:7a284390b0ce | 5 | * $Revision: V1.4.1 |
emilmont | 1:fdd22bb7aa52 | 6 | * |
emilmont | 2:da51fb522205 | 7 | * Project: CMSIS DSP Library |
emilmont | 2:da51fb522205 | 8 | * Title: arm_max_f32.c |
emilmont | 1:fdd22bb7aa52 | 9 | * |
emilmont | 2:da51fb522205 | 10 | * Description: Maximum value of a floating-point vector. |
emilmont | 1:fdd22bb7aa52 | 11 | * |
emilmont | 1:fdd22bb7aa52 | 12 | * Target Processor: Cortex-M4/Cortex-M3/Cortex-M0 |
emilmont | 1:fdd22bb7aa52 | 13 | * |
mbed_official | 3:7a284390b0ce | 14 | * Redistribution and use in source and binary forms, with or without |
mbed_official | 3:7a284390b0ce | 15 | * modification, are permitted provided that the following conditions |
mbed_official | 3:7a284390b0ce | 16 | * are met: |
mbed_official | 3:7a284390b0ce | 17 | * - Redistributions of source code must retain the above copyright |
mbed_official | 3:7a284390b0ce | 18 | * notice, this list of conditions and the following disclaimer. |
mbed_official | 3:7a284390b0ce | 19 | * - Redistributions in binary form must reproduce the above copyright |
mbed_official | 3:7a284390b0ce | 20 | * notice, this list of conditions and the following disclaimer in |
mbed_official | 3:7a284390b0ce | 21 | * the documentation and/or other materials provided with the |
mbed_official | 3:7a284390b0ce | 22 | * distribution. |
mbed_official | 3:7a284390b0ce | 23 | * - Neither the name of ARM LIMITED nor the names of its contributors |
mbed_official | 3:7a284390b0ce | 24 | * may be used to endorse or promote products derived from this |
mbed_official | 3:7a284390b0ce | 25 | * software without specific prior written permission. |
mbed_official | 3:7a284390b0ce | 26 | * |
mbed_official | 3:7a284390b0ce | 27 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
mbed_official | 3:7a284390b0ce | 28 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
mbed_official | 3:7a284390b0ce | 29 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS |
mbed_official | 3:7a284390b0ce | 30 | * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE |
mbed_official | 3:7a284390b0ce | 31 | * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, |
mbed_official | 3:7a284390b0ce | 32 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, |
mbed_official | 3:7a284390b0ce | 33 | * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
mbed_official | 3:7a284390b0ce | 34 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER |
mbed_official | 3:7a284390b0ce | 35 | * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
mbed_official | 3:7a284390b0ce | 36 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN |
mbed_official | 3:7a284390b0ce | 37 | * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
mbed_official | 3:7a284390b0ce | 38 | * POSSIBILITY OF SUCH DAMAGE. |
emilmont | 1:fdd22bb7aa52 | 39 | * ---------------------------------------------------------------------------- */ |
emilmont | 1:fdd22bb7aa52 | 40 | |
emilmont | 1:fdd22bb7aa52 | 41 | #include "arm_math.h" |
emilmont | 1:fdd22bb7aa52 | 42 | |
emilmont | 1:fdd22bb7aa52 | 43 | /** |
emilmont | 1:fdd22bb7aa52 | 44 | * @ingroup groupStats |
emilmont | 1:fdd22bb7aa52 | 45 | */ |
emilmont | 1:fdd22bb7aa52 | 46 | |
emilmont | 1:fdd22bb7aa52 | 47 | /** |
emilmont | 1:fdd22bb7aa52 | 48 | * @defgroup Max Maximum |
emilmont | 1:fdd22bb7aa52 | 49 | * |
emilmont | 1:fdd22bb7aa52 | 50 | * Computes the maximum value of an array of data. |
emilmont | 1:fdd22bb7aa52 | 51 | * The function returns both the maximum value and its position within the array. |
emilmont | 1:fdd22bb7aa52 | 52 | * There are separate functions for floating-point, Q31, Q15, and Q7 data types. |
emilmont | 1:fdd22bb7aa52 | 53 | */ |
emilmont | 1:fdd22bb7aa52 | 54 | |
emilmont | 1:fdd22bb7aa52 | 55 | /** |
emilmont | 1:fdd22bb7aa52 | 56 | * @addtogroup Max |
emilmont | 1:fdd22bb7aa52 | 57 | * @{ |
emilmont | 1:fdd22bb7aa52 | 58 | */ |
emilmont | 1:fdd22bb7aa52 | 59 | |
emilmont | 1:fdd22bb7aa52 | 60 | |
emilmont | 1:fdd22bb7aa52 | 61 | /** |
emilmont | 1:fdd22bb7aa52 | 62 | * @brief Maximum value of a floating-point vector. |
emilmont | 1:fdd22bb7aa52 | 63 | * @param[in] *pSrc points to the input vector |
emilmont | 1:fdd22bb7aa52 | 64 | * @param[in] blockSize length of the input vector |
emilmont | 1:fdd22bb7aa52 | 65 | * @param[out] *pResult maximum value returned here |
emilmont | 1:fdd22bb7aa52 | 66 | * @param[out] *pIndex index of maximum value returned here |
emilmont | 1:fdd22bb7aa52 | 67 | * @return none. |
emilmont | 1:fdd22bb7aa52 | 68 | */ |
emilmont | 1:fdd22bb7aa52 | 69 | |
emilmont | 1:fdd22bb7aa52 | 70 | void arm_max_f32( |
emilmont | 1:fdd22bb7aa52 | 71 | float32_t * pSrc, |
emilmont | 1:fdd22bb7aa52 | 72 | uint32_t blockSize, |
emilmont | 1:fdd22bb7aa52 | 73 | float32_t * pResult, |
emilmont | 1:fdd22bb7aa52 | 74 | uint32_t * pIndex) |
emilmont | 1:fdd22bb7aa52 | 75 | { |
mbed_official | 3:7a284390b0ce | 76 | #ifndef ARM_MATH_CM0_FAMILY |
emilmont | 1:fdd22bb7aa52 | 77 | |
emilmont | 1:fdd22bb7aa52 | 78 | /* Run the below code for Cortex-M4 and Cortex-M3 */ |
emilmont | 1:fdd22bb7aa52 | 79 | float32_t maxVal1, maxVal2, out; /* Temporary variables to store the output value. */ |
emilmont | 1:fdd22bb7aa52 | 80 | uint32_t blkCnt, outIndex, count; /* loop counter */ |
emilmont | 1:fdd22bb7aa52 | 81 | |
emilmont | 1:fdd22bb7aa52 | 82 | /* Initialise the count value. */ |
emilmont | 1:fdd22bb7aa52 | 83 | count = 0u; |
emilmont | 1:fdd22bb7aa52 | 84 | /* Initialise the index value to zero. */ |
emilmont | 1:fdd22bb7aa52 | 85 | outIndex = 0u; |
emilmont | 1:fdd22bb7aa52 | 86 | /* Load first input value that act as reference value for comparision */ |
emilmont | 1:fdd22bb7aa52 | 87 | out = *pSrc++; |
emilmont | 1:fdd22bb7aa52 | 88 | |
emilmont | 1:fdd22bb7aa52 | 89 | /* Loop unrolling */ |
emilmont | 1:fdd22bb7aa52 | 90 | blkCnt = (blockSize - 1u) >> 2u; |
emilmont | 1:fdd22bb7aa52 | 91 | |
emilmont | 1:fdd22bb7aa52 | 92 | /* Run the below code for Cortex-M4 and Cortex-M3 */ |
emilmont | 1:fdd22bb7aa52 | 93 | while(blkCnt > 0u) |
emilmont | 1:fdd22bb7aa52 | 94 | { |
emilmont | 1:fdd22bb7aa52 | 95 | /* Initialize maxVal to the next consecutive values one by one */ |
emilmont | 1:fdd22bb7aa52 | 96 | maxVal1 = *pSrc++; |
emilmont | 1:fdd22bb7aa52 | 97 | |
emilmont | 1:fdd22bb7aa52 | 98 | maxVal2 = *pSrc++; |
emilmont | 1:fdd22bb7aa52 | 99 | |
emilmont | 1:fdd22bb7aa52 | 100 | /* compare for the maximum value */ |
emilmont | 1:fdd22bb7aa52 | 101 | if(out < maxVal1) |
emilmont | 1:fdd22bb7aa52 | 102 | { |
emilmont | 1:fdd22bb7aa52 | 103 | /* Update the maximum value and its index */ |
emilmont | 1:fdd22bb7aa52 | 104 | out = maxVal1; |
emilmont | 1:fdd22bb7aa52 | 105 | outIndex = count + 1u; |
emilmont | 1:fdd22bb7aa52 | 106 | } |
emilmont | 1:fdd22bb7aa52 | 107 | |
emilmont | 1:fdd22bb7aa52 | 108 | maxVal1 = *pSrc++; |
emilmont | 1:fdd22bb7aa52 | 109 | |
emilmont | 1:fdd22bb7aa52 | 110 | /* compare for the maximum value */ |
emilmont | 1:fdd22bb7aa52 | 111 | if(out < maxVal2) |
emilmont | 1:fdd22bb7aa52 | 112 | { |
emilmont | 1:fdd22bb7aa52 | 113 | /* Update the maximum value and its index */ |
emilmont | 1:fdd22bb7aa52 | 114 | out = maxVal2; |
emilmont | 1:fdd22bb7aa52 | 115 | outIndex = count + 2u; |
emilmont | 1:fdd22bb7aa52 | 116 | } |
emilmont | 1:fdd22bb7aa52 | 117 | |
emilmont | 1:fdd22bb7aa52 | 118 | maxVal2 = *pSrc++; |
emilmont | 1:fdd22bb7aa52 | 119 | |
emilmont | 1:fdd22bb7aa52 | 120 | /* compare for the maximum value */ |
emilmont | 1:fdd22bb7aa52 | 121 | if(out < maxVal1) |
emilmont | 1:fdd22bb7aa52 | 122 | { |
emilmont | 1:fdd22bb7aa52 | 123 | /* Update the maximum value and its index */ |
emilmont | 1:fdd22bb7aa52 | 124 | out = maxVal1; |
emilmont | 1:fdd22bb7aa52 | 125 | outIndex = count + 3u; |
emilmont | 1:fdd22bb7aa52 | 126 | } |
emilmont | 1:fdd22bb7aa52 | 127 | |
emilmont | 1:fdd22bb7aa52 | 128 | /* compare for the maximum value */ |
emilmont | 1:fdd22bb7aa52 | 129 | if(out < maxVal2) |
emilmont | 1:fdd22bb7aa52 | 130 | { |
emilmont | 1:fdd22bb7aa52 | 131 | /* Update the maximum value and its index */ |
emilmont | 1:fdd22bb7aa52 | 132 | out = maxVal2; |
emilmont | 1:fdd22bb7aa52 | 133 | outIndex = count + 4u; |
emilmont | 1:fdd22bb7aa52 | 134 | } |
emilmont | 1:fdd22bb7aa52 | 135 | |
emilmont | 1:fdd22bb7aa52 | 136 | count += 4u; |
emilmont | 1:fdd22bb7aa52 | 137 | |
emilmont | 1:fdd22bb7aa52 | 138 | /* Decrement the loop counter */ |
emilmont | 1:fdd22bb7aa52 | 139 | blkCnt--; |
emilmont | 1:fdd22bb7aa52 | 140 | } |
emilmont | 1:fdd22bb7aa52 | 141 | |
emilmont | 1:fdd22bb7aa52 | 142 | /* if (blockSize - 1u) is not multiple of 4 */ |
emilmont | 1:fdd22bb7aa52 | 143 | blkCnt = (blockSize - 1u) % 4u; |
emilmont | 1:fdd22bb7aa52 | 144 | |
emilmont | 1:fdd22bb7aa52 | 145 | #else |
emilmont | 1:fdd22bb7aa52 | 146 | |
emilmont | 1:fdd22bb7aa52 | 147 | /* Run the below code for Cortex-M0 */ |
emilmont | 1:fdd22bb7aa52 | 148 | float32_t maxVal1, out; /* Temporary variables to store the output value. */ |
emilmont | 1:fdd22bb7aa52 | 149 | uint32_t blkCnt, outIndex; /* loop counter */ |
emilmont | 1:fdd22bb7aa52 | 150 | |
emilmont | 1:fdd22bb7aa52 | 151 | /* Initialise the index value to zero. */ |
emilmont | 1:fdd22bb7aa52 | 152 | outIndex = 0u; |
emilmont | 1:fdd22bb7aa52 | 153 | /* Load first input value that act as reference value for comparision */ |
emilmont | 1:fdd22bb7aa52 | 154 | out = *pSrc++; |
emilmont | 1:fdd22bb7aa52 | 155 | |
emilmont | 1:fdd22bb7aa52 | 156 | blkCnt = (blockSize - 1u); |
emilmont | 1:fdd22bb7aa52 | 157 | |
mbed_official | 3:7a284390b0ce | 158 | #endif /* #ifndef ARM_MATH_CM0_FAMILY */ |
emilmont | 1:fdd22bb7aa52 | 159 | |
emilmont | 1:fdd22bb7aa52 | 160 | while(blkCnt > 0u) |
emilmont | 1:fdd22bb7aa52 | 161 | { |
emilmont | 1:fdd22bb7aa52 | 162 | /* Initialize maxVal to the next consecutive values one by one */ |
emilmont | 1:fdd22bb7aa52 | 163 | maxVal1 = *pSrc++; |
emilmont | 1:fdd22bb7aa52 | 164 | |
emilmont | 1:fdd22bb7aa52 | 165 | /* compare for the maximum value */ |
emilmont | 1:fdd22bb7aa52 | 166 | if(out < maxVal1) |
emilmont | 1:fdd22bb7aa52 | 167 | { |
emilmont | 1:fdd22bb7aa52 | 168 | /* Update the maximum value and it's index */ |
emilmont | 1:fdd22bb7aa52 | 169 | out = maxVal1; |
emilmont | 1:fdd22bb7aa52 | 170 | outIndex = blockSize - blkCnt; |
emilmont | 1:fdd22bb7aa52 | 171 | } |
emilmont | 1:fdd22bb7aa52 | 172 | |
emilmont | 1:fdd22bb7aa52 | 173 | |
emilmont | 1:fdd22bb7aa52 | 174 | /* Decrement the loop counter */ |
emilmont | 1:fdd22bb7aa52 | 175 | blkCnt--; |
emilmont | 1:fdd22bb7aa52 | 176 | |
emilmont | 1:fdd22bb7aa52 | 177 | } |
emilmont | 1:fdd22bb7aa52 | 178 | |
emilmont | 1:fdd22bb7aa52 | 179 | /* Store the maximum value and it's index into destination pointers */ |
emilmont | 1:fdd22bb7aa52 | 180 | *pResult = out; |
emilmont | 1:fdd22bb7aa52 | 181 | *pIndex = outIndex; |
emilmont | 1:fdd22bb7aa52 | 182 | } |
emilmont | 1:fdd22bb7aa52 | 183 | |
emilmont | 1:fdd22bb7aa52 | 184 | /** |
emilmont | 1:fdd22bb7aa52 | 185 | * @} end of Max group |
emilmont | 1:fdd22bb7aa52 | 186 | */ |