File: ThePlayer41a.c

package info (click to toggle)
fs-uae 3.2.35-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 28,376 kB
  • sloc: cpp: 257,557; ansic: 121,965; sh: 4,895; makefile: 1,577; python: 446; asm: 275; xml: 10
file content (471 lines) | stat: -rw-r--r-- 11,793 bytes parent folder | download | duplicates (7)
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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
/* testP41A() */
/* Rip_P41A() */
/* Depack_P41A() */

#include "globals.h"
#include "extern.h"


short testP41A ( void )
{
  PW_Start_Address = PW_i;

  /* number of pattern (real) */
  PW_j = in_data[PW_Start_Address+4];
  if ( PW_j > 0x7f )
  {
    return BAD;
  }

  /* number of sample */
  PW_k = in_data[PW_Start_Address+6];
  if ( (PW_k > 0x1F) || (PW_k == 0) )
  {
    return BAD;
  }

  /* test volumes */
  for ( PW_l=0 ; PW_l<PW_k ; PW_l++ )
  {
    if ( in_data[PW_Start_Address+33+PW_l*16] > 0x40 )
    {
      return BAD;
    }
  }

  /* test sample sizes */
  PW_WholeSampleSize = 0;
  for ( PW_l=0 ; PW_l<PW_k ; PW_l++ )
  {
    /* size */
    PW_o = (in_data[PW_Start_Address+24+PW_l*16]*256)+in_data[PW_Start_Address+25+PW_l*16];
    /* loop size */
    PW_n = (in_data[PW_Start_Address+30+PW_l*16]*256)+in_data[PW_Start_Address+31+PW_l*16];
    PW_o *= 2;
    PW_n *= 2;

    if ( (PW_o > 0xFFFF) ||
	 (PW_n > 0xFFFF) )
    {
      return BAD;
    }

    if ( PW_n > (PW_o+2) )
    {
      return BAD;
    }
    PW_WholeSampleSize += PW_o;
  }
  if ( PW_WholeSampleSize <= 4 )
  {
    return BAD;
  }

  /* PW_WholeSampleSize is the size of the sample data .. WRONG !! */
  /* PW_k is the number of samples */
  return GOOD;
}



void Rip_P41A ( void )
{
  PW_l = ( (in_data[PW_Start_Address+16]*256*256*256) +
	   (in_data[PW_Start_Address+17]*256*256) +
	   (in_data[PW_Start_Address+18]*256) +
	   in_data[PW_Start_Address+19] );

  /* get whole sample size */
  PW_o = 0;
  for ( PW_j=0 ; PW_j<PW_k ; PW_j++ )
  {
    PW_m = ( (in_data[PW_Start_Address+20+PW_j*16]*256*256*256) +
	     (in_data[PW_Start_Address+21+PW_j*16]*256*256) +
	     (in_data[PW_Start_Address+22+PW_j*16]*256) +
	     in_data[PW_Start_Address+23+PW_j*16] );
    if ( PW_m > PW_o )
    {
      PW_o = PW_m;
      PW_n = ( (in_data[PW_Start_Address+24+PW_j*16]*256) +
	       in_data[PW_Start_Address+25+PW_j*16] );
    }
  }

  OutputSize = PW_l + PW_o + (PW_n*2) + 4;

  CONVERT = GOOD;
  Save_Rip ( "The Player 4.1A module", P41A );
  
  if ( Save_Status == GOOD )
    PW_i += (OutputSize - 2);  /* 1 should do but call it "just to be sure" :) */
}



