-
Notifications
You must be signed in to change notification settings - Fork 32
/
render.old1
1452 lines (1210 loc) · 31 KB
/
render.old1
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
/*
This file is part of Iceball.
Iceball is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Iceball 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 Iceball. If not, see <http://www.gnu.org/licenses/>.
*/
#include "common.h"
//define DEBUG_INVERT_DRAW_DIR
// TODO: bump up to 127.5f
#define FOG_DISTANCE 60.0f
#define RAYC_MAX ((int)((FOG_DISTANCE+1)*(FOG_DISTANCE+1)*8+10))
#define DF_NX 0x01
#define DF_NY 0x02
#define DF_NZ 0x04
#define DF_PX 0x08
#define DF_PY 0x10
#define DF_PZ 0x20
#define DF_SPREAD 0x3F
enum
{
CM_NX = 0,
CM_NY,
CM_NZ,
CM_PX,
CM_PY,
CM_PZ,
CM_MAX
};
uint32_t *cubemap_color[CM_MAX];
float *cubemap_depth[CM_MAX];
int cubemap_size;
int cubemap_shift;
uint32_t *rtmp_pixels;
int rtmp_width, rtmp_height, rtmp_pitch;
camera_t *rtmp_camera;
map_t *rtmp_map;
typedef struct raydata {
int16_t x,y,z;
int8_t gx,gz;
float y1,y2;
float sx,sy,sz;
} raydata_t;
typedef struct rayblock {
uint32_t color;
float x,y,z;
} rayblock_t;
int rayc_block_len, rayc_block_head;
int rayc_data_len, rayc_data_head;
raydata_t rayc_data[RAYC_MAX];
rayblock_t *rayc_block = NULL;
int *rayc_mark = NULL;
int rayc_block_size = 0;
int rayc_mark_size = 0;
float *dbuf;
/*
* REFERENCE IMPLEMENTATION
*
*/
uint32_t render_fog_apply_new(uint32_t color, float depth)
{
int b = color&255;
int g = (color>>8)&255;
int r = (color>>16)&255;
int t = (color>>24)&255;
//float fog = (FOG_DISTANCE*FOG_DISTANCE/depth)/256.0f;
float fog = (FOG_DISTANCE*FOG_DISTANCE-(depth < 0.001f ? 0.001f : depth))
/(FOG_DISTANCE*FOG_DISTANCE);
if(fog > 1.0f)
fog = 1.0f;
if(fog < 0.0f)
fog = 0.0f;
r = (r*fog+0.5f);
g = (g*fog+0.5f);
b = (b*fog+0.5f);
return b|(g<<8)|(r<<16)|(t<<24);
}
uint32_t render_fog_apply(uint32_t color, float depth)
{
int b = color&255;
int g = (color>>8)&255;
int r = (color>>16)&255;
int t = (color>>24)&255;
float fog = (FOG_DISTANCE-(depth < 0.001f ? 0.001f : depth))/FOG_DISTANCE;
if(fog > 1.0f)
fog = 1.0f;
if(fog < 0.0f)
fog = 0.0f;
r = (r*fog+0.5f);
g = (g*fog+0.5f);
b = (b*fog+0.5f);
return b|(g<<8)|(r<<16)|(t<<24);
}
void render_rect_clip(uint32_t *color, int *x1, int *y1, int *x2, int *y2, float depth)
{
*color = render_fog_apply(*color, depth);
// arrange *1 <= *2
if(*x1 > *x2)
{
int t = *x1;
*x1 = *x2;
*x2 = t;
}
if(*y1 > *y2)
{
int t = *y1;
*y1 = *y2;
*y2 = t;
}
// clip
if(*x1 < 0)
*x1 = 0;
if(*y1 < 0)
*y1 = 0;
if(*x2 > cubemap_size)
*x2 = cubemap_size;
if(*y2 > cubemap_size)
*y2 = cubemap_size;
}
void render_rect_clip_screen(uint32_t *color, int *x1, int *y1, int *x2, int *y2, float depth)
{
*color = render_fog_apply(*color, depth);
// arrange *1 <= *2
if(*x1 > *x2)
{
int t = *x1;
*x1 = *x2;
*x2 = t;
}
if(*y1 > *y2)
{
int t = *y1;
*y1 = *y2;
*y2 = t;
}
// clip
if(*x1 < 0)
*x1 = 0;
if(*y1 < 0)
*y1 = 0;
if(*x2 > rtmp_width)
*x2 = rtmp_width;
if(*y2 > rtmp_height)
*y2 = rtmp_height;
}
void render_rect_zbuf(uint32_t *ccolor, float *cdepth, int x1, int y1, int x2, int y2, uint32_t color, float depth)
{
int x,y;
// clip
render_rect_clip_screen(&color, &x1, &y1, &x2, &y2, depth);
//uint32_t dummy;
//render_rect_clip_screen(&dummy, &x1, &y1, &x2, &y2, depth);
if(x2 <= 0)
return;
if(x1 >= rtmp_width)
return;
if(y2 <= 0)
return;
if(y1 >= rtmp_height)
return;
if(x1 == x2)
return;
if(y1 == y2)
return;
// render
uint32_t *cptr = &ccolor[y1*rtmp_pitch+x1];
float *dptr = &cdepth[y1*rtmp_width+x1];
int stride = x2-x1;
int pitch = rtmp_pitch - stride;
int dpitch = rtmp_width - stride;
for(y = y1; y < y2; y++)
{
for(x = x1; x < x2; x++)
{
if(*dptr > depth)
{
*dptr = depth;
*cptr = color;
}
cptr++; dptr++;
}
dptr += dpitch;
cptr += pitch;
}
}
// TODO: fast ver?
void render_vxl_rect_ftb_fast(uint32_t *ccolor, float *cdepth, int x1, int y1, int x2, int y2, uint32_t color, float depth)
//void render_vxl_rect_ftb_slow(uint32_t *ccolor, float *cdepth, int x1, int y1, int x2, int y2, uint32_t color, float depth)
{
int x,y;
// TODO: stop using this bloody function
// (alternatively, switch to the fast FTB as used in Doom and Quake)
//
// NOTE: this approach seems to be faster than render_vxl_rect_btf.
// clip
uint32_t dummy;
render_rect_clip(&dummy, &x1, &y1, &x2, &y2, depth);
if(x2 <= 0)
return;
if(x1 >= cubemap_size)
return;
if(y2 <= 0)
return;
if(y1 >= cubemap_size)
return;
if(x1 == x2)
return;
if(y1 == y2)
return;
// render
uint32_t *cptr = &ccolor[(y1<<cubemap_shift)+x1];
float *dptr = &cdepth[(y1<<cubemap_shift)+x1];
int pitch = cubemap_size - (x2-x1);
for(y = y1; y < y2; y++)
{
for(x = x1; x < x2; x++)
{
if(*cptr == 0)
{
*cptr = color;
*dptr = depth;
}
cptr++;
dptr++;
}
cptr += pitch;
dptr += pitch;
}
}
void render_vxl_cube_sides(uint32_t *ccolor, float *cdepth, int x1, int y1, int x2, int y2, uint32_t color, float depth)
{
int hsize = (cubemap_size>>1);
int x3 = ((x1-hsize)*depth)/(depth+0.5f)+hsize;
int y3 = ((y1-hsize)*depth)/(depth+0.5f)+hsize;
int x4 = ((x2-hsize)*depth)/(depth+0.5f)+hsize;
int y4 = ((y2-hsize)*depth)/(depth+0.5f)+hsize;
// TODO: replace these with trapezium drawing routines
if(x3 < x1)
render_vxl_rect_ftb_fast(ccolor, cdepth,
(int)x3, (int)y3, (int)x1, (int)y4,
color, depth);
else if(x2 < x4)
render_vxl_rect_ftb_fast(ccolor, cdepth,
(int)x2, (int)y3, (int)x4, (int)y4,
color, depth);
if(y3 < y1)
render_vxl_rect_ftb_fast(ccolor, cdepth,
(int)x3, (int)y3, (int)x4, (int)y1,
color, depth);
else if(y2 < y4)
render_vxl_rect_ftb_fast(ccolor, cdepth,
(int)x3, (int)y2, (int)x4, (int)y4,
color, depth);
}
void render_vxl_cube(uint32_t *ccolor, float *cdepth, int x1, int y1, int x2, int y2, uint32_t color, float depth)
{
render_vxl_rect_ftb_fast(ccolor, cdepth, x1, y1, x2, y2, color, depth);
render_vxl_cube_sides(ccolor, cdepth, x1, y1, x2, y2, color, depth);
}
void render_vxl_face_vert(int blkx, int blky, int blkz,
float subx, float suby, float subz,
int face,
int gx, int gy, int gz)
{
// TODO: this function sucks, speed it up a bit
int sx,sy;
int i;
float tracemul = cubemap_size/2;
float traceadd = tracemul;
// get cubemaps
uint32_t *ccolor = cubemap_color[face];
float *cdepth = cubemap_depth[face];
// clear cubemap
for(i = 0; i < cubemap_size*cubemap_size; i++)
{
ccolor[i] = 0x00000000;
cdepth[i] = FOG_DISTANCE;
}
// get X cube direction
int xgx = gz+gy;
int xgy = 0;
int xgz = -gx;
// get Y cube direction
int ygx = 0;
int ygy = gx+gz;
int ygz = gy;
// get cubemap offset
float cmoffsx = -(xgx*subx+xgy*suby+xgz*subz);
float cmoffsy = -(ygx*subx+ygy*suby+ygz*subz);
// get distance to wall
float dist = -(subx*gx+suby*gy+subz*gz);
if(dist < 0.0f)
dist = 1.0f+dist;
else {
//blky--;
blkx--;
blkz--;
}
dist -= 1.0f;
//int coz = blky;
// now build pillars
static uint32_t cdata[256]; // hypothetical maximum
// render cubes from centre out
float odist = dist;
int lbx1 = 2;
int lby1 = 2;
int lbx2 = -2;
int lby2 = -2;
// prep boundaries
int bx1 = 0;
int by1 = 0;
int bx2 = 0;
int by2 = 0;
if(gy < 0)
{
bx1++;
by1++;
bx2++;
by2++;
}
int xlen = rtmp_map->xlen;
int ylen = rtmp_map->ylen;
int zlen = rtmp_map->zlen;
int xlenm1 = xlen-1;
int ylenm1 = ylen-1;
int zlenm1 = zlen-1;
while(dist < FOG_DISTANCE)
{
// go through each
int cox,coy;
cox = bx1; coy = by1;
int pdx = 1, pdy = 0;
for(;;)
{
// skip already-rendered stuff
//if(cox >= lbx1 && coy >= lby1 && cox <= lbx2 && coy <= lby2)
// continue;
// get pillar
uint8_t *pillar = rtmp_map->pillars[
((cox+blkx)&(xlenm1))
+(((coy+blkz)&(zlenm1))*xlen)]+4;
// load data
i = 0;
for(;;)
{
uint8_t *csrc = &pillar[4];
int nrem = pillar[0]-1;
for(; i < pillar[1]; i++)
cdata[i] = 0;
for(; i <= pillar[2]; i++, nrem--, csrc += 4)
cdata[i] = *(uint32_t *)csrc;
if(pillar[0] == 0)
break;
pillar += 4*(int)pillar[0];
for(; i < pillar[3]-nrem; i++)
cdata[i] = 1;
for(; i < pillar[3]; i++, csrc += 4)
cdata[i] = *(uint32_t *)csrc;
}
for(; i < ylen; i++)
cdata[i] = 1;
// render data
if(gy >= 0)
{
// bottom cubemap
float fdist = 0.0f-blky-suby;
// TODO: work out min required distance by frustum
i = 0;
fdist += i;
for(; i < ylen; i++)
{
if(fdist >= dist && fdist >= 0.001f && cdata[i] > 1)
{
float boxsize = tracemul/fdist;
float px1 = (cox+cmoffsx)*boxsize+traceadd;
float py1 = (coy+cmoffsy)*boxsize+traceadd;
float px2 = px1+boxsize;
float py2 = py1+boxsize;
if(1 || i == 0 || cdata[i-1] == 0)
{
render_vxl_cube(ccolor, cdepth,
(int)px1, (int)py1, (int)px2, (int)py2,
cdata[i], fdist);
} else {
render_vxl_cube_sides(ccolor, cdepth,
(int)px1, (int)py1, (int)px2, (int)py2,
cdata[i], fdist);
}
}
fdist += 1.0f;
if(fdist >= FOG_DISTANCE)
break;
}
} else {
// top cubemap
float fdist = 0.0f-blky-suby;
fdist = -ylen-fdist;
// TODO: work out min required distance by frustum
i = ylenm1;
for(; i >= 0; i--)
{
if(fdist >= dist && fdist >= 0.001f && cdata[i] > 1)
{
float boxsize = tracemul/fdist;
float px1 = (-cox+cmoffsx)*boxsize+traceadd;
float py1 = (-coy+cmoffsy)*boxsize+traceadd;
float px2 = px1+boxsize;
float py2 = py1+boxsize;
if(1 || i == ylenm1 || cdata[i+1] == 0)
{
render_vxl_cube(ccolor, cdepth,
(int)px1, (int)py1, (int)px2, (int)py2,
cdata[i], fdist);
} else {
render_vxl_cube_sides(ccolor, cdepth,
(int)px1, (int)py1, (int)px2, (int)py2,
cdata[i], fdist);
}
}
fdist += 1.0f;
if(fdist >= FOG_DISTANCE)
break;
}
}
if(cox == bx2 && coy == by1)
pdx = 0, pdy = 1;
if(cox == bx2 && coy == by2)
pdx = -1, pdy = 0;
if(cox == bx1 && coy == by2)
pdx = 0, pdy = -1;
if(cox == bx1 && coy == by1 && pdy == -1)
break;
cox += pdx;
coy += pdy;
}
// store "last" bounding box
lbx1 = bx1;
lby1 = by1;
lbx2 = bx2;
lby2 = by2;
// expand box
bx1--;by1--;
bx2++;by2++;
// advance
dist += 1.0f;
}
}
void render_vxl_face_horiz(int blkx, int blky, int blkz,
float subx, float suby, float subz,
int face,
int gx, int gy, int gz)
{
int sx,sy;
int i;
float tracemul = cubemap_size/2;
float traceadd = tracemul;
// get cubemaps
uint32_t *ccolor = cubemap_color[face];
float *cdepth = cubemap_depth[face];
// clear cubemap
for(i = 0; i < cubemap_size*cubemap_size; i++)
{
ccolor[i] = 0x00000000;
cdepth[i] = FOG_DISTANCE;
}
// get X cube direction
int xgx = gz+gy;
int xgy = 0;
int xgz = -gx;
// get Y cube direction
int ygx = 0;
int ygy = gx+gz;
int ygz = gy;
// get cubemap offset
float cmoffsx = -(xgx*subx+xgy*suby+xgz*subz);
float cmoffsy = -(ygx*subx+ygy*suby+ygz*subz);
if(cmoffsy >= 0.0f)
cmoffsy = -cmoffsy;
if(cmoffsx >= 0.0f)
cmoffsx -= 1.0f;
//else
// blky--;
// get distance to wall
float dist = -(subx*gx+suby*gy+subz*gz);
if(dist < 0.0f)
dist = 1.0f+dist;
dist -= 1.0f;
int coz = blky;
// now loop and follow through
while(dist < FOG_DISTANCE)
{
// calculate frustum
int frustum = (int)(dist*cubemap_size);
// prep boundaries
int bx1 = 0;
int by1 = 0;
int bx2 = frustum*2;
int by2 = frustum*2;
// clamp wrt pixel counts
// TODO!
// relocate
bx1 -= frustum;
by1 -= frustum;
bx2 -= frustum;
by2 -= frustum;
// need to go towards 0, not -inf!
// (can be done as shifts, just looks nicer this way)
bx1 /= cubemap_size;
by1 /= cubemap_size;
bx2 /= cubemap_size;
by2 /= cubemap_size;
bx1-=2;by1--;
bx2+=2;by2++;
// go through loop
int cox,coy;
cox = 0;
coy = 0;
if(dist >= 0.001f)
{
float boxsize = tracemul/dist;
float nboxsize = tracemul/(dist+0.5f);
for(cox = bx1; cox <= bx2; cox++)
{
coz = 0;
uint8_t *pillar = rtmp_map->pillars[
((cox*gz+blkx)&(rtmp_map->xlen-1))
+(((-cox*gx+blkz)&(rtmp_map->zlen-1))*rtmp_map->xlen)]+4;
//printf("%4i %4i %4i - %i %i %i %i\n",cox,coy,coz,
// pillar[0],pillar[1],pillar[2],pillar[3]);
for(;;)
{
uint8_t *pcol = pillar+4;
// render top
if(pillar[2]-blky >= by1 && pillar[1]-blky <= by2)
for(coz = pillar[1]; coz <= pillar[2]; coz++)
{
if(coz-blky >= by1 && coz-blky <= by2)
{
float px1 = (cox+cmoffsx)*boxsize+traceadd;
float py1 = (coz+cmoffsy-blky)*boxsize+traceadd;
float px2 = px1+boxsize;
float py2 = py1+boxsize;
render_vxl_cube(ccolor, cdepth,
(int)px1, (int)py1, (int)px2, (int)py2,
*((uint32_t *)pcol), dist);
}
pcol+=4;
}
// advance where sensible
if(pillar[2]-blky > by2)
break;
if(pillar[0] == 0)
break;
pillar += pillar[0]*4;
// render bottom
int diff = (pillar-pcol)>>2;
for(coz = pillar[3]-diff; coz < pillar[3]; coz++)
{
if(coz-blky >= by1 && coz-blky <= by2)
{
float px1 = (cox+cmoffsx)*boxsize+traceadd;
float py1 = (coz+cmoffsy-blky)*boxsize+traceadd;
float px2 = px1+boxsize;
float py2 = py1+boxsize;
render_vxl_cube(ccolor, cdepth,
(int)px1, (int)py1, (int)px2, (int)py2,
*((uint32_t *)pcol), dist);
}
pcol+=4;
}
}
}
}
dist += 1.0f;
blkx += gx;
blkz += gz;
}
}
void render_vxl_redraw_old(camera_t *camera, map_t *map)
{
int x,y,z;
// stash stuff in globals to prevent spamming the stack too much
// (and in turn thrashing the cache)
rtmp_camera = camera;
rtmp_map = map;
// get block pos
int blkx = ((int)floor(camera->mpx)) & (map->xlen-1);
int blky = ((int)floor(camera->mpy));// & (map->ylen-1);
int blkz = ((int)floor(camera->mpz)) & (map->zlen-1);
// get block subpos
float subx = (camera->mpx - floor(camera->mpx));
float suby = (camera->mpy - floor(camera->mpy));
float subz = (camera->mpz - floor(camera->mpz));
// render each face
render_vxl_face_horiz(blkx, blky, blkz, subx, suby, subz, CM_NX, -1, 0, 0);
render_vxl_face_vert(blkx, blky, blkz, subx, suby, subz, CM_NY, 0, -1, 0);
render_vxl_face_horiz(blkx, blky, blkz, subx, suby, subz, CM_NZ, 0, 0, -1);
render_vxl_face_horiz(blkx, blky, blkz, subx, suby, subz, CM_PX, 1, 0, 0);
render_vxl_face_vert(blkx, blky, blkz, subx, suby, subz, CM_PY, 0, 1, 0);
render_vxl_face_horiz(blkx, blky, blkz, subx, suby, subz, CM_PZ, 0, 0, 1);
}
void render_vxl_face_raycast(int blkx, int blky, int blkz,
float subx, float suby, float subz,
int face,
int gx, int gy, int gz)
{
int i;
float tracemul = cubemap_size/2;
float traceadd = tracemul;
// get cubemaps
uint32_t *ccolor = cubemap_color[face];
float *cdepth = cubemap_depth[face];
// clear cubemap
for(i = 0; i < cubemap_size*cubemap_size; i++)
{
ccolor[i] = 0x00000000;
cdepth[i] = FOG_DISTANCE;
}
// get X cube direction
int xgx = gz+gy;
int xgy = 0;
int xgz = -gx;
// get Y cube direction
int ygx = 0;
int ygy = fabsf(gx+gz);
int ygz = gy;
// get base pos
float bx = blkx+subx;
float by = blky+suby;
float bz = blkz+subz;
if(xgx+xgy+xgz < 0)
{
bx += xgx;
by += xgy;
bz += xgz;
}
// now crawl through the block list
#ifdef DEBUG_INVERT_DRAW_DIR
rayblock_t *b = &rayc_block[rayc_block_len-1];
rayblock_t *b_end = &rayc_block[0];
for(; b >= b_end; b--)
#else
rayblock_t *b = &rayc_block[0];
rayblock_t *b_end = &rayc_block[rayc_block_len];
for(; b < b_end; b++)
#endif
{
// get block delta
float dx = b->x - bx;
float dy = b->y - by;
float dz = b->z - bz;
// get correct screen positions
float sx = dx*xgx+dy*xgy+dz*xgz;
float sy = dx*ygx+dy*ygy+dz*ygz;
float sz = dx* gx+dy* gy+dz* gz;
// check distance
if(sz < 0.001f || sz >= FOG_DISTANCE)
continue;
// frustum cull
if(fabsf(sx) > fabsf(sz+2.0f) || fabsf(sy) > fabsf(sz+2.0f))
continue;
// draw
float boxsize = tracemul/fabsf(sz);
float px1 = sx*boxsize+traceadd;
float py1 = sy*boxsize+traceadd;
float px2 = px1+boxsize;
float py2 = py1+boxsize;
uint32_t xcolor = render_fog_apply_new(b->color, sx*sx+sy*sy+sz*sz);
render_vxl_cube(ccolor, cdepth,
(int)px1, (int)py1, (int)px2, (int)py2,
xcolor, sz);
}
}
void render_vxl_redraw(camera_t *camera, map_t *map)
{
int i,x,y,z;
// stash stuff in globals to prevent spamming the stack too much
// (and in turn thrashing the cache)
rtmp_camera = camera;
rtmp_map = map;
// stash x/y/zlen
int xlen = map->xlen;
int ylen = map->ylen;
int zlen = map->zlen;
// get block pos
int blkx = ((int)floor(camera->mpx)) & (xlen-1);
int blky = ((int)floor(camera->mpy));// & (ylen-1);
int blkz = ((int)floor(camera->mpz)) & (zlen-1);
// get block subpos
float subx = (camera->mpx - floor(camera->mpx));
float suby = (camera->mpy - floor(camera->mpy));
float subz = (camera->mpz - floor(camera->mpz));
// get centre (base) pos
float bx = blkx + subx;
float by = blky + suby;
float bz = blkz + subz;
// check if we need to reallocate the mark table and block list
{
int markbase = xlen * zlen;
int blockbase = markbase * ylen;
if(rayc_mark_size != markbase)
{
rayc_mark_size = markbase;
rayc_mark = realloc(rayc_mark, rayc_mark_size*sizeof(int));
}
if(rayc_block_size != blockbase)
{
rayc_block_size = markbase;
rayc_block = realloc(rayc_block, rayc_block_size*sizeof(rayblock_t));
}
}
// clear the mark table
memset(rayc_mark, 0, rayc_mark_size*sizeof(int));
// prep the starting block
rayc_block_len = 0;
rayc_block_head = 0;
rayc_data_len = 1;
rayc_data_head = 0;
rayc_data[0].x = blkx;
rayc_data[0].y = blky;
rayc_data[0].z = blkz;
rayc_data[0].gx = 0;
rayc_data[0].gz = 0;
rayc_data[0].y1 = blky+suby;
rayc_data[0].y2 = blky+suby;
rayc_data[0].sx = subx;
rayc_data[0].sy = suby;
rayc_data[0].sz = subz;
rayc_mark[blkx + blkz*xlen] = 1;
// build your way up
while(rayc_data_head < rayc_data_len)
{
raydata_t *rd = &(rayc_data[rayc_data_head++]);
// get delta
float dx = rd->x - bx;
float dz = rd->z - bz;
// skip this if it's in the fog
if(dx*dx+dz*dz >= FOG_DISTANCE*FOG_DISTANCE)
continue;
// find where we are
int idx = (((int)(rd->z)) & (zlen-1))*xlen + (((int)rd->x) & (xlen-1));
uint8_t *p = map->pillars[idx]+4;
rayc_mark[idx] = -1;
int lastn = 0;
int topcount = 0;
int lasttop = 0;
while(p[0] != 0)
{
if(rd->y1 < p[1] && (lastn == 0 || rd->y1 >= lasttop))
break;
lastn = p[0];
lasttop = p[1];
topcount = p[0] - (p[2]-p[1]+1);
p += p[0]*4;
}
int spreadflag = !(
rd->y1 >= p[1] && (p[0] == 0 || rd->y1 <= p[p[0]*4+3])
&& rd->y2 >= p[1] && (p[0] == 0 || rd->y2 <= p[p[0]*4+3]));
// advance y1/y2
float y1 = rd->y1;
float y2 = rd->y2;
if(rayc_data_head == 1)
{
y1 = (lastn == 0 ? 0.0f : p[3]);
y2 = p[1];
} else {
float dist1 = sqrtf(dx*dx+dz*dz);
float dist2 = dist1 + 1.42f; // max dist this can travel
float travel = dist2/dist1;
y1 = by + (y1-by)*travel;
y2 = by + (y2-by)*travel;
}
int iy1 = floor(y1);
int iy2 = floor(y2);
float by1 = y1;
float by2 = y2;
// TODO: get the order right!
// add the top blocks (if they exist and we can see them)
if(p[3] >= iy1 && lastn != 0)
{
y2 = y1 = p[3]-1;
uint32_t *c = (uint32_t *)(&p[-4]);
for(i = p[3]-1; i >= p[3]-topcount && i >= iy1; i--)
{
rayblock_t *b = &rayc_block[rayc_block_len++];
b->x = rd->x;
b->z = rd->z;
b->y = i;
b->color = *(c--);
}
}
// sneak your way down
while(p[1] <= iy2)
{
y2 = p[1]+1;
//printf("%i %i %i %i [%i, %i]\n", p[0],p[1],p[2],p[3],iy1,iy2);
uint32_t *c = (uint32_t *)(&p[4]);
for(i = p[1]; i <= p[2] && i <= iy2; i++)
{
rayblock_t *b = &rayc_block[rayc_block_len++];
b->x = rd->x;
b->z = rd->z;
b->y = i;
b->color = *(c++);
}
if(p[0] == 0)
break;
lastn = p[0];
lasttop = p[1];
topcount = p[0] - (p[2]-p[1]+1);
p += 4*p[0];
c = (uint32_t *)(&p[-4]);
for(i = p[3]-1; i >= p[3]-topcount; i--)
{
if(i > iy2)
{
c--;
continue;
}
rayblock_t *b = &rayc_block[rayc_block_len++];
b->x = rd->x;