| /* libFLAC - Free Lossless Audio Codec library |
| * Copyright (C) 2000-2009 Josh Coalson |
| * Copyright (C) 2011-2016 Xiph.Org Foundation |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * |
| * - Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * |
| * - Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution. |
| * |
| * - Neither the name of the Xiph.org Foundation nor the names of its |
| * contributors may be used to endorse or promote products derived from |
| * this software without specific prior written permission. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR |
| * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
| * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF |
| * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING |
| * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
| * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| |
| #ifdef HAVE_CONFIG_H |
| # include <config.h> |
| #endif |
| |
| #include <stdio.h> |
| #include <math.h> |
| #include <string.h> |
| #include "FLAC/ordinals.h" |
| #include "share/compat.h" |
| #include "private/bitmath.h" |
| #include "private/fixed.h" |
| #include "private/macros.h" |
| #include "FLAC/assert.h" |
| |
| #include "util.h" |
| |
| static void FLAC__fixed_compute_residual_shift(const FLAC__int32 data[], unsigned data_len, unsigned order, FLAC__int32 residual[]) |
| { |
| const int idata_len = (int) data_len; |
| int i; |
| |
| switch(order) { |
| case 0: |
| FLAC__ASSERT(sizeof(residual[0]) == sizeof(data[0])); |
| memcpy(residual, data, sizeof(residual[0])*data_len); |
| break; |
| case 1: |
| for(i = 0; i < idata_len; i++) |
| residual[i] = data[i] - data[i-1]; |
| break; |
| case 2: |
| for(i = 0; i < idata_len; i++) |
| residual[i] = data[i] - (data[i-1] << 1) + data[i-2]; |
| break; |
| case 3: |
| for(i = 0; i < idata_len; i++) |
| residual[i] = data[i] - (((data[i-1]-data[i-2])<<1) + (data[i-1]-data[i-2])) - data[i-3]; |
| break; |
| case 4: |
| for(i = 0; i < idata_len; i++) |
| residual[i] = data[i] - ((data[i-1]+data[i-3])<<2) + ((data[i-2]<<2) + (data[i-2]<<1)) + data[i-4]; |
| break; |
| default: |
| FLAC__ASSERT(0); |
| } |
| } |
| |
| static void FLAC__fixed_compute_residual_mult(const FLAC__int32 data[], unsigned data_len, unsigned order, FLAC__int32 residual[]) |
| { |
| const int idata_len = (int)data_len; |
| int i; |
| |
| switch(order) { |
| case 0: |
| FLAC__ASSERT(sizeof(residual[0]) == sizeof(data[0])); |
| memcpy(residual, data, sizeof(residual[0])*data_len); |
| break; |
| case 1: |
| for(i = 0; i < idata_len; i++) |
| residual[i] = data[i] - data[i-1]; |
| break; |
| case 2: |
| for(i = 0; i < idata_len; i++) |
| residual[i] = data[i] - 2*data[i-1] + data[i-2]; |
| break; |
| case 3: |
| for(i = 0; i < idata_len; i++) |
| residual[i] = data[i] - 3*data[i-1] + 3*data[i-2] - data[i-3]; |
| break; |
| case 4: |
| for(i = 0; i < idata_len; i++) |
| residual[i] = data[i] - 4*data[i-1] + 6*data[i-2] - 4*data[i-3] + data[i-4]; |
| break; |
| default: |
| FLAC__ASSERT(0); |
| } |
| } |
| |
| static FLAC__int32 data [200000] ; |
| static FLAC__int32 residual [200000] ; |
| |
| static unsigned bench_order = 0 ; |
| |
| static void |
| bench_shift (void) |
| { FLAC__fixed_compute_residual_shift (data, ARRAY_LEN (data), bench_order, residual) ; |
| } |
| |
| static void |
| bench_mult (void) |
| { FLAC__fixed_compute_residual_mult (data, ARRAY_LEN (data), bench_order, residual) ; |
| } |
| |
| int |
| main (void) |
| { bench_stats stats ; |
| |
| puts ("") ; |
| |
| for (bench_order = 2 ; bench_order <= 4 ; bench_order ++) { |
| memset (&stats, 0, sizeof (stats)) ; |
| stats.testfunc = bench_shift ; |
| stats.run_count = 100 ; |
| stats.loop_count = 10 ; |
| |
| benchmark_stats (&stats) ; |
| printf ("shift order %u : %f %f %f %f\n", bench_order, stats.min_time, stats.median_time, stats.mean_time, stats.max_time) ; |
| |
| memset (&stats, 0, sizeof (stats)) ; |
| stats.testfunc = bench_mult ; |
| stats.run_count = 100 ; |
| stats.loop_count = 10 ; |
| |
| benchmark_stats (&stats) ; |
| printf ("mult order %u : %f %f %f %f\n\n", bench_order, stats.min_time, stats.median_time, stats.mean_time, stats.max_time) ; |
| } |
| |
| return 0 ; |
| } |