/*
 *   The_Player_4.1a.c   1997 (c) Asle / ReDoX
 *
 * The Player 4.1a to Protracker.
 *
 * Note: It's a REAL mess !. It's VERY badly coded, I know. Just dont forget
 *      it was mainly done to test the description I made of P41a format. I
 *      certainly wont dare to beat Gryzor on the ground :). His Prowiz IS
 *      the converter to use !!!.
 *
 * Update: 28/11/99
 *     - removed fopen() and all attached functions.
 *     - overall speed and size optimizings.
 * Update : 26 nov 2003
 *     - used htonl() so that use of addy is now portable on 68k archs
*/
void Depack_P41A ( void )
{
  Uchar c1,c2,c3,c4,c5;
  Uchar *Whatever;
  Uchar PatPos = 0x00;
  Uchar Nbr_Sample = 0x00;
  Uchar poss[37][2];
  Uchar sample,note,Note[2];
  Uchar Track_Data[512][256];
  short Track_Addresses[128][4];
  long Track_Data_Address = 0;
  long Track_Table_Address = 0;
  long Sample_Data_Address = 0;
  long WholeSampleSize = 0;
  long SampleAddress[31];
  long SampleSize[31];
  long i=0,j,k,l,a,c,z;
  long Where = PW_Start_Address;
  FILE *out;

  if ( Save_Status == BAD )
    return;

  BZERO ( Track_Addresses , 128*4*2 );
  BZERO ( Track_Data , 512*256 );
  BZERO ( SampleAddress , 31*4 );
  BZERO ( SampleSize , 31*4 );

  fillPTKtable(poss);

  sprintf ( Depacked_OutName , "%ld.mod" , Cpt_Filename-1 );
  out = PW_fopen ( Depacked_OutName , "w+b" );

  /* read check ID */
  Where += 4;

  /* bypass Real number of pattern */
  Where += 1;

  /* read number of pattern in pattern list */
  PatPos = in_data[Where++];

  /* read number of samples */
  Nbr_Sample = in_data[Where++];

  /* bypass empty byte */
  Where += 1;


/**********/

  /* read track data address */
  Track_Data_Address = (in_data[Where]*256*256*256)+
                       (in_data[Where+1]*256*256)+
                       (in_data[Where+2]*256)+
                        in_data[Where+3];
  Where += 4;

  /* read track table address */
  Track_Table_Address = (in_data[Where]*256*256*256)+
                        (in_data[Where+1]*256*256)+
                        (in_data[Where+2]*256)+
                         in_data[Where+3];
  Where += 4;

  /* read sample data address */
  Sample_Data_Address = (in_data[Where]*256*256*256)+
                        (in_data[Where+1]*256*256)+
                        (in_data[Where+2]*256)+
                         in_data[Where+3];
  Where += 4;


  /* write title */
  Whatever = (Uchar *) malloc ( 1024 );
  BZERO ( Whatever , 1024 );
  fwrite ( Whatever , 20 , 1 , out );

  /* sample headers stuff */
  for ( i=0 ; i<Nbr_Sample ; i++ )
  {
    /* read sample data address */
    j = (in_data[Where]*256*256*256)+
        (in_data[Where+1]*256*256)+
        (in_data[Where+2]*256)+
         in_data[Where+3];
    SampleAddress[i] = j;

    /* write sample name */
    fwrite ( Whatever , 22 , 1 , out );

    /* read sample size */
    SampleSize[i] = ((in_data[Where+4]*256)+in_data[Where+5])*2;
    WholeSampleSize += SampleSize[i];

    /* loop start */
    k = (in_data[Where+6]*256*256*256)+
        (in_data[Where+7]*256*256)+
        (in_data[Where+8]*256)+
         in_data[Where+9];

    /* writing now */
    fwrite ( &in_data[Where+4] , 2 , 1 , out );
    c1 = ((in_data[Where+14]*256)+in_data[Where+15])/74;
    fwrite ( &c1 , 1 , 1 , out );
    fwrite ( &in_data[Where+13] , 1 , 1 , out );
    k -= j;
    k /= 2;
    /* use of htonl() suggested by Xigh !.*/
    z = htonl(k);
    c1 = *((Uchar *)&z+2);
    c2 = *((Uchar *)&z+3);
    fwrite ( &c1 , 1 , 1 , out );
    fwrite ( &c2 , 1 , 1 , out );
    fwrite ( &in_data[Where+10] , 2 , 1 , out );

    Where += 16;
  }

  /* go up to 31 samples */
  Whatever[29] = 0x01;
  while ( i != 31 )
  {
    fwrite ( Whatever , 30 , 1 , out );
    i += 1;
  }

  /* write size of pattern list */
  fwrite ( &PatPos , 1 , 1 , out );

  /* write noisetracker byte */
  c1 = 0x7f;
  fwrite ( &c1 , 1 , 1 , out );

  /* place file pointer at the pattern list address ... should be */
  /* useless, but then ... */
  Where = PW_Start_Address + Track_Table_Address + 4;

  /* create and write pattern list .. no optimization ! */
  /* I'll optimize when I'll feel in the mood */
  for ( c1=0x00 ; c1<PatPos ; c1++ )
  {
    fwrite ( &c1 , 1 , 1 , out );
  }
  c2 = 0x00;
  while ( c1<128 )
  {
    fwrite ( &c2 , 1 , 1 , out );
    c1 += 0x01;
  }

  /* write ptk's ID */
  Whatever[0] = 'M';
  Whatever[1] = '.';
  Whatever[2] = 'K';
  Whatever[3] = '.';
  fwrite ( Whatever , 4 , 1 , out );

  /* reading all the track addresses */
  for ( i=0 ; i<PatPos ; i++ )
  {
    for ( j=0 ; j<4 ; j++ )
    {
      Track_Addresses[i][j] = (in_data[Where]*256)+
                               in_data[Where+1]+
                               Track_Data_Address+4;
      Where += 2;
    }
  }


  /* rewrite the track data */
  /*printf ( "sorting and depacking tracks data ... " );*/
  for ( i=0 ; i<PatPos ; i++ )
  {
    for ( j=0 ; j<4 ; j++ )
    {
      Where = PW_Start_Address + Track_Addresses[i][j];
      for ( k=0 ; k<64 ; k++ )
      {
        c1 = in_data[Where++];
        c2 = in_data[Where++];
        c3 = in_data[Where++];
        c4 = in_data[Where++];

        if ( c1 != 0x80 )
        {

          sample = ((c1<<4)&0x10) | ((c2>>4)&0x0f);
          BZERO ( Note , 2 );
          note = c1 & 0x7f;
          Note[0] = poss[(note/2)][0];
          Note[1] = poss[(note/2)][1];
          switch ( c2&0x0f )
          {
            case 0x08:
              c2 -= 0x08;
              break;
            case 0x05:
            case 0x06:
            case 0x0A:
              c3 = (c3 > 0x7f) ? ((0x100-c3)<<4) : c3;
//              if ( c3 >= 0x80 )
//                c3 = (c3<<4)&0xf0;
              break;
            default:
              break;
          }
          Track_Data[i*4+j][k*4]   = (sample&0xf0) | (Note[0]&0x0f);
          Track_Data[i*4+j][k*4+1] = Note[1];
          Track_Data[i*4+j][k*4+2] = c2;
          Track_Data[i*4+j][k*4+3] = c3;

          if ( (c4 > 0x00) && (c4 <0x80) )
            k += c4;
          if ( (c4 > 0x7f) && (c4 <=0xff) )
          {
            k+=1;
            for ( l=256 ; l>c4 ; l-- )
            {
              Track_Data[i*4+j][k*4]   = (sample&0xf0) | (Note[0]&0x0f);
              Track_Data[i*4+j][k*4+1] = Note[1];
              Track_Data[i*4+j][k*4+2] = c2;
              Track_Data[i*4+j][k*4+3] = c3;
              k+=1;
            }
            k -= 1;
          }
        }

        else
        {
          a = Where;

          c5 = c2;
          Where = PW_Start_Address + (c3 * 256) + c4 + Track_Data_Address + 4;
/*fprintf ( debug , "%2d (pattern %ld)(at %x)\n" , c2 , i , a-4 );*/
          for ( c=0 ; c<=c5 ; c++ )
          {
/*fprintf ( debug , "%ld," , k );*/
            c1 = in_data[Where++];
            c2 = in_data[Where++];
            c3 = in_data[Where++];
            c4 = in_data[Where++];

            sample = ((c1<<4)&0x10) | ((c2>>4)&0x0f);
            BZERO ( Note , 2 );
            note = c1 & 0x7f;
            Note[0] = poss[(note/2)][0];
            Note[1] = poss[(note/2)][1];
            switch ( c2&0x0f )
            {
              case 0x08:
                c2 -= 0x08;
                break;
              case 0x05:
              case 0x06:
              case 0x0A:
              c3 = (c3 > 0x7f) ? ((0x100-c3)<<4) : c3;
//                if ( c3 >= 0x80 )
//                  c3 = (c3<<4)&0xf0;
                break;
              default:
                break;
            }
            Track_Data[i*4+j][k*4]   = (sample&0xf0) | (Note[0]&0x0f);
            Track_Data[i*4+j][k*4+1] = Note[1];
            Track_Data[i*4+j][k*4+2] = c2;
            Track_Data[i*4+j][k*4+3] = c3;

            if ( (c4 > 0x00) && (c4 <0x80) )
              k += c4;
            if ( (c4 > 0x7f) && (c4 <=0xff) )
            {
              k+=1;
              for ( l=256 ; l>c4 ; l-- )
              {
                Track_Data[i*4+j][k*4]   = (sample&0xf0) | (Note[0]&0x0f);
                Track_Data[i*4+j][k*4+1] = Note[1];
                Track_Data[i*4+j][k*4+2] = c2;
                Track_Data[i*4+j][k*4+3] = c3;
                k+=1;
              }
              k -= 1;
            }
            k += 1;
          }

          k -= 1;
          Where = a;
/*fprintf ( debug , "\n## back to %x\n" , a );*/
        }
      }
    }
  }
  /*printf ( "ok\n" );*/

/*
for ( i=0 ; i<PatPos*4 ; i++ )
{
  fprintf ( debug , "\n\ntrack #%ld----------------\n" , i );
  for ( j=0 ; j<64 ; j++ )
  {
    fprintf ( debug , "%2x %2x %2x %2x\n"
    , Track_Data[i][j*4]
    , Track_Data[i][j*4+1]
    , Track_Data[i][j*4+2]
    , Track_Data[i][j*4+3] );
  }
}
*/

  /* write pattern data */
  /*printf ( "writing pattern data ... " );*/
  /*fflush ( stdout );*/
  for ( i=0 ; i<PatPos ; i++ )
  {
    BZERO ( Whatever , 1024 );
    for ( j=0 ; j<64 ; j++ )
    {
      for ( k=0 ; k<4 ; k++ )
      {
        Whatever[j*16+k*4]   = Track_Data[k+i*4][j*4];
        Whatever[j*16+k*4+1] = Track_Data[k+i*4][j*4+1];
        Whatever[j*16+k*4+2] = Track_Data[k+i*4][j*4+2];
        Whatever[j*16+k*4+3] = Track_Data[k+i*4][j*4+3];
      }
    }
    fwrite ( Whatever , 1024 , 1 , out );
  }
  free ( Whatever );
  /*printf ( "ok\n" );*/


  /* read and write sample data */
  /*printf ( "writing sample data ... " );*/
  for ( i=0 ; i<Nbr_Sample ; i++ )
  {
    Where = PW_Start_Address + SampleAddress[i]+Sample_Data_Address;
    fwrite ( &in_data[Where] , SampleSize[i] , 1 , out );
  }
  /*printf ( "ok\n" );*/

  Crap ( " The Player 4.1A  " , BAD , BAD , out );

  fflush ( out );
  fclose ( out );

  printf ( "done\n" );
  return; /* useless ... but */
}