1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248
|
// Misc C stuff for sfArk/daArk
// Copyright 1998-2000 Andy Inman
// Contact via: http://netgenius.co.uk or http://melodymachine.com
// This file is part of sfArkLib.
//
// sfArkLib is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// sfArkLib is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with sfArkLib. If not, see <http://www.gnu.org/licenses/>.
#include "wcc.h"
#include <stdio.h>
#include <string.h>
// =========================================================================
void UnBufDif2(AWORD *OutBuf, const AWORD *InBuf, USHORT bufsize, AWORD *prev)
{
// NB: This code is optimised for speed - do not change order of operations or data types!!!
// -----------------------------------------------------------------------------------------
#if 0
const AWORD *bufend1 = InBuf + bufsize;
// Process start of buffer...
*OutBuf++ = *InBuf++ + *prev;
// Process rest of buffer...
#define STEPSIZE 8
#define DO_ONE(N) OutBuf[N] = InBuf[N] + OutBuf[N-1];
// ----------------------------------------------------
const AWORD *bufend2 = bufend1 - STEPSIZE;
while (InBuf < bufend2)
{
DO_ONE(0); DO_ONE(1); DO_ONE(2); DO_ONE(3);
DO_ONE(4); DO_ONE(5); DO_ONE(6); DO_ONE(7);
OutBuf += STEPSIZE; InBuf += STEPSIZE;
}
// Do final few...
while (InBuf < bufend1) { DO_ONE(0); OutBuf++; InBuf++; };
*prev = OutBuf[-1];
#else
const AWORD *bufend1 = OutBuf + bufsize;
//for (int i = 0; i < bufsize; i++) OutBuf[i] = InBuf[i];
memcpy(OutBuf, InBuf, bufsize*sizeof(AWORD));
// Process start of buffer...
*OutBuf++ += *prev;
// Process rest of buffer...
#define STEPSIZE 8
#define DO_ONE(N) OutBuf[N] += OutBuf[N-1];
// ----------------------------------------------------
const AWORD *bufend2 = bufend1 - STEPSIZE;
while (OutBuf < bufend2)
{
DO_ONE(0); DO_ONE(1); DO_ONE(2); DO_ONE(3);
DO_ONE(4); DO_ONE(5); DO_ONE(6); DO_ONE(7);
OutBuf += STEPSIZE;
}
// Do final few...
while (OutBuf < bufend1) {
*OutBuf += OutBuf[-1];
OutBuf++;
};
*prev = OutBuf[-1];
#endif
return;
#undef DO_ONE
#undef STEPSIZE
}
// =========================================================================
void old_UnBufDif3(AWORD *OutBuf, const AWORD *InBuf, USHORT bufsize, AWORD *prev)
{
// Decoding is done from the END of the buffer, backwards...
const AWORD *bufstart = InBuf;
InBuf += bufsize-1;
OutBuf+= bufsize-1;
// Process end of buffer...
*OutBuf-- = *InBuf--;
//-----------------------------------------
#define DO_ONE(N) OutBuf[N] = InBuf[N] + NSDIV(InBuf[N-1] + OutBuf[N+1], 1);
// Process rest of buffer...
while (InBuf > bufstart) { DO_ONE(0); InBuf--; OutBuf--; }
// Final word
*OutBuf = *InBuf + NSDIV(OutBuf[1], 1);
*prev = OutBuf[bufsize-1];
return;
#undef DO_ONE
}
void UnBufDif3(AWORD *OutBuf, const AWORD *InBuf, USHORT bufsize, AWORD *prev)
{
// Decoding is done from the END of the buffer, backwards...
#define STEPSIZE 8
const AWORD *bufstart = InBuf, *bufstart1 = InBuf+STEPSIZE;
InBuf += bufsize-1;
OutBuf+= bufsize-1;
// Process end of buffer...
*OutBuf-- = *InBuf--;
// Process rest of buffer...
//-----------------------------------------
#define DO_ONE(N) OutBuf[N] = InBuf[N] + NSDIV(InBuf[N-1] + OutBuf[N+1], 1);
//-----------------------------------------
// Process most of buffer...
while (InBuf > bufstart1)
{
DO_ONE(0); DO_ONE(-1);DO_ONE(-2);DO_ONE(-3);
DO_ONE(-4);DO_ONE(-5);DO_ONE(-6);DO_ONE(-7);
InBuf-=STEPSIZE; OutBuf-=STEPSIZE;
}
// Process rest of buffer...
while (InBuf > bufstart) { DO_ONE(0); InBuf--; OutBuf--; }
// Final word
*OutBuf = *InBuf + NSDIV(OutBuf[1], 1);
*prev = OutBuf[bufsize-1];
return;
#undef DO_ONE
#undef STEPSIZE
}
// =========================================================================
void UnBufDif4(AWORD *OutBuf, const AWORD *InBuf, USHORT bufsize, AWORD *prev)
{
AWORD avg = *prev;
const AWORD *bufend1 = InBuf + bufsize;
// Process rest of buffer...
//-----------------------------------------
#define STEPSIZE 8
const AWORD *bufend2 = bufend1 - STEPSIZE;
#define DO_ONE(N) \
OutBuf[N] = InBuf[N] + avg; \
avg += SDIV(InBuf[N], 1); \
//-----------------------------------------
for (; InBuf < bufend2; InBuf += STEPSIZE, OutBuf += STEPSIZE)
{
DO_ONE(0); DO_ONE(1); DO_ONE(2); DO_ONE(3);
DO_ONE(4); DO_ONE(5); DO_ONE(6); DO_ONE(7);
}
for (; InBuf < bufend1; ++InBuf, ++OutBuf)
{
DO_ONE(0);
}
*prev = avg;
return;
#undef DO_ONE
#undef STEPSIZE
}
// =========================================================================
long BufSum(const AWORD *buf, USHORT bufsize)
{
// --- Optimised! ---
long Total = 0;
const AWORD *endp1 = buf + bufsize - 7;
const AWORD *endp2 = buf + bufsize;
for (; buf < endp1; buf += 8)
{
Total += QUICKABS2(buf[0]) + QUICKABS2(buf[1]) + QUICKABS2(buf[2]) + QUICKABS2(buf[3])
+ QUICKABS2(buf[4]) + QUICKABS2(buf[5]) + QUICKABS2(buf[6]) + QUICKABS2(buf[7]);
}
for ( ; buf < endp2; ++buf)
Total += QUICKABS2(*buf);
return Total;
}
// =========================================================================
void UnBufShift1(AWORD *InBuf, USHORT bufsize, short Shift)
{
#define STEPSIZE 8
// Ok, now we have a shift value - perform the shift...
AWORD *bps = InBuf, *bufend1s = bps + bufsize;
AWORD *bufend2s = bufend1s - STEPSIZE;
#define DO_ONE(I) bps[I] <<= Shift
while (bps < bufend2s)
{
DO_ONE(0); DO_ONE(1); DO_ONE(2); DO_ONE(3);
DO_ONE(4); DO_ONE(5); DO_ONE(6); DO_ONE(7);
bps += STEPSIZE;
}
// Do final few...
while (bps < bufend1s) { DO_ONE(0); bps++; };
return;
#undef DO_ONE
#undef STEPSIZE
}
// =========================================================================
void UnBufShift(AWORD *InBuf, USHORT bufsize, short *shift)
{
for(AWORD *endp = InBuf + bufsize; InBuf < endp; InBuf+= SHIFTWIN)
{
short s = *shift++;
if (s != 0) UnBufShift1(InBuf, SHIFTWIN, s);
}
return;
}
// =========================================================================
|