-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmap.c
2661 lines (2293 loc) · 68.2 KB
/
map.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) 1999-2006 Id Software, Inc. and contributors.
For a list of contributors, see the accompanying CONTRIBUTORS file.
This file is part of GtkRadiant.
GtkRadiant 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.
GtkRadiant 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 GtkRadiant; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
----------------------------------------------------------------------------------
This code has been altered significantly from its original form, to support
several games based on the Quake III Arena engine, in the form of "Q3Map2."
------------------------------------------------------------------------------- */
/* marker */
#define MAP_C
/* dependencies */
//#include "q3map2.h"
#include "kmap2.h" //add hypov8
/* FIXME: remove these vars */
/* undefine to make plane finding use linear sort (note: really slow) */
#define USE_HASHING
#define PLANE_HASHES 8192
int planehash[PLANE_HASHES];
int c_boxbevels;
int c_edgebevels;
int c_areaportals;
int c_detail;
int c_structural;
int c_mergedFuncStatics;
entity_t convertDetailBrushesEntity;
/*
PlaneEqual()
ydnar: replaced with variable epsilon for djbob
*/
#define NORMAL_EPSILON 0.00001
#define DIST_EPSILON 0.01
qboolean PlaneEqual(plane_t * p, vec3_t normal, vec_t dist)
{
float ne, de;
/* get local copies */
ne = normalEpsilon;
de = distanceEpsilon;
/* compare */
if(fabs(p->dist - dist) <= de &&
fabs(p->normal[0] - normal[0]) <= ne && fabs(p->normal[1] - normal[1]) <= ne && fabs(p->normal[2] - normal[2]) <= ne)
return qtrue;
/* different */
return qfalse;
}
/*
AddPlaneToHash()
*/
void AddPlaneToHash(plane_t * p)
{
int hash;
hash = (PLANE_HASHES - 1) & (int)fabs(p->dist);
p->hash_chain = planehash[hash];
planehash[hash] = p - mapplanes + 1;
}
/*
================
CreateNewFloatPlane
================
*/
int CreateNewFloatPlane(vec3_t normal, vec_t dist)
{
plane_t *p, temp;
if(VectorLength(normal) < 0.5)
{
Sys_Printf("FloatPlane: bad normal\n");
return -1;
}
// create a new plane
AUTOEXPAND_BY_REALLOC(mapplanes, nummapplanes + 1, allocatedmapplanes, 1024);
p = &mapplanes[nummapplanes];
VectorCopy(normal, p->normal);
p->dist = dist;
p->type = (p + 1)->type = PlaneTypeForNormal(p->normal);
VectorSubtract(vec3_origin, normal, (p + 1)->normal);
(p + 1)->dist = -dist;
nummapplanes += 2;
// allways put axial planes facing positive first
if(p->type < 3)
{
if(p->normal[0] < 0 || p->normal[1] < 0 || p->normal[2] < 0)
{
// flip order
temp = *p;
*p = *(p + 1);
*(p + 1) = temp;
AddPlaneToHash(p);
AddPlaneToHash(p + 1);
return nummapplanes - 1;
}
}
AddPlaneToHash(p);
AddPlaneToHash(p + 1);
return nummapplanes - 2;
}
/*
SnapNormal()
snaps a near-axial normal vector
*/
void SnapNormal(vec3_t normal)
{
int i;
for(i = 0; i < 3; i++)
{
if(fabs(normal[i] - 1) < normalEpsilon)
{
VectorClear(normal);
normal[i] = 1;
break;
}
if(fabs(normal[i] - -1) < normalEpsilon)
{
VectorClear(normal);
normal[i] = -1;
break;
}
}
}
/*
SnapPlane()
snaps a plane to normal/distance epsilons
*/
void SnapPlane(vec3_t normal, vec_t * dist, vec3_t center)
{
// SnapPlane disabled by LordHavoc because it often messes up collision
// brushes made from triangles of embedded models, and it has little effect
// on anything else (axial planes are usually derived from snapped points)
/*
SnapPlane reenabled by namespace because of multiple reports of
q3map2-crashes which were triggered by this patch.
*/
// div0: ensure the point "center" stays on the plane (actually, this
// rotates the plane around the point center).
// if center lies on the plane, it is guaranteed to stay on the plane by
// this fix.
SnapNormal(normal);
if(center)
{
vec_t centerDist = DotProduct(normal, center);
*dist += (DotProduct(normal, center) - centerDist);
}
if(fabs(*dist - Q_rint(*dist)) < distanceEpsilon)
*dist = Q_rint(*dist);
}
/*
FindFloatPlane()
ydnar: changed to allow a number of test points to be supplied that
must be within an epsilon distance of the plane
*/
// *INDENT-OFF*
int FindFloatPlane(vec3_t innormal, vec_t dist, int numPoints, vec3_t * points)
#ifdef USE_HASHING
{
int i, j, hash, h;
int pidx;
plane_t *p;
vec_t d;
vec3_t centerofweight;
vec3_t normal;
VectorClear(centerofweight);
for(i = 0; i < numPoints; ++i)
VectorMA(centerofweight, 1.0 / numPoints, points[i], centerofweight);
/* hash the plane */
VectorCopy(innormal, normal);
SnapPlane(normal, &dist, centerofweight);
hash = (PLANE_HASHES - 1) & (int)fabs(dist);
/* search the border bins as well */
for(i = -1; i <= 1; i++)
{
h = (hash + i) & (PLANE_HASHES - 1);
for(pidx = planehash[h] - 1; pidx != -1; pidx = mapplanes[pidx].hash_chain - 1)
{
p = &mapplanes[pidx];
/* do standard plane compare */
if(!PlaneEqual(p, normal, dist))
continue;
/* ydnar: uncomment the following line for old-style plane finding */
//% return p - mapplanes;
/* ydnar: test supplied points against this plane */
for(j = 0; j < numPoints; j++)
{
d = DotProduct(points[j], normal) - dist;
if(fabs(d) > distanceEpsilon)
break;
}
/* found a matching plane */
if(j >= numPoints)
return p - mapplanes;
}
}
/* none found, so create a new one */
return CreateNewFloatPlane(normal, dist);
}
#else
{
int i;
plane_t *p;
vec3_t normal;
vec3_t centerofweight;
VectorClear(centerofweight);
for(i = 0; i < numPoints; ++i)
VectorMA(centerofweight, 1.0 / numPoints, points[i], centerofweight);
VectorCopy(innormal, normal);
SnapPlane(normal, &dist, centerofweight);
for(i = 0, p = mapplanes; i < nummapplanes; i++, p++)
{
if(PlaneEqual(p, normal, dist))
return i;
}
return CreateNewFloatPlane(normal, dist);
}
#endif
// *INDENT-ON*
/*
MapPlaneFromPoints()
takes 3 points and finds the plane they lie in
*/
int MapPlaneFromPoints(vec3_t * p)
{
vec3_t t1, t2, normal;
vec_t dist;
/* calc plane normal */
VectorSubtract(p[0], p[1], t1);
VectorSubtract(p[2], p[1], t2);
CrossProduct(t1, t2, normal);
VectorNormalize(normal);
/* calc plane distance */
dist = DotProduct(p[0], normal);
/* store the plane */
return FindFloatPlane(normal, dist, 3, p);
}
int MapPlaneFromEquation(vec4_t plane)
{
vec3_t normal;
vec_t dist;
vec_t mag;
dist = -plane[3];
mag = VectorNormalize2(plane, normal);
if(mag)
plane[3] /= mag;
SnapPlane(normal, &dist, NULL);
/* Tr3B: debug it */
// Sys_FPrintf( SYS_VRB, "MapPlaneFromEquation: (%i %i %i %i)\n", (int)normal[0], (int)normal[1], (int)normal[2], (int)dist);
return FindFloatPlane(normal, dist, 0, NULL);
}
/*
CompareBrushSides()
compare function for qsort()
*/
static int CompareBrushSides(const void *a, const void *b)
{
side_t *sidea, *sideb;
sidea = (side_t *) a;
sideb = (side_t *) b;
/* move area portals to the front */
if((sidea->compileFlags & C_AREAPORTAL) && !(sideb->compileFlags & C_AREAPORTAL))
return -1;
else if(!(sidea->compileFlags & C_AREAPORTAL) && (sideb->compileFlags & C_AREAPORTAL))
return 1;
/* functionally equivalent */
return 0;
}
/*
SetBrushContents()
the content flags and compile flags on all sides of a brush should be the same
*/
void SetBrushContents(brush_t * b)
{
int contentFlags, compileFlags;
side_t *s;
int i;
qboolean mixed;
/* Tr3B: sort brush sides because Doom 3 visportals don't need to be on the first brush side */
qsort(b->sides, b->numsides, sizeof(b->sides[0]), CompareBrushSides);
/* get initial compile flags from first side */
s = &b->sides[0];
contentFlags = s->contentFlags;
compileFlags = s->compileFlags;
b->contentShader = s->shaderInfo;
mixed = qfalse;
/* get the content/compile flags for every side in the brush */
for(i = 1; i < b->numsides; i++, s++)
{
s = &b->sides[i];
if(s->shaderInfo == NULL)
continue;
if(s->contentFlags != contentFlags || s->compileFlags != compileFlags)
mixed = qtrue;
contentFlags |= s->contentFlags;
compileFlags |= s->compileFlags;
}
/* ydnar: getting rid of this stupid warning */
//% if( mixed )
//% Sys_FPrintf( SYS_VRB,"Entity %i, Brush %i: mixed face contentFlags\n", b->entitynum, b->brushnum );
/* check for detail & structural */
if((compileFlags & C_DETAIL) && (compileFlags & C_STRUCTURAL))
{
#if defined(USE_XML)
xml_Select("Mixed detail and structural (defaulting to structural)", mapEnt->mapEntityNum, entitySourceBrushes, qfalse);
#else
Sys_Printf("Entity %i, Brush %i: Mixed detail and structural (defaulting to structural)\n", mapEnt->mapEntityNum, entitySourceBrushes, qfalse);
#endif
compileFlags &= ~C_DETAIL;
}
/* the fulldetail flag will cause detail brushes to be treated like normal brushes */
if(fulldetail)
compileFlags &= ~C_DETAIL;
/* all translucent brushes that aren't specifically made structural will be detail */
if((compileFlags & C_TRANSLUCENT) && !(compileFlags & C_STRUCTURAL))
compileFlags |= C_DETAIL;
/* detail? */
if(compileFlags & C_DETAIL)
{
c_detail++;
b->detail = qtrue;
}
else
{
c_structural++;
b->detail = qfalse;
}
/* opaque? */
if(compileFlags & C_TRANSLUCENT)
b->opaque = qfalse;
else
b->opaque = qtrue;
/* areaportal? */
if(compileFlags & C_AREAPORTAL)
c_areaportals++;
/* set brush flags */
b->contentFlags = contentFlags;
b->compileFlags = compileFlags;
}
/*
AddBrushBevels()
adds any additional planes necessary to allow the brush being
built to be expanded against axial bounding boxes
ydnar 2003-01-20: added mrelusive fixes
*/
void AddBrushBevels(void)
{
int axis, dir;
int i, j, k, l, order;
side_t sidetemp;
side_t *s, *s2;
winding_t *w, *w2;
vec3_t normal;
float dist;
vec3_t vec, vec2;
float d, minBack;
//
// add the axial planes
//
order = 0;
for(axis = 0; axis < 3; axis++)
{
for(dir = -1; dir <= 1; dir += 2, order++)
{
// see if the plane is allready present
for(i = 0, s = buildBrush->sides; i < buildBrush->numsides; i++, s++)
{
/* ydnar: testing disabling of mre code */
#if 0
if(dir > 0)
{
if(mapplanes[s->planenum].normal[axis] >= 0.9999f)
{
break;
}
}
else
{
if(mapplanes[s->planenum].normal[axis] <= -0.9999f)
{
break;
}
}
#else
if((dir > 0 && mapplanes[s->planenum].normal[axis] == 1.0f) ||
(dir < 0 && mapplanes[s->planenum].normal[axis] == -1.0f))
break;
#endif
}
if(i == buildBrush->numsides)
{
// add a new side
if(buildBrush->numsides == MAX_BUILD_SIDES)
{
#if defined(USE_XML)
xml_Select("MAX_BUILD_SIDES", buildBrush->entityNum, buildBrush->brushNum, qtrue);
#else
Sys_Printf("Entity %i, Brush %i: MAX_BUILD_SIDES", buildBrush->entityNum, buildBrush->brushNum);
#endif
}
memset(s, 0, sizeof(*s));
buildBrush->numsides++;
VectorClear(normal);
normal[axis] = dir;
if(dir == 1)
{
/* ydnar: adding bevel plane snapping for fewer bsp planes */
if(bevelSnap > 0)
dist = floor(buildBrush->maxs[axis] / bevelSnap) * bevelSnap;
else
dist = buildBrush->maxs[axis];
}
else
{
/* ydnar: adding bevel plane snapping for fewer bsp planes */
if(bevelSnap > 0)
dist = -ceil(buildBrush->mins[axis] / bevelSnap) * bevelSnap;
else
dist = -buildBrush->mins[axis];
}
s->planenum = FindFloatPlane(normal, dist, 0, NULL);
s->contentFlags = buildBrush->sides[0].contentFlags;
s->bevel = qtrue;
c_boxbevels++;
}
// if the plane is not in it canonical order, swap it
if(i != order)
{
sidetemp = buildBrush->sides[order];
buildBrush->sides[order] = buildBrush->sides[i];
buildBrush->sides[i] = sidetemp;
}
}
}
//
// add the edge bevels
//
if(buildBrush->numsides == 6)
{
return; // pure axial
}
// test the non-axial plane edges
for(i = 6; i < buildBrush->numsides; i++)
{
s = buildBrush->sides + i;
w = s->winding;
if(!w)
{
continue;
}
for(j = 0; j < w->numpoints; j++)
{
k = (j + 1) % w->numpoints;
VectorSubtract(w->p[j], w->p[k], vec);
if(VectorNormalize(vec) < 0.5f)
{
continue;
}
SnapNormal(vec);
for(k = 0; k < 3; k++)
{
if(vec[k] == -1.0f || vec[k] == 1.0f || (vec[k] == 0.0f && vec[(k + 1) % 3] == 0.0f))
{
break; // axial
}
}
if(k != 3)
{
continue; // only test non-axial edges
}
/* debug code */
//% Sys_Printf( "-------------\n" );
// try the six possible slanted axials from this edge
for(axis = 0; axis < 3; axis++)
{
for(dir = -1; dir <= 1; dir += 2)
{
// construct a plane
VectorClear(vec2);
vec2[axis] = dir;
CrossProduct(vec, vec2, normal);
if(VectorNormalize(normal) < 0.5f)
{
continue;
}
dist = DotProduct(w->p[j], normal);
// if all the points on all the sides are
// behind this plane, it is a proper edge bevel
for(k = 0; k < buildBrush->numsides; k++)
{
// if this plane has allready been used, skip it
if(PlaneEqual(&mapplanes[buildBrush->sides[k].planenum], normal, dist))
{
break;
}
w2 = buildBrush->sides[k].winding;
if(!w2)
{
continue;
}
minBack = 0.0f;
for(l = 0; l < w2->numpoints; l++)
{
d = DotProduct(w2->p[l], normal) - dist;
if(d > 0.1f)
{
break; // point in front
}
if(d < minBack)
{
minBack = d;
}
}
// if some point was at the front
if(l != w2->numpoints)
{
break;
}
// if no points at the back then the winding is on the bevel plane
if(minBack > -0.1f)
{
//% Sys_Printf( "On bevel plane\n" );
break;
}
}
if(k != buildBrush->numsides)
{
continue; // wasn't part of the outer hull
}
/* debug code */
//% Sys_Printf( "n = %f %f %f\n", normal[ 0 ], normal[ 1 ], normal[ 2 ] );
// add this plane
if(buildBrush->numsides == MAX_BUILD_SIDES)
{
#if defined(USE_XML)
xml_Select("MAX_BUILD_SIDES", buildBrush->entityNum, buildBrush->brushNum, qtrue);
#else
Sys_Printf("Entity %i, Brush %i: MAX_BUILD_SIDES\n", buildBrush->entityNum, buildBrush->brushNum);
#endif
}
s2 = &buildBrush->sides[buildBrush->numsides];
buildBrush->numsides++;
memset(s2, 0, sizeof(*s2));
s2->planenum = FindFloatPlane(normal, dist, 1, &w->p[j]);
s2->contentFlags = buildBrush->sides[0].contentFlags;
s2->bevel = qtrue;
c_edgebevels++;
}
}
}
}
}
/*
FinishBrush()
produces a final brush based on the buildBrush->sides array
and links it to the current entity
*/
static void MergeOrigin(entity_t * ent, vec3_t origin)
{
vec3_t adjustment;
char string[128];
/* we have not parsed the brush completely yet... */
GetVectorForKey(ent, "origin", ent->origin);
VectorMA(origin, -1, ent->originbrush_origin, adjustment);
VectorAdd(adjustment, ent->origin, ent->origin);
VectorCopy(origin, ent->originbrush_origin);
sprintf(string, "%f %f %f", ent->origin[0], ent->origin[1], ent->origin[2]);
SetKeyValue(ent, "origin", string);
}
brush_t *FinishBrush(void)
{
brush_t *b;
/* create windings for sides and bounds for brush */
if(!CreateBrushWindings(buildBrush))
return NULL;
/* origin brushes are removed, but they set the rotation origin for the rest of the brushes in the entity.
after the entire entity is parsed, the planenums and texinfos will be adjusted for the origin brush */
if(buildBrush->compileFlags & C_ORIGIN)
{
vec3_t origin;
Sys_Printf("Entity %i, Brush %i: origin brush detected\n", mapEnt->mapEntityNum, entitySourceBrushes);
if(numEntities == 1)
{
Sys_Printf("Entity %i, Brush %i: origin brushes not allowed in world\n", mapEnt->mapEntityNum, entitySourceBrushes);
return NULL;
}
VectorAdd(buildBrush->mins, buildBrush->maxs, origin);
VectorScale(origin, 0.5, origin);
MergeOrigin(&entities[numEntities - 1], origin);
/* don't keep this brush */
return NULL;
}
/* determine if the brush is an area portal */
if(buildBrush->compileFlags & C_AREAPORTAL)
{
if(numEntities != 1)
{
Sys_Printf("Entity %i, Brush %i: areaportals only allowed in world\n", numEntities - 1, entitySourceBrushes);
return NULL;
}
}
/* add bevel planes */
if(convertType == CONVERT_NOTHING)
{
AddBrushBevels();
}
/* keep it */
b = CopyBrush(buildBrush);
/* set map entity and brush numbering */
b->entityNum = mapEnt->mapEntityNum;
b->brushNum = entitySourceBrushes;
/* set original */
b->original = b;
/* link opaque brushes to head of list, translucent brushes to end */
if(b->opaque || mapEnt->lastBrush == NULL)
{
b->next = mapEnt->brushes;
mapEnt->brushes = b;
if(mapEnt->lastBrush == NULL)
mapEnt->lastBrush = b;
}
else
{
b->next = NULL;
mapEnt->lastBrush->next = b;
mapEnt->lastBrush = b;
}
/* link colorMod volume brushes to the entity directly */
if(b->contentShader != NULL && b->contentShader->colorMod != NULL && b->contentShader->colorMod->type == CM_VOLUME)
{
b->nextColorModBrush = mapEnt->colorModBrushes;
mapEnt->colorModBrushes = b;
}
{
side_t *s;
int i;
/* get the content/compile flags for every side in the brush */
for(i = 0, s = &b->sides[0]; i < b->numsides; i++, s++)
{
s = &b->sides[i];
if(s->shaderInfo == NULL)
{
continue;
}
}
}
/* return to sender */
return b;
}
/*
TextureAxisFromPlane()
determines best orthagonal axis to project a texture onto a wall
(must be identical in radiant!)
*/
vec3_t baseaxis[18] = {
{0, 0, 1}
, {1, 0, 0}
, {0, -1, 0}
, // floor
{0, 0, -1}
, {1, 0, 0}
, {0, -1, 0}
, // ceiling
{1, 0, 0}
, {0, 1, 0}
, {0, 0, -1}
, // west wall
{-1, 0, 0}
, {0, 1, 0}
, {0, 0, -1}
, // east wall
{0, 1, 0}
, {1, 0, 0}
, {0, 0, -1}
, // south wall
{0, -1, 0}
, {1, 0, 0}
, {0, 0, -1} // north wall
};
void TextureAxisFromPlane(plane_t * pln, vec3_t xv, vec3_t yv)
{
int bestaxis;
vec_t dot, best;
int i;
best = 0;
bestaxis = 0;
for(i = 0; i < 6; i++)
{
dot = DotProduct(pln->normal, baseaxis[i * 3]);
if(dot > best + 0.0001f) /* ydnar: bug 637 fix, suggested by jmonroe */
{
best = dot;
bestaxis = i;
}
}
VectorCopy(baseaxis[bestaxis * 3 + 1], xv);
VectorCopy(baseaxis[bestaxis * 3 + 2], yv);
}
/*
QuakeTextureVecs()
creates world-to-texture mapping vecs for crappy quake plane arrangements
*/
void QuakeTextureVecs(plane_t * plane, vec_t shift[2], vec_t rotate, vec_t scale[2], vec_t mappingVecs[2][4])
{
vec3_t vecs[2];
int sv, tv;
vec_t ang, sinv, cosv;
vec_t ns, nt;
int i, j;
TextureAxisFromPlane(plane, vecs[0], vecs[1]);
if(!scale[0])
scale[0] = 1;
if(!scale[1])
scale[1] = 1;
// rotate axis
if(rotate == 0)
{
sinv = 0;
cosv = 1;
}
else if(rotate == 90)
{
sinv = 1;
cosv = 0;
}
else if(rotate == 180)
{
sinv = 0;
cosv = -1;
}
else if(rotate == 270)
{
sinv = -1;
cosv = 0;
}
else
{
ang = rotate / 180 * Q_PI;
sinv = sin(ang);
cosv = cos(ang);
}
if(vecs[0][0])
sv = 0;
else if(vecs[0][1])
sv = 1;
else
sv = 2;
if(vecs[1][0])
tv = 0;
else if(vecs[1][1])
tv = 1;
else
tv = 2;
for(i = 0; i < 2; i++)
{
ns = cosv * vecs[i][sv] - sinv * vecs[i][tv];
nt = sinv * vecs[i][sv] + cosv * vecs[i][tv];
vecs[i][sv] = ns;
vecs[i][tv] = nt;
}
for(i = 0; i < 2; i++)
for(j = 0; j < 3; j++)
mappingVecs[i][j] = vecs[i][j] / scale[i];
mappingVecs[0][3] = shift[0];
mappingVecs[1][3] = shift[1];
}
/*
ParseRawBrush()
parses the sides into buildBrush->sides[], nothing else.
no validation, back plane removal, etc.
Timo - 08/26/99
added brush epairs parsing ( ignoring actually )
Timo - 08/04/99
added exclusive brush primitive parsing
Timo - 08/08/99
support for old brush format back in
NOTE: it would be "cleaner" to have seperate functions to parse between old and new brushes
*/
static void ParseRawBrush(qboolean onlyLights)
{
side_t *side;
vec3_t planePoints[3];
vec4_t planeEquation;
int planenum;
shaderInfo_t *si;
vec_t shift[2];
vec_t rotate;
vec_t scale[2];
char name[MAX_QPATH];
char shader[MAX_QPATH];
int flags;
/* initial setup */
buildBrush->numsides = 0;
buildBrush->detail = qfalse;
/* bp */
if(g_bBrushPrimit >= BPRIMIT_NEWBRUSHES)
MatchToken("{");
/* parse sides */
while(1)
{
if(!GetToken(qtrue))
break;
if(!strcmp(token, "}"))
break;
/* ttimo : bp: here we may have to jump over brush epairs (only used in editor) */
if(g_bBrushPrimit >= BPRIMIT_NEWBRUSHES)
{
while(1)
{
if(strcmp(token, "("))
GetToken(qfalse);
else
break;
GetToken(qtrue);
}
}
UnGetToken();