forked from chocolate-doom/chocolate-doom
-
Notifications
You must be signed in to change notification settings - Fork 130
/
r_data.c
1489 lines (1209 loc) · 38 KB
/
r_data.c
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
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//
// Copyright(C) 1993-1996 Id Software, Inc.
// Copyright(C) 2005-2014 Simon Howard
//
// This program 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 2
// of the License, or (at your option) any later version.
//
// This program 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.
//
// DESCRIPTION:
// Preparation of data for rendering,
// generation of lookups, caching, retrieval by name.
//
#include <stdio.h>
#include "deh_main.h"
#include "i_swap.h"
#include "i_system.h"
#include "z_zone.h"
#include "w_wad.h"
#include "doomdef.h"
#include "m_misc.h"
#include "r_local.h"
#include "p_local.h"
#include "doomstat.h"
#include "r_sky.h"
#include "r_data.h"
#include "v_trans.h" // [crispy] tranmap, CRMAX
#include "r_bmaps.h" // [crispy] R_BrightmapForTexName()
//
// Graphics.
// DOOM graphics for walls and sprites
// is stored in vertical runs of opaque pixels (posts).
// A column is composed of zero or more posts,
// a patch or sprite is composed of zero or more columns.
//
//
// Texture definition.
// Each texture is composed of one or more patches,
// with patches being lumps stored in the WAD.
// The lumps are referenced by number, and patched
// into the rectangular texture space using origin
// and possibly other attributes.
//
typedef PACKED_STRUCT (
{
short originx;
short originy;
short patch;
short stepdir;
short colormap;
}) mappatch_t;
//
// Texture definition.
// A DOOM wall texture is a list of patches
// which are to be combined in a predefined order.
//
typedef PACKED_STRUCT (
{
char name[8];
int masked;
short width;
short height;
int obsolete;
short patchcount;
mappatch_t patches[1];
}) maptexture_t;
// A single patch from a texture definition,
// basically a rectangular area within
// the texture rectangle.
typedef struct
{
// Block origin (allways UL),
// which has allready accounted
// for the internal origin of the patch.
short originx;
short originy;
int patch;
} texpatch_t;
// A maptexturedef_t describes a rectangular texture,
// which is composed of one or more mappatch_t structures
// that arrange graphic patches.
typedef struct texture_s texture_t;
struct texture_s
{
// Keep name for switch changing, etc.
char name[8];
short width;
short height;
// Index in textures list
int index;
// Next in hash table chain
texture_t *next;
// All the patches[patchcount]
// are drawn back to front into the cached texture.
short patchcount;
texpatch_t patches[1];
};
int firstflat;
int lastflat;
int numflats;
int firstpatch;
int lastpatch;
int numpatches;
int firstspritelump;
int lastspritelump;
int numspritelumps;
int numtextures;
texture_t** textures;
texture_t** textures_hashtable;
int* texturewidthmask;
// needed for texture pegging
fixed_t* textureheight;
int* texturecompositesize;
short** texturecolumnlump;
unsigned** texturecolumnofs; // killough 4/9/98: make 32-bit
unsigned** texturecolumnofs2; // [crispy] original column offsets for single-patched textures
byte** texturecomposite;
byte** texturebrightmap; // [crispy] brightmaps
// for global animation
int* flattranslation;
int* texturetranslation;
// needed for pre rendering
fixed_t* spritewidth;
fixed_t* spriteoffset;
fixed_t* spritetopoffset;
lighttable_t *colormaps;
//
// MAPTEXTURE_T CACHING
// When a texture is first needed,
// it counts the number of composite columns
// required in the texture and allocates space
// for a column directory and any new columns.
// The directory will simply point inside other patches
// if there is only one patch in a given column,
// but any columns with multiple patches
// will have new column_ts generated.
//
// [crispy] replace R_DrawColumnInCache(), R_GenerateComposite() and R_GenerateLookup()
// with Lee Killough's implementations found in MBF to fix Medusa bug
// taken from mbfsrc/R_DATA.C:136-425
//
// R_DrawColumnInCache
// Clip and draw a column
// from a patch into a cached post.
//
// Rewritten by Lee Killough for performance and to fix Medusa bug
//
void
R_DrawColumnInCache
( column_t* patch,
byte* cache,
int originy,
int cacheheight,
byte* marks )
{
int count;
int position;
byte* source;
int top = -1;
while (patch->topdelta != 0xff)
{
// [crispy] support for DeePsea tall patches
if (patch->topdelta <= top)
{
top += patch->topdelta;
}
else
{
top = patch->topdelta;
}
source = (byte *)patch + 3;
count = patch->length;
position = originy + top;
if (position < 0)
{
count += position;
position = 0;
}
if (position + count > cacheheight)
count = cacheheight - position;
if (count > 0)
{
memcpy (cache + position, source, count);
// killough 4/9/98: remember which cells in column have been drawn,
// so that column can later be converted into a series of posts, to
// fix the Medusa bug.
memset (marks + position, 0xff, count);
}
patch = (column_t *)( (byte *)patch + patch->length + 4);
}
}
//
// R_GenerateComposite
// Using the texture definition,
// the composite texture is created from the patches,
// and each column is cached.
//
// Rewritten by Lee Killough for performance and to fix Medusa bug
void R_GenerateComposite (int texnum)
{
byte* block;
texture_t* texture;
texpatch_t* patch;
patch_t* realpatch;
int x;
int x1;
int x2;
int i;
column_t* patchcol;
short* collump;
unsigned* colofs; // killough 4/9/98: make 32-bit
byte* marks; // killough 4/9/98: transparency marks
byte* source; // killough 4/9/98: temporary column
texture = textures[texnum];
block = Z_Malloc (texturecompositesize[texnum],
PU_STATIC,
&texturecomposite[texnum]);
collump = texturecolumnlump[texnum];
colofs = texturecolumnofs[texnum];
// Composite the columns together.
patch = texture->patches;
// killough 4/9/98: marks to identify transparent regions in merged textures
marks = calloc(texture->width, texture->height);
// [crispy] initialize composite background to black (index 0)
memset(block, 0, texturecompositesize[texnum]);
for (i=0 , patch = texture->patches;
i<texture->patchcount;
i++, patch++)
{
realpatch = W_CacheLumpNum (patch->patch, PU_CACHE);
x1 = patch->originx;
x2 = x1 + SHORT(realpatch->width);
if (x1<0)
x = 0;
else
x = x1;
if (x2 > texture->width)
x2 = texture->width;
for ( ; x<x2 ; x++)
{
// Column does not have multiple patches?
// [crispy] generate composites for single-patched columns as well
/*
if (collump[x] >= 0)
continue;
*/
patchcol = (column_t *)((byte *)realpatch
+ LONG(realpatch->columnofs[x-x1]));
R_DrawColumnInCache (patchcol,
block + colofs[x],
// [crispy] single-patched columns are normally not composited
// but directly read from the patch lump ignoring their originy
collump[x] >= 0 ? 0 : patch->originy,
texture->height,
marks + x * texture->height);
}
}
// killough 4/9/98: Next, convert multipatched columns into true columns,
// to fix Medusa bug while still allowing for transparent regions.
source = I_Realloc(NULL, texture->height); // temporary column
for (i = 0; i < texture->width; i++)
{
if (collump[i] == -1) // process only multipatched columns
{
column_t *col = (column_t *)(block + colofs[i] - 3); // cached column
const byte *mark = marks + i * texture->height;
int j = 0;
// save column in temporary so we can shuffle it around
memcpy(source, (byte *) col + 3, texture->height);
for ( ; ; ) // reconstruct the column by scanning transparency marks
{
unsigned len; // killough 12/98
while (j < texture->height && !mark[j]) // skip transparent cells
j++;
if (j >= texture->height) // if at end of column
{
col->topdelta = -1; // end-of-column marker
break;
}
col->topdelta = j; // starting offset of post
// killough 12/98:
// Use 32-bit len counter, to support tall 1s multipatched textures
for (len = 0; j < texture->height && mark[j]; j++)
len++; // count opaque cells
col->length = len; // killough 12/98: intentionally truncate length
// copy opaque cells from the temporary back into the column
memcpy((byte *) col + 3, source + col->topdelta, len);
col = (column_t *)((byte *) col + len + 4); // next post
}
}
}
free(source); // free temporary column
free(marks); // free transparency marks
// Now that the texture has been built in column cache,
// it is purgable from zone memory.
Z_ChangeTag (block, PU_CACHE);
}
//
// R_GenerateLookup
//
// Rewritten by Lee Killough for performance and to fix Medusa bug
//
void R_GenerateLookup (int texnum)
{
texture_t* texture;
byte* patchcount; // patchcount[texture->width]
byte* postcount; // killough 4/9/98: keep count of posts in addition to patches.
texpatch_t* patch;
patch_t* realpatch;
int x;
int x1;
int x2;
int i;
short* collump;
unsigned* colofs; // killough 4/9/98: make 32-bit
unsigned* colofs2; // [crispy] original column offsets
int csize = 0; // killough 10/98
int err = 0; // killough 10/98
texture = textures[texnum];
// Composited texture not created yet.
texturecomposite[texnum] = 0;
texturecompositesize[texnum] = 0;
collump = texturecolumnlump[texnum];
colofs = texturecolumnofs[texnum];
colofs2 = texturecolumnofs2[texnum]; // [crispy] original column offsets
// Now count the number of columns
// that are covered by more than one patch.
// Fill in the lump / offset, so columns
// with only a single patch are all done.
patchcount = (byte *) Z_Malloc(texture->width, PU_STATIC, &patchcount);
postcount = (byte *) Z_Malloc(texture->width, PU_STATIC, &postcount);
memset (patchcount, 0, texture->width);
memset (postcount, 0, texture->width);
patch = texture->patches;
for (i=0 , patch = texture->patches;
i<texture->patchcount;
i++, patch++)
{
realpatch = W_CacheLumpNum (patch->patch, PU_CACHE);
x1 = patch->originx;
x2 = x1 + SHORT(realpatch->width);
if (x1 < 0)
x = 0;
else
x = x1;
if (x2 > texture->width)
x2 = texture->width;
for ( ; x<x2 ; x++)
{
patchcount[x]++;
collump[x] = patch->patch;
colofs[x] = colofs2[x] = LONG(realpatch->columnofs[x-x1])+3; // [crispy] original column offsets
}
}
// killough 4/9/98: keep a count of the number of posts in column,
// to fix Medusa bug while allowing for transparent multipatches.
//
// killough 12/98:
// Post counts are only necessary if column is multipatched,
// so skip counting posts if column comes from a single patch.
// This allows arbitrarily tall textures for 1s walls.
//
// If texture is >= 256 tall, assume it's 1s, and hence it has
// only one post per column. This avoids crashes while allowing
// for arbitrarily tall multipatched 1s textures.
if (texture->patchcount > 1 && texture->height < 256)
{
// killough 12/98: Warn about a common column construction bug
unsigned limit = texture->height * 3 + 3; // absolute column size limit
for (i = texture->patchcount, patch = texture->patches; --i >= 0; )
{
int pat = patch->patch;
const patch_t *realpatch = W_CacheLumpNum(pat, PU_CACHE);
int x, x1 = patch++->originx, x2 = x1 + SHORT(realpatch->width);
const int *cofs = realpatch->columnofs - x1;
if (x2 > texture->width)
x2 = texture->width;
if (x1 < 0)
x1 = 0;
for (x = x1 ; x < x2 ; x++)
{
if (patchcount[x] > 1) // Only multipatched columns
{
const column_t *col = (const column_t*)((const byte*) realpatch + LONG(cofs[x]));
const byte *base = (const byte *) col;
// count posts
for ( ; col->topdelta != 0xff; postcount[x]++)
{
if ((unsigned)((const byte *) col - base) <= limit)
col = (const column_t *)((const byte *) col + col->length + 4);
else
break;
}
}
}
}
}
// Now count the number of columns
// that are covered by more than one patch.
// Fill in the lump / offset, so columns
// with only a single patch are all done.
for (x=0 ; x<texture->width ; x++)
{
if (!patchcount[x] && !err++) // killough 10/98: non-verbose output
{
// [crispy] fix absurd texture name in error message
char namet[9];
namet[8] = 0;
memcpy (namet, texture->name, 8);
printf ("R_GenerateLookup: column without a patch (%s)\n",
namet);
// [crispy] do not return yet
/*
return;
*/
}
// I_Error ("R_GenerateLookup: column without a patch");
// [crispy] treat patch-less columns the same as multi-patched
if (patchcount[x] > 1 || !patchcount[x])
{
// Use the cached block.
// [crispy] moved up here, the rest in this loop
// applies to single-patched textures as well
collump[x] = -1;
}
// killough 1/25/98, 4/9/98:
//
// Fix Medusa bug, by adding room for column header
// and trailer bytes for each post in merged column.
// For now, just allocate conservatively 4 bytes
// per post per patch per column, since we don't
// yet know how many posts the merged column will
// require, and it's bounded above by this limit.
colofs[x] = csize + 3; // three header bytes in a column
// killough 12/98: add room for one extra post
csize += 4 * postcount[x] + 5; // 1 stop byte plus 4 bytes per post
// [crispy] remove limit
/*
if (texturecompositesize[texnum] > 0x10000-texture->height)
{
I_Error ("R_GenerateLookup: texture %i is >64k",
texnum);
}
*/
csize += texture->height; // height bytes of texture data
}
texturecompositesize[texnum] = csize;
Z_Free(patchcount);
Z_Free(postcount);
}
//
// R_GetColumn
//
byte*
R_GetColumn
( int tex,
int col,
boolean opaque )
{
int lump;
int ofs;
int ofs2;
col &= texturewidthmask[tex];
lump = texturecolumnlump[tex][col];
ofs = texturecolumnofs[tex][col];
ofs2 = texturecolumnofs2[tex][col];
// [crispy] single-patched mid-textures on two-sided walls
if (lump > 0 && !opaque)
return (byte *)W_CacheLumpNum(lump,PU_CACHE)+ofs2;
if (!texturecomposite[tex])
R_GenerateComposite (tex);
return texturecomposite[tex] + ofs;
}
static void GenerateTextureHashTable(void)
{
texture_t **rover;
int i;
int key;
textures_hashtable
= Z_Malloc(sizeof(texture_t *) * numtextures, PU_STATIC, 0);
memset(textures_hashtable, 0, sizeof(texture_t *) * numtextures);
// Add all textures to hash table
for (i=0; i<numtextures; ++i)
{
// Store index
textures[i]->index = i;
// Vanilla Doom does a linear search of the texures array
// and stops at the first entry it finds. If there are two
// entries with the same name, the first one in the array
// wins. The new entry must therefore be added at the end
// of the hash chain, so that earlier entries win.
key = W_LumpNameHash(textures[i]->name) % numtextures;
rover = &textures_hashtable[key];
while (*rover != NULL)
{
rover = &(*rover)->next;
}
// Hook into hash table
textures[i]->next = NULL;
*rover = textures[i];
}
}
//
// R_InitTextures
// Initializes the texture list
// with the textures from the world map.
//
// [crispy] partly rewritten to merge PNAMES and TEXTURE1/2 lumps
void R_InitTextures (void)
{
maptexture_t* mtexture;
texture_t* texture;
mappatch_t* mpatch;
texpatch_t* patch;
int i;
int j;
int k;
int* maptex = NULL;
char name[9];
int* patchlookup;
int totalwidth;
int nummappatches;
int offset;
int maxoff = 0;
int* directory = NULL;
int temp1;
int temp2;
int temp3;
typedef struct
{
int lumpnum;
void *names;
short nummappatches;
short summappatches;
char *name_p;
} pnameslump_t;
typedef struct
{
int lumpnum;
int *maptex;
int maxoff;
short numtextures;
short sumtextures;
short pnamesoffset;
} texturelump_t;
pnameslump_t *pnameslumps = NULL;
texturelump_t *texturelumps = NULL, *texturelump;
int maxpnameslumps = 1; // PNAMES
int maxtexturelumps = 2; // TEXTURE1, TEXTURE2
int numpnameslumps = 0;
int numtexturelumps = 0;
// [crispy] allocate memory for the pnameslumps and texturelumps arrays
pnameslumps = I_Realloc(pnameslumps, maxpnameslumps * sizeof(*pnameslumps));
texturelumps = I_Realloc(texturelumps, maxtexturelumps * sizeof(*texturelumps));
// [crispy] make sure the first available TEXTURE1/2 lumps
// are always processed first
texturelumps[numtexturelumps++].lumpnum = W_GetNumForName(DEH_String("TEXTURE1"));
if ((i = W_CheckNumForName(DEH_String("TEXTURE2"))) != -1)
texturelumps[numtexturelumps++].lumpnum = i;
else
texturelumps[numtexturelumps].lumpnum = -1;
// [crispy] fill the arrays with all available PNAMES lumps
// and the remaining available TEXTURE1/2 lumps
nummappatches = 0;
for (i = numlumps - 1; i >= 0; i--)
{
if (!strncasecmp(lumpinfo[i]->name, DEH_String("PNAMES"), 6))
{
if (numpnameslumps == maxpnameslumps)
{
maxpnameslumps++;
pnameslumps = I_Realloc(pnameslumps, maxpnameslumps * sizeof(*pnameslumps));
}
pnameslumps[numpnameslumps].lumpnum = i;
pnameslumps[numpnameslumps].names = W_CacheLumpNum(pnameslumps[numpnameslumps].lumpnum, PU_STATIC);
pnameslumps[numpnameslumps].nummappatches = LONG(*((int *) pnameslumps[numpnameslumps].names));
// [crispy] accumulated number of patches in the lookup tables
// excluding the current one
pnameslumps[numpnameslumps].summappatches = nummappatches;
pnameslumps[numpnameslumps].name_p = (char*)pnameslumps[numpnameslumps].names + 4;
// [crispy] calculate total number of patches
nummappatches += pnameslumps[numpnameslumps].nummappatches;
numpnameslumps++;
}
else
if (!strncasecmp(lumpinfo[i]->name, DEH_String("TEXTURE"), 7))
{
// [crispy] support only TEXTURE1/2 lumps, not TEXTURE3 etc.
if (lumpinfo[i]->name[7] != '1' &&
lumpinfo[i]->name[7] != '2')
continue;
// [crispy] make sure the first available TEXTURE1/2 lumps
// are not processed again
if (i == texturelumps[0].lumpnum ||
i == texturelumps[1].lumpnum) // [crispy] may still be -1
continue;
if (numtexturelumps == maxtexturelumps)
{
maxtexturelumps++;
texturelumps = I_Realloc(texturelumps, maxtexturelumps * sizeof(*texturelumps));
}
// [crispy] do not proceed any further, yet
// we first need a complete pnameslumps[] array and need
// to process texturelumps[0] (and also texturelumps[1]) as well
texturelumps[numtexturelumps].lumpnum = i;
numtexturelumps++;
}
}
// [crispy] fill up the patch lookup table
name[8] = 0;
patchlookup = Z_Malloc(nummappatches * sizeof(*patchlookup), PU_STATIC, NULL);
for (i = 0, k = 0; i < numpnameslumps; i++)
{
for (j = 0; j < pnameslumps[i].nummappatches; j++)
{
int p, po;
M_StringCopy(name, pnameslumps[i].name_p + j * 8, sizeof(name));
p = po = W_CheckNumForName(name);
// [crispy] prevent flat lumps from being mistaken as patches
while (p >= firstflat && p <= lastflat)
{
p = W_CheckNumForNameFromTo (name, p - 1, 0);
}
// [crispy] if the name is unambiguous, use the lump we found
patchlookup[k++] = (p == -1) ? po : p;
}
}
// [crispy] calculate total number of textures
numtextures = 0;
for (i = 0; i < numtexturelumps; i++)
{
texturelumps[i].maptex = W_CacheLumpNum(texturelumps[i].lumpnum, PU_STATIC);
texturelumps[i].maxoff = W_LumpLength(texturelumps[i].lumpnum);
texturelumps[i].numtextures = LONG(*texturelumps[i].maptex);
// [crispy] accumulated number of textures in the texture files
// including the current one
numtextures += texturelumps[i].numtextures;
texturelumps[i].sumtextures = numtextures;
// [crispy] link textures to their own WAD's patch lookup table (if any)
texturelumps[i].pnamesoffset = 0;
for (j = 0; j < numpnameslumps; j++)
{
// [crispy] both are from the same WAD?
if (lumpinfo[texturelumps[i].lumpnum]->wad_file ==
lumpinfo[pnameslumps[j].lumpnum]->wad_file)
{
texturelumps[i].pnamesoffset = pnameslumps[j].summappatches;
break;
}
}
}
// [crispy] release memory allocated for patch lookup tables
for (i = 0; i < numpnameslumps; i++)
{
W_ReleaseLumpNum(pnameslumps[i].lumpnum);
}
free(pnameslumps);
// [crispy] pointer to (i.e. actually before) the first texture file
texturelump = texturelumps - 1; // [crispy] gets immediately increased below
textures = Z_Malloc (numtextures * sizeof(*textures), PU_STATIC, 0);
texturecolumnlump = Z_Malloc (numtextures * sizeof(*texturecolumnlump), PU_STATIC, 0);
texturecolumnofs = Z_Malloc (numtextures * sizeof(*texturecolumnofs), PU_STATIC, 0);
texturecolumnofs2 = Z_Malloc (numtextures * sizeof(*texturecolumnofs2), PU_STATIC, 0);
texturecomposite = Z_Malloc (numtextures * sizeof(*texturecomposite), PU_STATIC, 0);
texturecompositesize = Z_Malloc (numtextures * sizeof(*texturecompositesize), PU_STATIC, 0);
texturewidthmask = Z_Malloc (numtextures * sizeof(*texturewidthmask), PU_STATIC, 0);
textureheight = Z_Malloc (numtextures * sizeof(*textureheight), PU_STATIC, 0);
texturebrightmap = Z_Malloc (numtextures * sizeof(*texturebrightmap), PU_STATIC, 0);
totalwidth = 0;
// Really complex printing shit...
temp1 = W_GetNumForName (DEH_String("S_START")); // P_???????
temp2 = W_GetNumForName (DEH_String("S_END")) - 1;
temp3 = ((temp2-temp1+63)/64) + ((numtextures+63)/64);
// If stdout is a real console, use the classic vanilla "filling
// up the box" effect, which uses backspace to "step back" inside
// the box. If stdout is a file, don't draw the box.
if (I_ConsoleStdout())
{
printf("[");
#ifndef CRISPY_TRUECOLOR
for (i = 0; i < temp3 + 9 + 1; i++) // [crispy] one more for R_InitTranMap()
#else
for (i = 0; i < temp3 + 9; i++)
#endif
printf(" ");
printf("]");
#ifndef CRISPY_TRUECOLOR
for (i = 0; i < temp3 + 10 + 1; i++) // [crispy] one more for R_InitTranMap()
#else
for (i = 0; i < temp3 + 10; i++)
#endif
printf("\b");
}
for (i=0 ; i<numtextures ; i++, directory++)
{
if (!(i&63))
printf (".");
// [crispy] initialize for the first texture file lump,
// skip through empty texture file lumps which do not contain any texture
while (texturelump == texturelumps - 1 || i == texturelump->sumtextures)
{
// [crispy] start looking in next texture file
texturelump++;
maptex = texturelump->maptex;
maxoff = texturelump->maxoff;
directory = maptex+1;
}
offset = LONG(*directory);
if (offset > maxoff)
I_Error ("R_InitTextures: bad texture directory");
mtexture = (maptexture_t *) ( (byte *)maptex + offset);
texture = textures[i] =
Z_Malloc (sizeof(texture_t)
+ sizeof(texpatch_t)*(SHORT(mtexture->patchcount)-1),
PU_STATIC, 0);
texture->width = SHORT(mtexture->width);
texture->height = SHORT(mtexture->height);
texture->patchcount = SHORT(mtexture->patchcount);
memcpy (texture->name, mtexture->name, sizeof(texture->name));
mpatch = &mtexture->patches[0];
patch = &texture->patches[0];
// [crispy] initialize brightmaps
texturebrightmap[i] = R_BrightmapForTexName(texture->name);
for (j=0 ; j<texture->patchcount ; j++, mpatch++, patch++)
{
short p;
patch->originx = SHORT(mpatch->originx);
patch->originy = SHORT(mpatch->originy);
// [crispy] apply offset for patches not in the
// first available patch offset table
p = SHORT(mpatch->patch) + texturelump->pnamesoffset;
// [crispy] catch out-of-range patches
if (p < nummappatches)
patch->patch = patchlookup[p];
if (patch->patch == -1 || p >= nummappatches)
{
char texturename[9];
texturename[8] = '\0';
memcpy (texturename, texture->name, 8);
// [crispy] make non-fatal
fprintf (stderr, "R_InitTextures: Missing patch in texture %s\n",
texturename);
patch->patch = 0;
}
}
texturecolumnlump[i] = Z_Malloc (texture->width*sizeof(**texturecolumnlump), PU_STATIC,0);
texturecolumnofs[i] = Z_Malloc (texture->width*sizeof(**texturecolumnofs), PU_STATIC,0);
texturecolumnofs2[i] = Z_Malloc (texture->width*sizeof(**texturecolumnofs2), PU_STATIC,0);
j = 1;
while (j*2 <= texture->width)
j<<=1;
texturewidthmask[i] = j-1;
textureheight[i] = texture->height<<FRACBITS;
totalwidth += texture->width;
}
Z_Free(patchlookup);
// [crispy] release memory allocated for texture files
for (i = 0; i < numtexturelumps; i++)
{
W_ReleaseLumpNum(texturelumps[i].lumpnum);
}
free(texturelumps);
// Precalculate whatever possible.
for (i=0 ; i<numtextures ; i++)
R_GenerateLookup (i);
// Create translation table for global animation.
texturetranslation = Z_Malloc ((numtextures+1)*sizeof(*texturetranslation), PU_STATIC, 0);
for (i=0 ; i<numtextures ; i++)
texturetranslation[i] = i;
GenerateTextureHashTable();
}
//
// R_InitFlats
//
void R_InitFlats (void)
{
int i;
firstflat = W_GetNumForName (DEH_String("F_START")) + 1;
lastflat = W_GetNumForName (DEH_String("F_END")) - 1;
numflats = lastflat - firstflat + 1;
// Create translation table for global animation.
flattranslation = Z_Malloc ((numflats+1)*sizeof(*flattranslation), PU_STATIC, 0);
for (i=0 ; i<numflats ; i++)
flattranslation[i] = i;
}
//
// R_InitSpriteLumps
// Finds the width and hoffset of all sprites in the wad,
// so the sprite does not need to be cached completely
// just for having the header info ready during rendering.
//
void R_InitSpriteLumps (void)
{
int i;
patch_t *patch;
firstspritelump = W_GetNumForName (DEH_String("S_START")) + 1;
lastspritelump = W_GetNumForName (DEH_String("S_END")) - 1;
numspritelumps = lastspritelump - firstspritelump + 1;
spritewidth = Z_Malloc (numspritelumps*sizeof(*spritewidth), PU_STATIC, 0);
spriteoffset = Z_Malloc (numspritelumps*sizeof(*spriteoffset), PU_STATIC, 0);
spritetopoffset = Z_Malloc (numspritelumps*sizeof(*spritetopoffset), PU_STATIC, 0);
for (i=0 ; i< numspritelumps ; i++)
{
if (!(i&63))
printf (".");