Changes in directory llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm:
LICENSE added (r1.1)
Makefile added (r1.1)
README.MB added (r1.1)
adpcm.c added (r1.1)
adpcm.h added (r1.1)
large.adpcm added (r1.1)
rawdaudio.c added (r1.1)
---
Log message:
initial recheckin of mibench
---
Diffs of the changes: (+344 -0)
LICENSE | 24 +++++
Makefile | 7 +
README.MB | 13 +++
adpcm.c | 252 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
adpcm.h | 19 ++++
large.adpcm | 0
rawdaudio.c | 29 ++++++
7 files changed, 344 insertions(+)
Index: llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/LICENSE
diff -c /dev/null
llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/LICENSE:1.1
*** /dev/null Tue Jan 9 17:57:29 2007
--- llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/LICENSE Tue Jan
9 17:57:19 2007
***************
*** 0 ****
--- 1,24 ----
+ /***********************************************************
+ Copyright 1992 by Stichting Mathematisch Centrum, Amsterdam, The
+ Netherlands.
+
+ All Rights Reserved
+
+ Permission to use, copy, modify, and distribute this software and its
+ documentation for any purpose and without fee is hereby granted,
+ provided that the above copyright notice appear in all copies and that
+ both that copyright notice and this permission notice appear in
+ supporting documentation, and that the names of Stichting Mathematisch
+ Centrum or CWI not be used in advertising or publicity pertaining to
+ distribution of the software without specific, written prior permission.
+
+ STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO
+ THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
+ FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE
+ FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+ WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
+ OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+
+ ******************************************************************/
+
Index: llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/Makefile
diff -c /dev/null
llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/Makefile:1.1
*** /dev/null Tue Jan 9 17:57:54 2007
--- llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/Makefile Tue Jan
9 17:57:19 2007
***************
*** 0 ****
--- 1,7 ----
+ LEVEL = ../../../..
+
+ PROG = telecomm-adpcm
+ LDFLAGS = -lm
+ RUN_OPTIONS = < large.adpcm
+
+ include $(LEVEL)/MultiSource/Makefile.multisrc
Index: llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/README.MB
diff -c /dev/null
llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/README.MB:1.1
*** /dev/null Tue Jan 9 17:57:54 2007
--- llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/README.MB Tue Jan
9 17:57:19 2007
***************
*** 0 ****
--- 1,13 ----
+ ==================================
+ README -- by authors of MediaBench
+ ==================================
+
+ Compiling:
+ To compile this package, go to subdirectory ./src and
+ invoke "make all." This should work on most systems with
+ gcc. Note that on machines other than Sun Sparcs, the
+ compiler switch -mv8 should not be used.
+
+ Running the programs:
+ There are two scripts in the ./bin subdirectory: one for
+ adpcm encoding and the other for adpcm decoding.
Index: llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/adpcm.c
diff -c /dev/null
llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/adpcm.c:1.1
*** /dev/null Tue Jan 9 17:57:54 2007
--- llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/adpcm.c Tue Jan
9 17:57:19 2007
***************
*** 0 ****
--- 1,252 ----
+ /***********************************************************
+ Copyright 1992 by Stichting Mathematisch Centrum, Amsterdam, The
+ Netherlands.
+
+ All Rights Reserved
+
+ Permission to use, copy, modify, and distribute this software and its
+ documentation for any purpose and without fee is hereby granted,
+ provided that the above copyright notice appear in all copies and that
+ both that copyright notice and this permission notice appear in
+ supporting documentation, and that the names of Stichting Mathematisch
+ Centrum or CWI not be used in advertising or publicity pertaining to
+ distribution of the software without specific, written prior permission.
+
+ STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO
+ THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
+ FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE
+ FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+ WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
+ OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+
+ ******************************************************************/
+
+ /*
+ ** Intel/DVI ADPCM coder/decoder.
+ **
+ ** The algorithm for this coder was taken from the IMA Compatability Project
+ ** proceedings, Vol 2, Number 2; May 1992.
+ **
+ ** Version 1.2, 18-Dec-92.
+ **
+ ** Change log:
+ ** - Fixed a stupid bug, where the delta was computed as
+ ** stepsize*code/4 in stead of stepsize*(code+0.5)/4.
+ ** - There was an off-by-one error causing it to pick
+ ** an incorrect delta once in a blue moon.
+ ** - The NODIVMUL define has been removed. Computations are now always done
+ ** using shifts, adds and subtracts. It turned out that, because the
standard
+ ** is defined using shift/add/subtract, you needed bits of fixup code
+ ** (because the div/mul simulation using shift/add/sub made some rounding
+ ** errors that real div/mul don't make) and all together the resultant code
+ ** ran slower than just using the shifts all the time.
+ ** - Changed some of the variable names to be more meaningful.
+ */
+
+ #include "adpcm.h"
+ #include <stdio.h> /*DBG*/
+
+ #ifndef __STDC__
+ #define signed
+ #endif
+
+ /* Intel ADPCM step variation table */
+ static int indexTable[16] = {
+ -1, -1, -1, -1, 2, 4, 6, 8,
+ -1, -1, -1, -1, 2, 4, 6, 8,
+ };
+
+ static int stepsizeTable[89] = {
+ 7, 8, 9, 10, 11, 12, 13, 14, 16, 17,
+ 19, 21, 23, 25, 28, 31, 34, 37, 41, 45,
+ 50, 55, 60, 66, 73, 80, 88, 97, 107, 118,
+ 130, 143, 157, 173, 190, 209, 230, 253, 279, 307,
+ 337, 371, 408, 449, 494, 544, 598, 658, 724, 796,
+ 876, 963, 1060, 1166, 1282, 1411, 1552, 1707, 1878, 2066,
+ 2272, 2499, 2749, 3024, 3327, 3660, 4026, 4428, 4871, 5358,
+ 5894, 6484, 7132, 7845, 8630, 9493, 10442, 11487, 12635, 13899,
+ 15289, 16818, 18500, 20350, 22385, 24623, 27086, 29794, 32767
+ };
+
+ void
+ adpcm_coder(indata, outdata, len, state)
+ short indata[];
+ char outdata[];
+ int len;
+ struct adpcm_state *state;
+ {
+ short *inp; /* Input buffer pointer */
+ signed char *outp; /* output buffer pointer */
+ int val; /* Current input sample value */
+ int sign; /* Current adpcm sign bit */
+ int delta; /* Current adpcm output value */
+ int diff; /* Difference between val and valprev */
+ int step; /* Stepsize */
+ int valpred; /* Predicted output value */
+ int vpdiff; /* Current change to valpred */
+ int index; /* Current step change index */
+ int outputbuffer; /* place to keep previous 4-bit value */
+ int bufferstep; /* toggle between outputbuffer/output */
+
+ outp = (signed char *)outdata;
+ inp = indata;
+
+ valpred = state->valprev;
+ index = state->index;
+ step = stepsizeTable[index];
+
+ bufferstep = 1;
+
+ for ( ; len > 0 ; len-- ) {
+ val = *inp++;
+
+ /* Step 1 - compute difference with previous value */
+ diff = val - valpred;
+ sign = (diff < 0) ? 8 : 0;
+ if ( sign ) diff = (-diff);
+
+ /* Step 2 - Divide and clamp */
+ /* Note:
+ ** This code *approximately* computes:
+ ** delta = diff*4/step;
+ ** vpdiff = (delta+0.5)*step/4;
+ ** but in shift step bits are dropped. The net result of this is
+ ** that even if you have fast mul/div hardware you cannot put it to
+ ** good use since the fixup would be too expensive.
+ */
+ delta = 0;
+ vpdiff = (step >> 3);
+
+ if ( diff >= step ) {
+ delta = 4;
+ diff -= step;
+ vpdiff += step;
+ }
+ step >>= 1;
+ if ( diff >= step ) {
+ delta |= 2;
+ diff -= step;
+ vpdiff += step;
+ }
+ step >>= 1;
+ if ( diff >= step ) {
+ delta |= 1;
+ vpdiff += step;
+ }
+
+ /* Step 3 - Update previous value */
+ if ( sign )
+ valpred -= vpdiff;
+ else
+ valpred += vpdiff;
+
+ /* Step 4 - Clamp previous value to 16 bits */
+ if ( valpred > 32767 )
+ valpred = 32767;
+ else if ( valpred < -32768 )
+ valpred = -32768;
+
+ /* Step 5 - Assemble value, update index and step values */
+ delta |= sign;
+
+ index += indexTable[delta];
+ if ( index < 0 ) index = 0;
+ if ( index > 88 ) index = 88;
+ step = stepsizeTable[index];
+
+ /* Step 6 - Output value */
+ if ( bufferstep ) {
+ outputbuffer = (delta << 4) & 0xf0;
+ } else {
+ *outp++ = (delta & 0x0f) | outputbuffer;
+ }
+ bufferstep = !bufferstep;
+ }
+
+ /* Output last step, if needed */
+ if ( !bufferstep )
+ *outp++ = outputbuffer;
+
+ state->valprev = valpred;
+ state->index = index;
+ }
+
+ void
+ adpcm_decoder(indata, outdata, len, state)
+ char indata[];
+ short outdata[];
+ int len;
+ struct adpcm_state *state;
+ {
+ signed char *inp; /* Input buffer pointer */
+ short *outp; /* output buffer pointer */
+ int sign; /* Current adpcm sign bit */
+ int delta; /* Current adpcm output value */
+ int step; /* Stepsize */
+ int valpred; /* Predicted value */
+ int vpdiff; /* Current change to valpred */
+ int index; /* Current step change index */
+ int inputbuffer; /* place to keep next 4-bit value */
+ int bufferstep; /* toggle between inputbuffer/input */
+
+ outp = outdata;
+ inp = (signed char *)indata;
+
+ valpred = state->valprev;
+ index = state->index;
+ step = stepsizeTable[index];
+
+ bufferstep = 0;
+
+ for ( ; len > 0 ; len-- ) {
+
+ /* Step 1 - get the delta value */
+ if ( bufferstep ) {
+ delta = inputbuffer & 0xf;
+ } else {
+ inputbuffer = *inp++;
+ delta = (inputbuffer >> 4) & 0xf;
+ }
+ bufferstep = !bufferstep;
+
+ /* Step 2 - Find new index value (for later) */
+ index += indexTable[delta];
+ if ( index < 0 ) index = 0;
+ if ( index > 88 ) index = 88;
+
+ /* Step 3 - Separate sign and magnitude */
+ sign = delta & 8;
+ delta = delta & 7;
+
+ /* Step 4 - Compute difference and new predicted value */
+ /*
+ ** Computes 'vpdiff = (delta+0.5)*step/4', but see comment
+ ** in adpcm_coder.
+ */
+ vpdiff = step >> 3;
+ if ( delta & 4 ) vpdiff += step;
+ if ( delta & 2 ) vpdiff += step>>1;
+ if ( delta & 1 ) vpdiff += step>>2;
+
+ if ( sign )
+ valpred -= vpdiff;
+ else
+ valpred += vpdiff;
+
+ /* Step 5 - clamp output value */
+ if ( valpred > 32767 )
+ valpred = 32767;
+ else if ( valpred < -32768 )
+ valpred = -32768;
+
+ /* Step 6 - Update step value */
+ step = stepsizeTable[index];
+
+ /* Step 7 - Output value */
+ *outp++ = valpred;
+ }
+
+ state->valprev = valpred;
+ state->index = index;
+ }
Index: llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/adpcm.h
diff -c /dev/null
llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/adpcm.h:1.1
*** /dev/null Tue Jan 9 17:57:54 2007
--- llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/adpcm.h Tue Jan
9 17:57:19 2007
***************
*** 0 ****
--- 1,19 ----
+ /*
+ ** adpcm.h - include file for adpcm coder.
+ **
+ ** Version 1.0, 7-Jul-92.
+ */
+
+ struct adpcm_state {
+ short valprev; /* Previous output value */
+ char index; /* Index into stepsize table */
+ };
+
+ #ifdef __STDC__
+ #define ARGS(x) x
+ #else
+ #define ARGS(x) ()
+ #endif
+
+ void adpcm_coder ARGS((short [], char [], int, struct adpcm_state *));
+ void adpcm_decoder ARGS((char [], short [], int, struct adpcm_state *));
Index: llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/large.adpcm
Index: llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/rawdaudio.c
diff -c /dev/null
llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/rawdaudio.c:1.1
*** /dev/null Tue Jan 9 17:57:54 2007
--- llvm-test/MultiSource/Benchmarks/MiBench/telecomm-adpcm/rawdaudio.c Tue Jan
9 17:57:19 2007
***************
*** 0 ****
--- 1,29 ----
+ /* testd - Test adpcm decoder */
+
+ #include "adpcm.h"
+ #include <stdio.h>
+
+ struct adpcm_state state;
+
+ #define NSAMPLES 1000
+
+ char abuf[NSAMPLES/2];
+ short sbuf[NSAMPLES];
+
+ main() {
+ int n;
+
+ while(1) {
+ n = read(0, abuf, NSAMPLES/2);
+ if ( n < 0 ) {
+ perror("input file");
+ exit(1);
+ }
+ if ( n == 0 ) break;
+ adpcm_decoder(abuf, sbuf, n*2, &state);
+ write(1, sbuf, n*4);
+ }
+ fprintf(stderr, "Final valprev=%d, index=%d\n",
+ state.valprev, state.index);
+ exit(0);
+ }
_______________________________________________
llvm-commits mailing list
llvm-commits@cs.uiuc.edu
http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits
