/
rend_main.c
3734 lines (3140 loc) · 121 KB
/
rend_main.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
/**\file
*\section License
* License: GPL
* Online License Link: http://www.gnu.org/licenses/gpl.html
*
*\author Copyright © 2003-2008 Jaakko Keränen <jaakko.keranen@iki.fi>
*\author Copyright © 2006-2008 Daniel Swanson <danij@dengine.net>
*\author Copyright © 2006 Jamie Jones <jamie_jones_au@yahoo.com.au>
*
* 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.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor,
* Boston, MA 02110-1301 USA
*/
/**
* rend_main.c: Rendering Subsystem
*/
// HEADER FILES ------------------------------------------------------------
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "de_base.h"
#include "de_dgl.h"
#include "de_console.h"
#include "de_edit.h"
#include "de_render.h"
#include "de_refresh.h"
#include "de_play.h"
#include "de_graphics.h"
#include "de_misc.h"
#include "de_ui.h"
#include "de_system.h"
#include "net_main.h"
// MACROS ------------------------------------------------------------------
// TYPES -------------------------------------------------------------------
// EXTERNAL FUNCTION PROTOTYPES --------------------------------------------
// PUBLIC FUNCTION PROTOTYPES ----------------------------------------------
void Rend_DrawBBox(const float pos3f[3], float w, float l, float h,
const float color3f[3], float alpha, float br,
boolean alignToBase);
void Rend_DrawArrow(const float pos3f[3], angle_t a, float s,
const float color3f[3], float alpha);
// PRIVATE FUNCTION PROTOTYPES ---------------------------------------------
static void Rend_RenderBoundingBoxes(void);
static DGLuint constructBBox(DGLuint name, float br);
// EXTERNAL DATA DECLARATIONS ----------------------------------------------
extern int useDynLights, translucentIceCorpse;
extern int skyhemispheres;
extern int loMaxRadius;
extern int devNoCulling;
extern boolean firstFrameAfterLoad;
// PUBLIC DATA DEFINITIONS -------------------------------------------------
boolean usingFog = false; // Is the fog in use?
float fogColor[4];
float fieldOfView = 95.0f;
byte smoothTexAnim = true;
int useShinySurfaces = true;
float vx, vy, vz, vang, vpitch;
float viewsidex, viewsidey;
byte freezeRLs = false;
int devSkyMode = false;
int missileBlend = 1;
// Ambient lighting, rAmbient is used within the renderer, ambientLight is
// used to store the value of the ambient light cvar.
// The value chosen for rAmbient occurs in Rend_CalcLightModRange
// for convenience (since we would have to recalculate the matrix anyway).
int rAmbient = 0, ambientLight = 0;
int viewpw, viewph; // Viewport size, in pixels.
int viewpx, viewpy; // Viewpoint top left corner, in pixels.
float yfov;
int gameDrawHUD = 1; // Set to zero when we advise that the HUD should not be drawn
float lightRangeCompression = 0;
float lightModRange[255];
int devLightModRange = 0;
float rendLightDistanceAttentuation = 1024;
int devMobjBBox = 0; // 1 = Draw mobj bounding boxes (for debug)
DGLuint dlBBox = 0; // Display list: active-textured bbox model.
// PRIVATE DATA DEFINITIONS ------------------------------------------------
static boolean firstsubsector; // No range checking for the first one.
// Current sector light color.
const float* sLightColor;
int devNoTexFix = 0;
// CODE --------------------------------------------------------------------
void Rend_Register(void)
{
C_VAR_INT("rend-dev-sky", &devSkyMode, 0, 0, 1);
C_VAR_BYTE("rend-dev-freeze", &freezeRLs, CVF_NO_ARCHIVE, 0, 1);
C_VAR_INT("rend-dev-cull-subsectors", &devNoCulling,CVF_NO_ARCHIVE,0,1);
C_VAR_INT("rend-dev-mobj-bbox", &devMobjBBox, 0, 0, 1);
C_VAR_FLOAT("rend-camera-fov", &fieldOfView, 0, 1, 179);
C_VAR_BYTE("rend-tex-anim-smooth", &smoothTexAnim, 0, 0, 1);
C_VAR_INT("rend-tex-shiny", &useShinySurfaces, 0, 0, 1);
C_VAR_FLOAT2("rend-light-compression", &lightRangeCompression, 0, -1, 1,
Rend_CalcLightModRange);
C_VAR_INT2("rend-light-ambient", &ambientLight, 0, 0, 255,
Rend_CalcLightModRange);
C_VAR_INT2("rend-light-sky", &rendSkyLight, 0, 0, 1,
LG_MarkAllForUpdate);
C_VAR_FLOAT("rend-light-wall-angle", &rendLightWallAngle, CVF_NO_MAX,
0, 0);
C_VAR_FLOAT("rend-light-attenuation", &rendLightDistanceAttentuation,
CVF_NO_MAX, 0, 0);
C_VAR_INT("rend-dev-light-mod", &devLightModRange, CVF_NO_ARCHIVE, 0, 1);
C_VAR_INT("rend-dev-tex-showfix", &devNoTexFix, 0, 0, 1);
C_VAR_BYTE("rend-dev-blockmap-debug", &bmapShowDebug, 0, 0, 2);
C_VAR_FLOAT("rend-dev-blockmap-debug-size", &bmapDebugSize, 0, .1f, 100);
RL_Register();
DL_Register();
SB_Register();
LG_Register();
Rend_ModelRegister();
Rend_ParticleRegister();
Rend_RadioRegister();
Rend_ShadowRegister();
Rend_SkyRegister();
Rend_SpriteRegister();
Rend_ConsoleRegister();
}
#if 0 // unused atm
float Rend_SignedPointDist2D(float c[2])
{
/* (YA-YC)(XB-XA)-(XA-XC)(YB-YA)
s = -----------------------------
L**2
Luckily, L**2 is one. dist = s*L. Even more luckily, L is also one.
*/
return (vz - c[VY]) * viewsidex - (vx - c[VX]) * viewsidey;
}
#endif
/**
* Approximated! The Z axis aspect ratio is corrected.
*/
float Rend_PointDist3D(const float c[3])
{
return M_ApproxDistance3f(vx - c[VX], vz - c[VY], 1.2f * (vy - c[VZ]));
}
void Rend_Init(void)
{
C_Init(); // Clipper.
RL_Init(); // Rendering lists.
Rend_InitSky(); // The sky.
}
/**
* Used to be called before starting a new map.
*/
void Rend_Reset(void)
{
// Textures are deleted (at least skies need this???).
GL_ClearRuntimeTextures();
LO_Clear(); // Free lumobj stuff.
if(dlBBox)
DGL_DeleteLists(dlBBox, 1);
dlBBox = 0;
}
void Rend_ModelViewMatrix(boolean useAngles)
{
vx = viewX;
vy = viewZ;
vz = viewY;
vang = viewAngle / (float) ANGLE_MAX *360 - 90;
vpitch = viewPitch * 85.0 / 110.0;
DGL_MatrixMode(DGL_MODELVIEW);
DGL_LoadIdentity();
if(useAngles)
{
DGL_Rotatef(vpitch, 1, 0, 0);
DGL_Rotatef(vang, 0, 1, 0);
}
DGL_Scalef(1, 1.2f, 1); // This is the aspect correction.
DGL_Translatef(-vx, -vy, -vz);
}
static __inline float segFacingViewerDot(float v1[2], float v2[2])
{
// The dot product.
return (v1[VY] - v2[VY]) * (v1[VX] - vx) + (v2[VX] - v1[VX]) * (v1[VY] - vz);
}
#if 0 // unused atm
static int Rend_FixedSegFacingDir(const seg_t *seg)
{
// The dot product. (1 if facing front.)
return((seg->fv1.pos[VY] - seg->fv2.pos[VY]) * (seg->fv1.pos[VX] - viewX) +
(seg->fv2.pos[VX] - seg->fv1.pos[VX]) * (seg->fv1.pos[VY] - viewY)) > 0;
}
#endif
#if 0 // unused atm
int Rend_SegFacingPoint(float v1[2], float v2[2], float pnt[2])
{
float nx = v1[VY] - v2[VY], ny = v2[VX] - v1[VX];
float vvx = v1[VX] - pnt[VX], vvy = v1[VY] - pnt[VY];
// The dot product.
if(nx * vvx + ny * vvy > 0)
return 1; // Facing front.
return 0; // Facing away.
}
#endif
static int C_DECL DivSortAscend(const void *e1, const void *e2)
{
float f1 = *(float *) e1, f2 = *(float *) e2;
if(f1 > f2)
return 1;
if(f2 > f1)
return -1;
return 0;
}
static int C_DECL DivSortDescend(const void *e1, const void *e2)
{
float f1 = *(float *) e1, f2 = *(float *) e2;
if(f1 > f2)
return -1;
if(f2 > f1)
return 1;
return 0;
}
void Rend_VertexColorsGlow(rcolor_t* colors, size_t num)
{
size_t i;
for(i = 0; i < num; ++i)
{
rcolor_t* c = &colors[i];
c->rgba[CR] = c->rgba[CG] = c->rgba[CB] = 1;
}
}
void Rend_VertexColorsAlpha(rcolor_t* colors, size_t num, float alpha)
{
size_t i;
for(i = 0; i < num; ++i)
{
colors[i].rgba[CA] = alpha;
}
}
void Rend_ApplyTorchLight(float* color, float distance)
{
ddplayer_t* ddpl = &viewPlayer->shared;
if(!ddpl->fixedColorMap)
return;
// Check for torch.
if(distance < 1024)
{
// Colormap 1 is the brightest. I'm guessing 16 would be
// the darkest.
int ll = 16 - ddpl->fixedColorMap;
float d = (1024 - distance) / 1024.0f * ll / 15.0f;
if(torchAdditive)
{
color[CR] += d * torchColor[CR];
color[CG] += d * torchColor[CG];
color[CB] += d * torchColor[CB];
}
else
{
color[CR] += d * ((color[CR] * torchColor[CR]) - color[CR]);
color[CG] += d * ((color[CG] * torchColor[CG]) - color[CG]);
color[CB] += d * ((color[CB] * torchColor[CB]) - color[CB]);
}
}
}
static void lightVertex(rcolor_t* color, const rvertex_t* vtx,
float lightLevel, const float* ambientColor)
{
float lightVal, dist;
dist = Rend_PointDist2D(vtx->pos);
// Apply distance attenuation.
lightVal = R_DistAttenuateLightLevel(dist, lightLevel);
// Add extra light.
lightVal += R_ExtraLightDelta();
Rend_ApplyLightAdaptation(&lightVal);
// Mix with the surface color.
color->rgba[CR] = lightVal * ambientColor[CR];
color->rgba[CG] = lightVal * ambientColor[CG];
color->rgba[CB] = lightVal * ambientColor[CB];
}
void Rend_VertexColorsApplyTorchLight(rcolor_t* colors,
const rvertex_t* vertices,
size_t numVertices)
{
size_t i;
ddplayer_t* ddpl = &viewPlayer->shared;
if(!ddpl->fixedColorMap)
return; // No need, its disabled.
for(i = 0; i < numVertices; ++i)
{
const rvertex_t* vtx = &vertices[i];
rcolor_t* c = &colors[i];
Rend_ApplyTorchLight(c->rgba, Rend_PointDist2D(vtx->pos));
}
}
void Rend_PreparePlane(rvertex_t* rvertices, size_t numVertices,
float height, const subsector_t* subsector,
boolean antiClockwise)
{
size_t i, vid;
// First vertex is always #0.
rvertices[0].pos[VX] = subsector->vertices[0]->pos[VX];
rvertices[0].pos[VY] = subsector->vertices[0]->pos[VY];
rvertices[0].pos[VZ] = height;
// Copy the vertices in reverse order for ceilings (flip faces).
if(antiClockwise)
vid = numVertices - 1;
else
vid = 1;
for(i = 1; i < numVertices; ++i)
{
rvertices[i].pos[VX] = subsector->vertices[vid]->pos[VX];
rvertices[i].pos[VY] = subsector->vertices[vid]->pos[VY];
rvertices[i].pos[VZ] = height;
(antiClockwise? vid-- : vid++);
}
}
/**
* \fixme No need to do this each frame. Set a flag in sidedef_t->flags to
* denote this. Is sensitive to plane heights, surface properties
* (e.g. alpha) and surface texture properties.
*/
boolean Rend_DoesMidTextureFillGap(linedef_t *line, int backside)
{
// Check for unmasked midtextures on twosided lines that completely
// fill the gap between floor and ceiling (we don't want to give away
// the location of any secret areas (false walls)).
if(line->L_backside)
{
sector_t* front = line->L_sector(backside);
sector_t* back = line->L_sector(backside^1);
sidedef_t* side = line->L_side(backside);
if(side->SW_middlematerial)
{
material_t* mat = side->SW_middlematerial;
materialtexinst_t* texInst;
// Ensure we have up to date info on the materialtex.
texInst = R_MaterialPrepare(mat->current, 0, NULL, NULL, NULL);
if(texInst && !texInst->masked &&
!side->SW_middleblendmode && side->SW_middlergba[3] >= 1)
{
float openTop[2], matTop[2];
float openBottom[2], matBottom[2];
if(side->flags & SDF_MIDDLE_STRETCH)
return true;
openTop[0] = openTop[1] = matTop[0] = matTop[1] =
MIN_OF(back->SP_ceilvisheight, front->SP_ceilvisheight);
openBottom[0] = openBottom[1] = matBottom[0] = matBottom[1] =
MAX_OF(back->SP_floorvisheight, front->SP_floorvisheight);
// Could the mid texture fill enough of this gap for us
// to consider it completely closed?
if(mat->height >= (openTop[0] - openBottom[0]) &&
mat->height >= (openTop[1] - openBottom[1]))
{
// Possibly. Check the placement of the mid texture.
if(Rend_MidMaterialPos
(&matBottom[0], &matBottom[1], &matTop[0], &matTop[1],
NULL, side->SW_middlevisoffset[VY], mat->height,
0 != (line->flags & DDLF_DONTPEGBOTTOM)))
{
if(matTop[0] >= openTop[0] &&
matTop[1] >= openTop[1] &&
matBottom[0] <= openBottom[0] &&
matBottom[1] <= openBottom[1])
return true;
}
}
}
}
}
return false;
}
static void Rend_MarkSegSectionsPVisible(seg_t *seg)
{
uint i, j;
sidedef_t *side;
linedef_t *line;
if(!seg || !seg->lineDef)
return; // huh?
line = seg->lineDef;
for(i = 0; i < 2; ++i)
{
// Missing side?
if(!line->L_side(i))
continue;
side = line->L_side(i);
for(j = 0; j < 3; ++j)
side->sections[j].inFlags |= SUIF_PVIS;
// Top
if(!line->L_backside)
{
side->sections[SEG_TOP].inFlags &= ~SUIF_PVIS;
side->sections[SEG_BOTTOM].inFlags &= ~SUIF_PVIS;
}
else
{
// Check middle texture
if((!side->SW_middlematerial ||
(side->SW_middlematerial->flags & MATF_NO_DRAW)) ||
side->SW_middlergba[3] <= 0) // Check alpha
side->sections[SEG_MIDDLE].inFlags &= ~SUIF_PVIS;
if(R_IsSkySurface(&line->L_backsector->SP_ceilsurface) &&
R_IsSkySurface(&line->L_frontsector->SP_ceilsurface))
side->sections[SEG_TOP].inFlags &= ~SUIF_PVIS;
else
{
if(i != 0)
{
if(line->L_backsector->SP_ceilvisheight <=
line->L_frontsector->SP_ceilvisheight)
side->sections[SEG_TOP].inFlags &= ~SUIF_PVIS;
}
else
{
if(line->L_frontsector->SP_ceilvisheight <=
line->L_backsector->SP_ceilvisheight)
side->sections[SEG_TOP].inFlags &= ~SUIF_PVIS;
}
}
// Bottom
if(R_IsSkySurface(&line->L_backsector->SP_floorsurface) &&
R_IsSkySurface(&line->L_frontsector->SP_floorsurface))
side->sections[SEG_BOTTOM].inFlags &= ~SUIF_PVIS;
else
{
if(i != 0)
{
if(line->L_backsector->SP_floorvisheight >=
line->L_frontsector->SP_floorvisheight)
side->sections[SEG_BOTTOM].inFlags &= ~SUIF_PVIS;
}
else
{
if(line->L_frontsector->SP_floorvisheight >=
line->L_backsector->SP_floorvisheight)
side->sections[SEG_BOTTOM].inFlags &= ~SUIF_PVIS;
}
}
}
}
}
/**
* @return @true, if there is a division at the specified height.
*/
static int checkDiv(walldiv_t *div, float height)
{
uint i;
for(i = 0; i < div->num; ++i)
if(div->pos[i] == height)
return true;
return false;
}
static void doCalcSegDivisions(walldiv_t* div, const linedef_t* line,
boolean backSide, const sector_t* frontSec,
float bottomZ, float topZ, boolean doRight)
{
uint i, j;
linedef_t *iter;
sector_t *scanSec;
lineowner_t *base, *own;
boolean clockwise = !doRight;
boolean stopScan = false;
if(bottomZ >= topZ)
return; // Obviously no division.
// Retrieve the start owner node.
base = own = R_GetVtxLineOwner(line->L_v(backSide^doRight), line);
do
{
own = own->link[clockwise];
if(own == base)
stopScan = true;
else
{
iter = own->lineDef;
if(LINE_SELFREF(iter))
continue;
i = 0;
do
{ // First front, then back.
scanSec = NULL;
if(!i && iter->L_frontside && iter->L_frontsector != frontSec)
scanSec = iter->L_frontsector;
else if(i && iter->L_backside && iter->L_backsector != frontSec)
scanSec = iter->L_backsector;
if(scanSec)
{
if(scanSec->SP_ceilvisheight - scanSec->SP_floorvisheight > 0)
{
for(j = 0; j < scanSec->planeCount && !stopScan; ++j)
{
plane_t *pln = scanSec->SP_plane(j);
if(pln->visHeight > bottomZ && pln->visHeight < topZ)
{
if(!checkDiv(div, pln->visHeight))
{
div->pos[div->num++] = pln->visHeight;
// Have we reached the div limit?
if(div->num == RL_MAX_DIVS)
stopScan = true;
}
}
if(!stopScan)
{ // Clip a range bound to this height?
if(pln->type == PLN_FLOOR && pln->visHeight > bottomZ)
bottomZ = pln->visHeight;
else if(pln->type == PLN_CEILING && pln->visHeight < topZ)
topZ = pln->visHeight;
// All clipped away?
if(bottomZ >= topZ)
stopScan = true;
}
}
}
else
{
/**
* A zero height sector is a special case. In this
* instance, the potential division is at the height
* of the back ceiling. This is because elsewhere
* we automatically fix the case of a floor above a
* ceiling by lowering the floor.
*/
float z = scanSec->SP_ceilvisheight;
if(z > bottomZ && z < topZ)
{
if(!checkDiv(div, z))
{
div->pos[div->num++] = z;
// Have we reached the div limit?
if(div->num == RL_MAX_DIVS)
stopScan = true;
}
}
}
}
} while(!stopScan && ++i < 2);
// Stop the scan when a single sided line is reached.
if(!iter->L_frontside || !iter->L_backside)
stopScan = true;
}
} while(!stopScan);
}
static void calcSegDivisions(walldiv_t* div, const seg_t* seg,
const sector_t* frontSec, float bottomZ,
float topZ, boolean doRight)
{
sidedef_t* side;
div->num = 0;
side = SEG_SIDEDEF(seg);
if(seg->flags & SEGF_POLYOBJ)
return; // Polyobj segs are never split.
// Only segs at sidedef ends can/should be split.
if(!((seg == side->segs[0] && !doRight) ||
(seg == side->segs[side->segCount -1] && doRight)))
return;
doCalcSegDivisions(div, seg->lineDef, seg->side, frontSec, bottomZ,
topZ, doRight);
}
/**
* Division will only happen if it must be done.
*/
static void applyWallHeightDivision(walldiv_t* divs, const seg_t* seg,
const sector_t* frontsec, float low,
float hi)
{
uint i;
walldiv_t* div;
if(!seg->lineDef)
return; // Mini-segs arn't drawn.
for(i = 0; i < 2; ++i)
{
div = &divs[i];
calcSegDivisions(div, seg, frontsec, low, hi, i);
// We need to sort the divisions for the renderer.
if(div->num > 1)
{
// Sorting is required. This shouldn't take too long...
// There seldom are more than one or two divisions.
qsort(div->pos, div->num, sizeof(float),
i!=0 ? DivSortDescend : DivSortAscend);
}
#ifdef RANGECHECK
{
uint k;
for(k = 0; k < div->num; ++k)
if(div->pos[k] > hi || div->pos[k] < low)
{
Con_Error("DivQuad: i=%i, pos (%f), hi (%f), low (%f), num=%i\n",
i, div->pos[k], hi, low, div->num);
}
}
#endif
}
}
/**
* Calculates the placement for a middle texture (top, bottom, offset).
* texoffy may be NULL.
* Returns false if the middle texture isn't visible (in the opening).
*/
int Rend_MidMaterialPos(float* bottomleft, float* bottomright,
float* topleft, float* topright, float* texoffy,
float tcyoff, float texHeight, boolean lowerUnpeg)
{
int side;
float openingTop, openingBottom;
boolean visible[2] = {false, false};
for(side = 0; side < 2; ++side)
{
openingTop = *(side? topright : topleft);
openingBottom = *(side? bottomright : bottomleft);
if(openingTop <= openingBottom)
continue;
// Else the mid texture is visible on this side.
visible[side] = true;
if(side == 0 && texoffy)
*texoffy = 0;
// We don't allow vertical tiling.
if(lowerUnpeg)
{
*(side? bottomright : bottomleft) += tcyoff;
*(side? topright : topleft) =
*(side? bottomright : bottomleft) + texHeight;
}
else
{
*(side? topright : topleft) += tcyoff;
*(side? bottomright : bottomleft) =
*(side? topright : topleft) - texHeight;
}
// Clip it.
if(*(side? bottomright : bottomleft) < openingBottom)
{
*(side? bottomright : bottomleft) = openingBottom;
}
if(*(side? topright : topleft) > openingTop)
{
if(side == 0 && texoffy)
*texoffy += *(side? topright : topleft) - openingTop;
*(side? topright : topleft) = openingTop;
}
}
return (visible[0] || visible[1]);
}
static void selectSurfaceColors(const float** topColor,
const float** bottomColor, sidedef_t* side,
segsection_t section)
{
// Select the colors for this surface.
switch(section)
{
case SEG_MIDDLE:
if(side->flags & SDF_BLENDMIDTOTOP)
{
*topColor = side->SW_toprgba;
*bottomColor = side->SW_middlergba;
}
else if(side->flags & SDF_BLENDMIDTOBOTTOM)
{
*topColor = side->SW_middlergba;
*bottomColor = side->SW_bottomrgba;
}
else
{
*topColor = side->SW_middlergba;
*bottomColor = NULL;
}
break;
case SEG_TOP:
if(side->flags & SDF_BLENDTOPTOMID)
{
*topColor = side->SW_toprgba;
*bottomColor = side->SW_middlergba;
}
else
{
*topColor = side->SW_toprgba;
*bottomColor = NULL;
}
break;
case SEG_BOTTOM:
// Select the correct colors for this surface.
if(side->flags & SDF_BLENDBOTTOMTOMID)
{
*topColor = side->SW_middlergba;
*bottomColor = side->SW_bottomrgba;
}
else
{
*topColor = side->SW_bottomrgba;
*bottomColor = NULL;
}
break;
default:
break;
}
}
boolean RLIT_DynGetFirst(const dynlight_t* dyn, void* data)
{
dynlight_t** ptr = data;
*ptr = (dynlight_t*) dyn;
return false; // Stop iteration.
}
/**
* This doesn't create a rendering primitive but a vissprite! The vissprite
* represents the masked poly and will be rendered during the rendering
* of sprites. This is necessary because all masked polygons must be
* rendered back-to-front, or there will be alpha artifacts along edges.
*/
void Rend_AddMaskedPoly(const rvertex_t* rvertices,
const rcolor_t* rcolors, float wallLength,
float texWidth, float texHeight,
const float texOffset[2], blendmode_t blendMode,
uint lightListIdx, boolean glow, boolean masked,
const rtexmapunit_t pTU[NUM_TEXMAP_UNITS])
{
vissprite_t* vis = R_NewVisSprite();
int i, c;
float midpoint[3];
midpoint[VX] = (rvertices[0].pos[VX] + rvertices[3].pos[VX]) / 2;
midpoint[VY] = (rvertices[0].pos[VY] + rvertices[3].pos[VY]) / 2;
midpoint[VZ] = (rvertices[0].pos[VZ] + rvertices[3].pos[VZ]) / 2;
vis->type = VSPR_MASKED_WALL;
vis->lumIdx = 0;
vis->center[VX] = midpoint[VX];
vis->center[VY] = midpoint[VY];
vis->center[VZ] = midpoint[VZ];
vis->isDecoration = false;
vis->distance = Rend_PointDist2D(midpoint);
vis->data.wall.tex = pTU[TU_PRIMARY].tex;
vis->data.wall.magMode = pTU[TU_PRIMARY].magMode;
vis->data.wall.masked = masked;
for(i = 0; i < 4; ++i)
{
vis->data.wall.vertices[i].pos[VX] = rvertices[i].pos[VX];
vis->data.wall.vertices[i].pos[VY] = rvertices[i].pos[VY];
vis->data.wall.vertices[i].pos[VZ] = rvertices[i].pos[VZ];
for(c = 0; c < 4; ++c)
{
vis->data.wall.vertices[i].color[c] =
MINMAX_OF(0, rcolors[i].rgba[c], 1);
}
}
vis->data.wall.texCoord[0][VX] = texOffset[VX] / texWidth;
vis->data.wall.texCoord[1][VX] =
vis->data.wall.texCoord[0][VX] + wallLength / texWidth;
vis->data.wall.texCoord[0][VY] = texOffset[VY] / texHeight;
vis->data.wall.texCoord[1][VY] =
vis->data.wall.texCoord[0][VY] +
(rvertices[3].pos[VZ] - rvertices[0].pos[VZ]) / texHeight;
vis->data.wall.blendMode = blendMode;
//// \fixme Semitransparent masked polys arn't lit atm
if(!glow && lightListIdx && numTexUnits > 1 && envModAdd &&
!(rcolors[0].rgba[CA] < 1))
{
dynlight_t* dyn = NULL;
/**
* The dynlights will have already been sorted so that the brightest
* and largest of them is first in the list. So grab that one.
*/
DL_ListIterator(lightListIdx, &dyn, RLIT_DynGetFirst);
vis->data.wall.modTex = dyn->texture;
vis->data.wall.modTexCoord[0][0] = dyn->s[0];
vis->data.wall.modTexCoord[0][1] = dyn->s[1];
vis->data.wall.modTexCoord[1][0] = dyn->t[0];
vis->data.wall.modTexCoord[1][1] = dyn->t[1];
for(c = 0; c < 3; ++c)
vis->data.wall.modColor[c] = dyn->color[c];
}
else
{
vis->data.wall.modTex = 0;
}
}
static void quadTexCoords(rtexcoord_t* tc, const rvertex_t* rverts,
float wallLength, const float texOrigin[2][3])
{
tc[0].st[0] = tc[1].st[0] =
rverts[0].pos[VX] - texOrigin[0][VX];
tc[3].st[1] = tc[1].st[1] =
rverts[0].pos[VY] - texOrigin[0][VY];
tc[3].st[0] = tc[2].st[0] = tc[0].st[0] + wallLength;
tc[2].st[1] = tc[3].st[1] + (rverts[1].pos[VZ] - rverts[0].pos[VZ]);
tc[0].st[1] = tc[3].st[1] + (rverts[3].pos[VZ] - rverts[2].pos[VZ]);
}
static void quadLightCoords(rtexcoord_t* tc, const float s[2],
const float t[2])
{
tc[1].st[0] = tc[0].st[0] = s[0];
tc[1].st[1] = tc[3].st[1] = t[0];
tc[3].st[0] = tc[2].st[0] = s[1];
tc[2].st[1] = tc[0].st[1] = t[1];
}
static void quadShinyMaskTexCoords(rtexcoord_t* tc, const rvertex_t* rverts,
float wallLength, float texWidth,
float texHeight, const float texOrigin[2][3],
const float texOffset[2])
{
tc[0].st[0] = tc[1].st[0] =
rverts[0].pos[VX] - texOrigin[0][VX] + texOffset[VX] / texWidth;
tc[3].st[1] = tc[1].st[1] =
rverts[0].pos[VY] - texOrigin[0][VY] + texOffset[VY] / texHeight;
tc[3].st[0] = tc[2].st[0] = tc[0].st[0] + wallLength / texWidth;
tc[2].st[1] = tc[3].st[1] + (rverts[1].pos[VZ] - rverts[0].pos[VZ]) / texHeight;
tc[0].st[1] = tc[3].st[1] + (rverts[3].pos[VZ] - rverts[2].pos[VZ]) / texHeight;
}
static float shinyVertical(float dy, float dx)
{
return ( (atan(dy/dx) / (PI/2)) + 1 ) / 2;
}
static void quadShinyTexCoords(rtexcoord_t* tc, const rvertex_t* topLeft,
const rvertex_t* bottomRight, float wallLength)
{
uint i;
vec2_t surface, normal, projected, s, reflected, view;
float distance, angle, prevAngle = 0;
// Quad surface vector.
V2_Set(surface,
(bottomRight->pos[VX] - topLeft->pos[VX]) / wallLength,
(bottomRight->pos[VY] - topLeft->pos[VY]) / wallLength);
V2_Set(normal, surface[VY], -surface[VX]);
// Calculate coordinates based on viewpoint and surface normal.
for(i = 0; i < 2; ++i)
{
// View vector.
V2_Set(view, vx - (i == 0? topLeft->pos[VX] : bottomRight->pos[VX]),
vz - (i == 0? topLeft->pos[VY] : bottomRight->pos[VY]));
distance = V2_Normalize(view);
V2_Project(projected, view, normal);
V2_Subtract(s, projected, view);
V2_Scale(s, 2);
V2_Sum(reflected, view, s);
angle = acos(reflected[VY]) / PI;
if(reflected[VX] < 0)
{
angle = 1 - angle;
}
if(i == 0)
{
prevAngle = angle;
}
else
{
if(angle > prevAngle)
angle -= 1;
}
// Horizontal coordinates.
tc[ (i == 0 ? 1 : 2) ].st[0] = tc[ (i == 0 ? 0 : 3) ].st[0] =
angle + .3f; /*acos(-dot)/PI*/
tc[ (i == 0 ? 0 : 2) ].st[1] =
shinyVertical(vy - bottomRight->pos[VZ], distance);