forked from spoutn1k/mcmap
-
Notifications
You must be signed in to change notification settings - Fork 8
/
main.cpp
1164 lines (1123 loc) · 45 KB
/
main.cpp
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
/***
* mcmap - create isometric maps of your minecraft alpha/beta world
* v2.1a, 09-2011 by Zahl
*
* Copyright 2011, Zahl. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are
* permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of
* conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice, this list
* of conditions and the following disclaimer in the documentation and/or other materials
* provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY ZAHL ''AS IS'' AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
* FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ZAHL OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
#include "helper.h"
#include "draw_png.h"
#include "colors.h"
#include "worldloader.h"
#include "globals.h"
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#ifdef _DEBUG
#include <cassert>
#endif
#ifndef _WIN32
#include <sys/stat.h>
#endif
#if defined(_WIN32) && !defined(__GNUC__)
# include <direct.h>
#endif
using std::string;
namespace
{
// For bright edge
bool gAtBottomLeft = true, gAtBottomRight = true;
}
// Macros to make code more readable
#define BLOCK_AT_MAPEDGE(x,z) (((z)+1 == g_MapsizeZ-CHUNKSIZE_Z && gAtBottomLeft) || ((x)+1 == g_MapsizeX-CHUNKSIZE_X && gAtBottomRight))
void optimizeTerrain2(int cropLeft, int cropRight);
void optimizeTerrain3();
void undergroundMode(bool explore);
bool prepareNextArea(int splitX, int splitZ, int &bitmapStartX, int &bitmapStartY);
void writeInfoFile(const char* file, int xo, int yo, int bitmapx, int bitmapy);
static const inline int floorChunkX(const int val);
static const inline int floorChunkZ(const int val);
void printHelp(char *binary);
int main(int argc, char **argv)
{
// ########## command line parsing ##########
if (argc < 2) {
printHelp(argv[0]);
return 1;
}
bool wholeworld = false;
char *filename = NULL, *outfile = NULL, *colorfile = NULL, *texturefile = NULL, *infoFile = NULL;
bool dumpColors = false, infoOnly = false, end = false;
char *biomepath = NULL;
uint64_t memlimit;
if (sizeof(size_t) < 8) {
memlimit = 1500 * uint64_t(1024 * 1024);
} else {
memlimit = 2000 * uint64_t(1024 * 1024);
}
bool memlimitSet = false;
// First, for the sake of backward compatibility, try to parse command line arguments the old way first
if (argc >= 7
&& isNumeric(argv[1]) && isNumeric(argv[2]) && isNumeric(argv[3]) && isNumeric(argv[4])) { // Specific area of world
g_FromChunkX = atoi(argv[1]);
g_FromChunkZ = atoi(argv[2]);
g_ToChunkX = atoi(argv[3]) + 1;
g_ToChunkZ = atoi(argv[4]) + 1;
g_MapsizeY = atoi(argv[5]);
filename = argv[6];
if (argc > 7) {
g_Nightmode = (atoi(argv[7]) == 1);
g_Underground = (atoi(argv[7]) == 2);
}
} else if (argc == 3 && isNumeric(argv[2])) { // Whole world - old way
filename = argv[1];
g_Nightmode = (atoi(argv[2]) == 1);
g_Underground = (atoi(argv[2]) == 2);
} else { // -- New command line parsing --
# define MOREARGS(x) (argpos + (x) < argc)
# define NEXTARG argv[++argpos]
# define POLLARG(x) argv[argpos + (x)]
int argpos = 0;
while (MOREARGS(1)) {
const char *option = NEXTARG;
if (strcmp(option, "-from") == 0) {
if (!MOREARGS(2) || !isNumeric(POLLARG(1)) || !isNumeric(POLLARG(2))) {
printf("Error: %s needs two integer arguments, ie: %s -10 5\n", option, option);
return 1;
}
g_FromChunkX = atoi(NEXTARG);
g_FromChunkZ = atoi(NEXTARG);
} else if (strcmp(option, "-to") == 0) {
if (!MOREARGS(2) || !isNumeric(POLLARG(1)) || !isNumeric(POLLARG(2))) {
printf("Error: %s needs two integer arguments, ie: %s -5 20\n", option, option);
return 1;
}
g_ToChunkX = atoi(NEXTARG) + 1;
g_ToChunkZ = atoi(NEXTARG) + 1;
} else if (strcmp(option, "-night") == 0) {
g_Nightmode = true;
} else if (strcmp(option, "-cave") == 0 || strcmp(option, "-caves") == 0 || strcmp(option, "-underground") == 0) {
g_Underground = true;
} else if (strcmp(option, "-blendcave") == 0 || strcmp(option, "-blendcaves") == 0) {
g_BlendUnderground = true;
} else if (strcmp(option, "-skylight") == 0) {
g_Skylight = true;
} else if (strcmp(option, "-nether") == 0 || strcmp(option, "-hell") == 0 || strcmp(option, "-slip") == 0) {
g_Hell = true;
} else if (strcmp(option, "-end") == 0) {
end = true;
} else if (strcmp(option, "-nowater") == 0) {
g_NoWater = true;
} else if (strcmp(option, "-serverhell") == 0) {
g_ServerHell = true;
} else if (strcmp(option, "-biomes") == 0) {
g_UseBiomes = true;
} else if (strcmp(option, "-biomecolors") == 0) {
if (!MOREARGS(1)) {
printf("Error: %s needs path to grasscolor.png and foliagecolor.png, ie: %s ./subdir\n", option, option);
return 1;
}
g_UseBiomes = true;
biomepath = NEXTARG;
} else if (strcmp(option, "-png") == 0) {
// void
} else if (strcmp(option, "-blendall") == 0) {
g_BlendAll = true;
} else if (strcmp(option, "-noise") == 0 || strcmp(option, "-dither") == 0) {
if (!MOREARGS(1) || !isNumeric(POLLARG(1))) {
printf("Error: %s needs an integer argument, ie: %s 10\n", option, option);
return 1;
}
g_Noise = atoi(NEXTARG);
} else if (strcmp(option, "-height") == 0 || strcmp(option, "-max") == 0) {
if (!MOREARGS(1) || !isNumeric(POLLARG(1))) {
printf("Error: %s needs an integer argument, ie: %s 100\n", option, option);
return 1;
}
g_MapsizeY = atoi(NEXTARG);
if (strcmp(option, "-max") == 0) g_MapsizeY++;
} else if (strcmp(option, "-min") == 0) {
if (!MOREARGS(1) || !isNumeric(POLLARG(1))) {
printf("Error: %s needs an integer argument, ie: %s 50\n", option, option);
return 1;
}
g_MapminY = atoi(NEXTARG);
} else if (strcmp(option, "-mem") == 0) {
if (!MOREARGS(1) || !isNumeric(POLLARG(1)) || atoi(POLLARG(1)) <= 0) {
printf("Error: %s needs a positive integer argument, ie: %s 1000\n", option, option);
return 1;
}
memlimitSet = true;
memlimit = size_t (atoi(NEXTARG)) * size_t (1024 * 1024);
} else if (strcmp(option, "-file") == 0) {
if (!MOREARGS(1)) {
printf("Error: %s needs one argument, ie: %s myworld.bmp\n", option, option);
return 1;
}
outfile = NEXTARG;
} else if (strcmp(option, "-colors") == 0) {
if (!MOREARGS(1)) {
printf("Error: %s needs one argument, ie: %s colors.txt\n", option, option);
return 1;
}
colorfile = NEXTARG;
} else if (strcmp(option, "-texture") == 0) {
if (!MOREARGS(1)) {
printf("Error: %s needs one argument, ie: %s terrain.png\n", option, option);
return 1;
}
texturefile = NEXTARG;
} else if (strcmp(option, "-info") == 0) {
if (!MOREARGS(1)) {
printf("Error: %s needs one argument, ie: %s data.json\n", option, option);
return 1;
}
infoFile = NEXTARG;
} else if (strcmp(option, "-infoonly") == 0) {
infoOnly = true;
} else if (strcmp(option, "-dumpcolors") == 0) {
dumpColors = true;
} else if (strcmp(option, "-north") == 0) {
g_Orientation = North;
} else if (strcmp(option, "-south") == 0) {
g_Orientation = South;
} else if (strcmp(option, "-east") == 0) {
g_Orientation = East;
} else if (strcmp(option, "-west") == 0) {
g_Orientation = West;
} else if (strcmp(option, "-3") == 0) {
g_OffsetY = 3;
} else if (strcmp(option, "-split") == 0) {
if (!MOREARGS(1)) {
printf("Error: %s needs a path argument, ie: %s tiles/\n", option, option);
return 1;
}
g_TilePath = NEXTARG;
} else if (strcmp(option, "-help") == 0 || strcmp(option, "-h") == 0 || strcmp(option, "-?") == 0) {
printHelp(argv[0]);
return 0;
} else if (strcmp(option, "-marker") == 0) {
if (g_MarkerCount >= MAX_MARKERS) {
printf("Too many markers, ignoring additional ones\n");
continue;
}
if (!MOREARGS(3) || !isNumeric(POLLARG(2)) || !isNumeric(POLLARG(3))) {
printf("Error: %s needs a char and two integer arguments, ie: %s r -15 240\n", option, option);
return 1;
}
Marker &marker = g_Markers[g_MarkerCount];
switch (*NEXTARG) {
case 'r':
marker.color = 253;
break;
case 'g':
marker.color = 244;
break;
case 'b':
marker.color = 242;
break;
default:
marker.color = 35;
}
int x = atoi(NEXTARG);
int z = atoi(NEXTARG);
marker.chunkX = floorChunkX(x);
marker.chunkZ = floorChunkZ(z);
marker.offsetX = x - (marker.chunkX * CHUNKSIZE_X);
marker.offsetZ = z - (marker.chunkZ * CHUNKSIZE_Z);
g_MarkerCount++;
} else if (strcmp(option, "-mystcraftage") == 0) {
if (!MOREARGS(1)) {
printf("Error: %s needs an integer age number argument", option);
return 1;
}
g_MystCraftAge = atoi(NEXTARG);
} else {
filename = (char *) option;
}
}
wholeworld = (g_FromChunkX == UNDEFINED || g_ToChunkX == UNDEFINED);
}
// ########## end of command line parsing ##########
if (g_Hell || g_ServerHell || end) g_UseBiomes = false;
printf("mcmap " VERSION " %dbit by Zahl\n", 8*sizeof(size_t));
if (sizeof(size_t) < 8 && memlimit > 1800 * uint64_t(1024 * 1024)) {
memlimit = 1800 * uint64_t(1024 * 1024);
}
// Load colormap from file
loadColors(); // Default base, in case some are missing in colors.txt (if used)
// Load files from colors.txt
if (colorfile != NULL && fileExists(colorfile)) {
if (!loadColorsFromFile(colorfile)) {
printf("Error loading colors from %s: Opening failed.\n", colorfile);
return 1;
}
} else if (colorfile != NULL) {
printf("Error loading colors from %s: File not found.\n", colorfile);
return 1;
}
// Extract colors from terrain.png
if (texturefile != NULL && fileExists(texturefile)) {
if (!extractColors(texturefile)) {
printf("Error extracting colors from %s: Opening failed (not a valid terrain png?).\n", texturefile);
return 1;
}
} else if (texturefile != NULL) {
printf("Error loading colors from %s: File not found.\n", texturefile);
return 1;
}
// If colors should be dumped to file, exit afterwards
if (dumpColors) {
if (!dumpColorsToFile("defaultcolors.txt")) {
printf("Could not dump colors to defaultcolors.txt, error opening file.\n");
return 1;
}
printf("Colors written to defaultcolors.txt\n");
return 0;
}
if (filename == NULL) {
printf("Error: No world given. Please add the path to your world to the command line.\n");
return 1;
}
if (!isAlphaWorld(filename)) {
printf("Error: Given path does not contain a Minecraft world.\n");
return 1;
}
if (g_Hell) {
char *tmp = new char[strlen(filename) + 20];
strcpy(tmp, filename);
strcat(tmp, "/DIM-1");
if (!dirExists(tmp)) {
printf("Error: This world does not have a hell world yet. Build a portal first!\n");
return 1;
}
filename = tmp;
} else if (end) {
char *tmp = new char[strlen(filename) + 20];
strcpy(tmp, filename);
strcat(tmp, "/DIM1");
if (!dirExists(tmp)) {
printf("Error: This world does not have an end-world yet. Find an ender portal first!\n");
return 1;
}
filename = tmp;
} else if (g_MystCraftAge) {
char *tmp = new char[strlen(filename) + 20];
sprintf(tmp, "%s/DIM_MYST%d", filename, g_MystCraftAge);
if (!dirExists(tmp)) {
printf("Error: This world does not have Age %d!\n", g_MystCraftAge);
return 1;
}
filename = tmp;
}
// Figure out whether this is the old save format or McRegion or Anvil
g_WorldFormat = getWorldFormat(filename);
if (g_WorldFormat < 2) {
if (g_MapsizeY > CHUNKSIZE_Y) {
g_MapsizeY = CHUNKSIZE_Y;
}
if (g_MapminY > CHUNKSIZE_Y) {
g_MapminY = CHUNKSIZE_Y;
}
}
if (wholeworld && !scanWorldDirectory(filename)) {
printf("Error accessing terrain at '%s'\n", filename);
return 1;
}
if (g_ToChunkX <= g_FromChunkX || g_ToChunkZ <= g_FromChunkZ) {
printf("Nothing to render: -from X Z has to be <= -to X Z\n");
return 1;
}
if (g_MapsizeY - g_MapminY < 1) {
printf("Nothing to render: -min Y has to be < -max/-height Y\n");
return 1;
}
g_SectionMin = g_MapminY >> SECTION_Y_SHIFT;
g_SectionMax = (g_MapsizeY - 1) >> SECTION_Y_SHIFT;
g_MapsizeY -= g_MapminY;
printf("MinY: %d ... MaxY: %d ... MinSecY: %d ... MaxSecY: %d\n", g_MapminY, g_MapsizeY, g_SectionMin, g_SectionMax);
// Whole area to be rendered, in chunks
// If -mem is omitted or high enough, this won't be needed
g_TotalFromChunkX = g_FromChunkX;
g_TotalFromChunkZ = g_FromChunkZ;
g_TotalToChunkX = g_ToChunkX;
g_TotalToChunkZ = g_ToChunkZ;
// Don't allow ridiculously small values for big maps
if (memlimit && memlimit < 200000000 && memlimit < size_t(g_MapsizeX * g_MapsizeZ * 150000)) {
printf("Need at least %d MiB of RAM to render a map of that size.\n", int(float(g_MapsizeX) * g_MapsizeZ * .15f + 1));
return 1;
}
// Load biomes
if (g_UseBiomes) {
char *bpath = new char[strlen(filename) + 30];
strcpy(bpath, filename);
strcat(bpath, "/biomes");
if (!dirExists(bpath)) {
printf("Error loading biome information. '%s' does not exist.\n", bpath);
return 1;
}
if (biomepath == NULL) {
biomepath = bpath;
}
if (!loadBiomeColors(biomepath)) return 1;
biomepath = bpath;
}
// Mem check
int bitmapX, bitmapY;
uint64_t bitmapBytes = calcImageSize(g_ToChunkX - g_FromChunkX, g_ToChunkZ - g_FromChunkZ, g_MapsizeY, bitmapX, bitmapY, false);
// Cropping
int cropLeft = 0, cropRight = 0, cropTop = 0, cropBottom = 0;
if (wholeworld) {
calcBitmapOverdraw(cropLeft, cropRight, cropTop, cropBottom);
bitmapX -= (cropLeft + cropRight);
bitmapY -= (cropTop + cropBottom);
bitmapBytes = uint64_t(bitmapX) * BYTESPERPIXEL * uint64_t(bitmapY);
}
if (infoFile != NULL) {
writeInfoFile(infoFile,
-cropLeft,
-cropTop,
bitmapX, bitmapY);
infoFile = NULL;
if (infoOnly) exit(0);
}
bool splitImage = false;
int numSplitsX = 0;
int numSplitsZ = 0;
if (memlimit && memlimit < bitmapBytes + calcTerrainSize(g_ToChunkX - g_FromChunkX, g_ToChunkZ - g_FromChunkZ)) {
// If we'd need more mem than allowed, we have to render groups of chunks...
if (memlimit < bitmapBytes + 220 * uint64_t(1024 * 1024)) {
// Warn about using incremental rendering if user didn't set limit manually
if (!memlimitSet && sizeof(size_t) > 4) {
printf(" ***** PLEASE NOTE *****\n"
"mcmap is using disk cached rendering as it has a default memory limit\n"
"of %d MiB. If you want to use more memory to render (=faster) use\n"
"the -mem switch followed by the amount of memory in MiB to use.\n"
"Start mcmap without any arguments to get more help.\n", int(memlimit / (1024 * 1024)));
} else {
printf("Choosing disk caching strategy...\n");
}
// ...or even use disk caching
splitImage = true;
}
// Split up map more and more, until the mem requirements are satisfied
for (numSplitsX = 1, numSplitsZ = 2;;) {
int subAreaX = ((g_TotalToChunkX - g_TotalFromChunkX) + (numSplitsX - 1)) / numSplitsX;
int subAreaZ = ((g_TotalToChunkZ - g_TotalFromChunkZ) + (numSplitsZ - 1)) / numSplitsZ;
int subBitmapX, subBitmapY;
if (splitImage && calcImageSize(subAreaX, subAreaZ, g_MapsizeY, subBitmapX, subBitmapY, true) + calcTerrainSize(subAreaX, subAreaZ) <= memlimit) {
break; // Found a suitable partitioning
} else if (!splitImage && bitmapBytes + calcTerrainSize(subAreaX, subAreaZ) <= memlimit) {
break; // Found a suitable partitioning
}
//
if (numSplitsZ > numSplitsX) {
++numSplitsX;
} else {
++numSplitsZ;
}
}
}
// Always same random seed, as this is only used for block noise, which should give the same result for the same input every time
srand(1337);
if (outfile == NULL) {
outfile = (char *) "output.png";
}
// open output file only if not doing the tiled output
FILE *fileHandle = NULL;
if (g_TilePath == NULL) {
fileHandle = fopen(outfile, (splitImage ? "w+b" : "wb"));
if (fileHandle == NULL) {
printf("Error opening '%s' for writing.\n", outfile);
return 1;
}
// This writes out the bitmap header and pre-allocates space if disk caching is used
if (!createImage(fileHandle, bitmapX, bitmapY, splitImage)) {
printf("Error allocating bitmap. Check if you have enough free disk space.\n");
return 1;
}
} else {
// This would mean tiled output
#ifdef _WIN32
mkdir(g_TilePath);
#else
mkdir(g_TilePath, 0755);
#endif
if (!dirExists(g_TilePath)) {
printf("Error: '%s' does not exist.\n", g_TilePath);
return 1;
}
createImageBuffer(bitmapX, bitmapY, splitImage);
}
// Precompute brightness adjustment factor
float *brightnessLookup = new float[g_MapsizeY];
for (int y = 0; y < g_MapsizeY; ++y) {
brightnessLookup[y] = ((100.0f / (1.0f + exp(- (1.3f * (float(y) * MIN(g_MapsizeY, 200) / g_MapsizeY) / 16.0f) + 6.0f))) - 91); // thx Donkey Kong
}
// Now here's the loop rendering all the required parts of the image.
// All the vars previously used to define bounds will be set on each loop,
// to create something like a virtual window inside the map.
for (;;) {
int bitmapStartX = 3, bitmapStartY = 5;
if (numSplitsX) { // virtual window is set here
// Set current chunk bounds according to number of splits. returns true if everything has been rendered already
if (prepareNextArea(numSplitsX, numSplitsZ, bitmapStartX, bitmapStartY)) {
break;
}
// if image is split up, prepare memory block for next part
if (splitImage) {
bitmapStartX += 2;
const int sizex = (g_ToChunkX - g_FromChunkX) * CHUNKSIZE_X * 2 + (g_ToChunkZ - g_FromChunkZ) * CHUNKSIZE_Z * 2;
const int sizey = (int)g_MapsizeY * g_OffsetY + (g_ToChunkX - g_FromChunkX) * CHUNKSIZE_X + (g_ToChunkZ - g_FromChunkZ) * CHUNKSIZE_Z + 3;
if (sizex <= 0 || sizey <= 0) continue; // Don't know if this is right, might also be that the size calulation is plain wrong
int res = loadImagePart(bitmapStartX - cropLeft, bitmapStartY - cropTop, sizex, sizey);
if (res == -1) {
printf("Error loading partial image to render to.\n");
return 1;
} else if (res == 1) continue;
}
}
// More chunks are needed at the sides to get light and edge detection right at the edges
// This makes code below a bit messy, as most of the time the surrounding chunks are ignored
// By starting loops at CHUNKSIZE_X instead of 0.
++g_ToChunkX;
++g_ToChunkZ;
--g_FromChunkX;
--g_FromChunkZ;
// For rotation, X and Z have to be swapped (East and West)
if (g_Orientation == North || g_Orientation == South) {
g_MapsizeZ = (g_ToChunkZ - g_FromChunkZ) * CHUNKSIZE_Z;
g_MapsizeX = (g_ToChunkX - g_FromChunkX) * CHUNKSIZE_X;
} else {
g_MapsizeX = (g_ToChunkZ - g_FromChunkZ) * CHUNKSIZE_Z;
g_MapsizeZ = (g_ToChunkX - g_FromChunkX) * CHUNKSIZE_X;
}
// Load world or part of world
if (numSplitsX == 0 && wholeworld && !loadEntireTerrain()) {
printf("Error loading terrain from '%s'\n", filename);
return 1;
} else if (numSplitsX != 0 || !wholeworld) {
int numberOfChunks;
if (!loadTerrain(filename, numberOfChunks)) {
printf("Error loading terrain from '%s'\n", filename);
return 1;
}
if (splitImage && numberOfChunks == 0) {
printf("Section is empty, skipping...\n");
discardImagePart();
continue;
}
}
if (g_WorldFormat == 2 && (g_Hell || g_ServerHell)) {
uncoverNether();
}
// Load biome data if requested
if (g_UseBiomes) {
loadBiomeMap(biomepath);
}
// If underground mode, remove blocks that don't seem to belong to caves
if (g_Underground) {
undergroundMode(false);
}
if (g_OffsetY == 2) {
optimizeTerrain2((numSplitsX == 0 ? cropLeft : 0), (numSplitsX == 0 ? cropRight : 0));
} else {
optimizeTerrain3();
}
// Finally, render terrain to file
printf("Drawing map...\n");
for (size_t x = CHUNKSIZE_X; x < g_MapsizeX - CHUNKSIZE_X; ++x) {
printProgress(x - CHUNKSIZE_X, g_MapsizeX);
for (size_t z = CHUNKSIZE_Z; z < g_MapsizeZ - CHUNKSIZE_Z; ++z) {
// Biome colors
if (g_BiomeMap != NULL) {
uint16_t &offset = BIOMEAT(x,z);
// This is getting a bit stupid here, there should be a better solution than a dozen copy ops
memcpy(colors[GRASS], g_Grasscolor + offset * g_GrasscolorDepth, 3);
memcpy(colors[LEAVES], g_Leafcolor + offset * g_FoliageDepth, 3);
memcpy(colors[TALL_GRASS], g_TallGrasscolor + offset * g_GrasscolorDepth, 3);
memcpy(colors[PUMPKIN_STEM], g_TallGrasscolor + offset * g_GrasscolorDepth, 3);
memcpy(colors[MELON_STEM], g_TallGrasscolor + offset * g_GrasscolorDepth, 3);
memcpy(colors[VINES], g_Grasscolor + offset * g_GrasscolorDepth, 3);
memcpy(colors[LILYPAD], g_Grasscolor + offset * g_GrasscolorDepth, 3);
// Leaves: This is just an approximation to get different leaf colors at all
colors[PINELEAVES][PRED] = clamp(int32_t(colors[LEAVES][PRED]) - 17);
colors[PINELEAVES][PGREEN] = clamp(int32_t(colors[LEAVES][PGREEN]) - 12);
colors[PINELEAVES][PBLUE] = colors[LEAVES][PBLUE];
int32_t avg = GETBRIGHTNESS(colors[LEAVES]);
colors[BIRCHLEAVES][PRED] = clamp(int32_t(colors[LEAVES][PRED]) + (avg - int32_t(colors[LEAVES][PRED])) / 2 + 15);
colors[BIRCHLEAVES][PGREEN] = clamp(int32_t(colors[LEAVES][PGREEN]) + (avg - int32_t(colors[LEAVES][PGREEN])) / 2 + 16);
colors[BIRCHLEAVES][PBLUE] = clamp(int32_t(colors[LEAVES][PBLUE]) + (avg - int32_t(colors[LEAVES][PBLUE])) / 2 + 15);
colors[JUNGLELEAVES][PRED] = clamp(int32_t(colors[LEAVES][PRED]));
colors[JUNGLELEAVES][PGREEN] = clamp(int32_t(colors[LEAVES][PGREEN]) + 18);
colors[JUNGLELEAVES][PBLUE] = colors[LEAVES][PBLUE];
}
//
const int bmpPosX = int((g_MapsizeZ - z - CHUNKSIZE_Z) * 2 + (x - CHUNKSIZE_X) * 2 + (splitImage ? -2 : bitmapStartX - cropLeft));
int bmpPosY = int(g_MapsizeY * g_OffsetY + z + x - CHUNKSIZE_Z - CHUNKSIZE_X + (splitImage ? 0 : bitmapStartY - cropTop)) + 2 - (HEIGHTAT(x, z) & 0xFF) * g_OffsetY;
const int max = (HEIGHTAT(x, z) & 0xFF00) >> 8;
for (int y = uint8_t(HEIGHTAT(x, z)); y < max; ++y) {
bmpPosY -= g_OffsetY;
uint8_t &c = BLOCKAT(x, y, z);
if (c == AIR) {
continue;
}
//float col = float(y) * .78f - 91;
float brightnessAdjustment = brightnessLookup[y];
if (g_BlendUnderground) {
brightnessAdjustment -= 168;
}
// we use light if...
if (g_Nightmode // nightmode is active, or
|| (g_Skylight // skylight is used and
&& (!BLOCK_AT_MAPEDGE(x, z)) // block is not edge of map (or if it is, has non-opaque block above)
)) {
int l = GETLIGHTAT(x, y, z); // find out how much light hits that block
if (l == 0 && y + 1 == g_MapsizeY) {
l = (g_Nightmode ? 3 : 15); // quickfix: assume maximum strength at highest level
} else {
const bool up = y + 1 < g_MapsizeY;
if (x + 1 < g_MapsizeX && (!up || BLOCKAT(x + 1, y + 1, z) == 0)) {
l = MAX(l, GETLIGHTAT(x + 1, y, z));
if (x + 2 < g_MapsizeX) l = MAX(l, GETLIGHTAT(x + 2, y, z) - 1);
}
if (z + 1 < g_MapsizeZ && (!up || BLOCKAT(x, y + 1, z + 1) == 0)) {
l = MAX(l, GETLIGHTAT(x, y, z + 1));
if (z + 2 < g_MapsizeZ) l = MAX(l, GETLIGHTAT(x, y, z + 2) - 1);
}
if (up) l = MAX(l, GETLIGHTAT(x, y + 1, z));
//if (y + 2 < g_MapsizeY) l = MAX(l, GETLIGHTAT(x, y + 2, z) - 1);
}
if (!g_Skylight) { // Night
brightnessAdjustment -= (100 - l * 8);
} else { // Day
brightnessAdjustment -= (210 - l * 14);
}
}
// Edge detection (this means where terrain goes 'down' and the side of the block is not visible)
uint8_t &b = BLOCKAT(x - 1, y - 1, z - 1);
if ((y && y + 1 < g_MapsizeY) // In bounds?
&& BLOCKAT(x, y + 1, z) == AIR // Only if block above is air
&& BLOCKAT(x - 1, y + 1, z - 1) == AIR // and block above and behind is air
&& (b == AIR || b == c) // block behind (from pov) this one is same type or air
&& (BLOCKAT(x - 1, y, z) == AIR || BLOCKAT(x, y, z - 1) == AIR)) { // block TL/TR from this one is air = edge
brightnessAdjustment += 13;
}
setPixel(bmpPosX, bmpPosY, c, brightnessAdjustment);
}
}
}
printProgress(10, 10);
// Bitmap creation complete
// unless using....
// Underground overlay mode
if (g_BlendUnderground && !g_Underground) {
// Load map data again, since block culling removed most of the blocks
if (numSplitsX == 0 && wholeworld && !loadEntireTerrain()) {
printf("Error loading terrain from '%s'\n", filename);
return 1;
} else if (numSplitsX != 0 || !wholeworld) {
int i;
if (!loadTerrain(filename, i)) {
printf("Error loading terrain from '%s'\n", filename);
return 1;
}
}
undergroundMode(true);
if (g_OffsetY == 2) {
optimizeTerrain2((numSplitsX == 0 ? cropLeft : 0), (numSplitsX == 0 ? cropRight : 0));
} else {
optimizeTerrain3();
}
printf("Creating cave overlay...\n");
for (size_t x = CHUNKSIZE_X; x < g_MapsizeX - CHUNKSIZE_X; ++x) {
printProgress(x - CHUNKSIZE_X, g_MapsizeX);
for (size_t z = CHUNKSIZE_Z; z < g_MapsizeZ - CHUNKSIZE_Z; ++z) {
const size_t bmpPosX = (g_MapsizeZ - z - CHUNKSIZE_Z) * 2 + (x - CHUNKSIZE_X) * 2 + (splitImage ? -2 : bitmapStartX) - cropLeft;
size_t bmpPosY = g_MapsizeY * g_OffsetY + z + x - CHUNKSIZE_Z - CHUNKSIZE_X + (splitImage ? 0 : bitmapStartY) - cropTop;
for (int y = 0; y < MIN(g_MapsizeY, 64); ++y) {
uint8_t &c = BLOCKAT(x, y, z);
if (c != AIR) { // If block is not air (colors[c][3] != 0)
blendPixel(bmpPosX, bmpPosY, c, float(y + 30) * .0048f);
}
bmpPosY -= g_OffsetY;
}
}
}
printProgress(10, 10);
} // End blend-underground
// If disk caching is used, save part to disk
if (splitImage && !saveImagePart()) {
printf("Error saving partially rendered image.\n");
return 1;
}
// No incremental rendering at all, so quit the loop
if (numSplitsX == 0) {
break;
}
}
// Drawing complete, now either just save the image or compose it if disk caching was used
// Saving
if (!splitImage) {
saveImage();
} else {
if (!composeFinalImage()) {
printf("Aborted.\n");
return 1;
}
}
if (fileHandle != NULL) fclose(fileHandle);
printf("Job complete.\n");
return 0;
}
#ifdef _DEBUG
static size_t gBlocksRemoved = 0;
#endif
void optimizeTerrain2(int cropLeft, int cropRight)
{
printf("Optimizing terrain...\n");
#ifdef _DEBUG
gBlocksRemoved = 0;
#endif
const int maxX = g_MapsizeX - CHUNKSIZE_X;
const int maxZ = g_MapsizeZ - CHUNKSIZE_Z;
const int modZ = maxZ * g_MapsizeY;
uint8_t * const blocked = new uint8_t[modZ];
int offsetZ = 0, offsetY = 0, offsetGlobal = 0;
memset(blocked, 0, modZ);
for (int x = maxX - 1; x >= CHUNKSIZE_X; --x) {
printProgress(maxX - (x + 1), maxX);
offsetZ = offsetGlobal;
for (int z = CHUNKSIZE_Z; z < maxZ; ++z) {
const uint8_t *block = &BLOCKAT(x, 0, z); // Get the lowest block at that point
int highest = 0, lowest = 0xFF; // remember lowest and highest block which are visible to limit the Y-for-loop later
for (int y = 0; y < g_MapsizeY; ++y) { // Go up
uint8_t ¤t = blocked[((y+offsetY) % g_MapsizeY) + (offsetZ % modZ)];
if (current) { // Block is hidden, remove
#ifdef _DEBUG
if (*block != AIR) {
++gBlocksRemoved;
}
#endif
} else { // block is not hidden by another block
if (*block != AIR && lowest == 0xFF) { // if it's not air, this is the lowest block to draw
lowest = y;
}
if (colors[*block][PALPHA] == 255) { // Block is not hidden, do not remove, but mark spot as blocked for next iteration
current = 1;
}
if (*block != AIR) highest = y; // if it's not air, it's the new highest block encountered so far
}
++block; // Go up
}
HEIGHTAT(x, z) = (((uint16_t)highest + 1) << 8) | (uint16_t)lowest; // cram them both into a 16bit int
blocked[(offsetY % g_MapsizeY) + (offsetZ % modZ)] = 0;
offsetZ += g_MapsizeY;
}
for (int y = 0; y < g_MapsizeY; ++y) {
blocked[y + (offsetGlobal % modZ)] = 0;
}
offsetGlobal += g_MapsizeY;
++offsetY;
}
delete[] blocked;
printProgress(10, 10);
#ifdef _DEBUG
printf("Removed %lu blocks\n", (unsigned long) gBlocksRemoved);
#endif
}
void optimizeTerrain3()
{
// Remove invisible blocks from map (covered by other blocks from isometric pov)
// Do so by "raytracing" every block from front to back..
printf("Optimizing terrain...\n");
#ifdef _DEBUG
gBlocksRemoved = 0;
#endif
printProgress(0, 10);
// Helper arrays to remember which block is blocked from being seen. This allows to traverse the array in a slightly more sequential way, which leads to better usage of the CPU cache
uint8_t *blocked = new uint8_t[g_MapsizeY*3];
const int max = (int)MIN(g_MapsizeX - CHUNKSIZE_X * 2, g_MapsizeZ - CHUNKSIZE_Z * 2);
const int maxX = int(g_MapsizeX - CHUNKSIZE_X - 1);
const int maxZ = int(g_MapsizeZ - CHUNKSIZE_Z - 1);
const size_t maxProgress = size_t(maxX + maxZ);
// The following needs to be done twice, once for the X-Y front plane, once for the Z-Y front plane
for (int x = CHUNKSIZE_X; x <= maxX; ++x) {
memset(blocked, 0, g_MapsizeY*3); // Nothing is blocked at first
int offset = 0; // The helper array had to be shifted after each run of the inner most loop. As this is expensive, just use an offset that increases instead
const int max2 = MIN(max, x - CHUNKSIZE_X + 1); // Block array will be traversed diagonally, determine how many blocks there are
for (int i = 0; i < max2; ++i) { // This traverses the block array diagonally, which would be upwards in the image
const int blockedOffset = g_MapsizeY * (i % 3);
uint8_t *block = &BLOCKAT(x - i, 0, maxZ - i); // Get the lowest block at that point
int highest = 0, lowest = 0xFF;
for (int j = 0; j < g_MapsizeY; ++j) { // Go up
if (blocked[blockedOffset + (j+offset) % g_MapsizeY]) { // Block is hidden, remove
#ifdef _DEBUG
if (*block != AIR) {
++gBlocksRemoved;
}
#endif
} else {
if (*block != AIR && lowest == 0xFF) {
lowest = j;
}
if (colors[*block][PALPHA] == 255) { // Block is not hidden, do not remove, but mark spot as blocked for next iteration
blocked[blockedOffset + (j+offset) % g_MapsizeY] = 1;
}
if (*block != AIR) highest = j;
}
++block; // Go up
}
HEIGHTAT(x - i, maxZ - i) = (((uint16_t)highest + 1) << 8) | (uint16_t)lowest;
blocked[blockedOffset + ((offset + 1) % g_MapsizeY)] = 0; // This will be the array index responsible for the top most block in the next itaration. Set it to 0 as it can't be hidden.
blocked[blockedOffset + (offset % g_MapsizeY)] = 0;
if (i % 3 == 2) {
offset += 2; // Increase offset, as block at height n in current row will hide block at n-1 in next row
}
}
printProgress(size_t(x), maxProgress);
}
for (int z = CHUNKSIZE_Z; z < maxZ; ++z) {
memset(blocked, 0, g_MapsizeY*3);
int offset = 0;
const int max2 = MIN(max, z - CHUNKSIZE_Z + 1);
for (int i = 0; i < max2; ++i) {
const int blockedOffset = g_MapsizeY * (i % 3);
uint8_t *block = &BLOCKAT(maxX - i, 0, z - i);
int highest = 0, lowest = 0xFF;
for (int j = 0; j < g_MapsizeY; ++j) {
if (blocked[blockedOffset + (j+offset) % g_MapsizeY]) {
#ifdef _DEBUG
if (*block != AIR) {
++gBlocksRemoved;
}
#endif
} else {
if (*block != AIR && lowest == 0xFF) {
lowest = j;
}
if (colors[*block][PALPHA] == 255) {
blocked[blockedOffset + (j+offset) % g_MapsizeY] = 1;
}
if (*block != AIR) highest = j;
}
++block;
}
HEIGHTAT(maxX - i, z - i) = (((uint16_t)highest + 1) << 8) | (uint16_t)lowest;
blocked[blockedOffset + ((offset + 1) % g_MapsizeY)] = 0;
blocked[blockedOffset + (offset % g_MapsizeY)] = 0;
if (i % 3 == 2) {
offset += 2;
}
}
printProgress(size_t(z + maxX), maxProgress);
}
delete[] blocked;
printProgress(10, 10);
#ifdef _DEBUG
printf("Removed %lu blocks\n", (unsigned long) gBlocksRemoved);
#endif
}
void undergroundMode(bool explore)
{
// This wipes out all blocks that are not caves/tunnels
//int cnt[256];
//memset(cnt, 0, sizeof(cnt));
printf("Exploring underground...\n");
if (explore) {
clearLightmap();
for (size_t x = CHUNKSIZE_X; x < g_MapsizeX - CHUNKSIZE_X; ++x) {
printProgress(x - CHUNKSIZE_X, g_MapsizeX);
for (size_t z = CHUNKSIZE_Z; z < g_MapsizeZ - CHUNKSIZE_Z; ++z) {
for (int y = 0; y < MIN(g_MapsizeY, 64) - 1; y++) {
if (BLOCKAT(x, y, z) == TORCH) {
// Torch
BLOCKAT(x, y, z) = AIR;
for (int ty = int(y) - 9; ty < int(y) + 9; ty += 2) { // The trick here is to only take into account
if (ty < 0) {
continue; // areas around torches.
}
if (ty >= int(g_MapsizeY) - 1) {
break;
}
for (int tz = int(z) - 18; tz < int(z) + 18; ++tz) {
if (tz < CHUNKSIZE_Z) {
continue;
}
if (tz >= int(g_MapsizeZ) - CHUNKSIZE_Z) {
break;
}
for (int tx = int(x) - 18; tx < int(x) + 18; ++tx) {
if (tx < CHUNKSIZE_X) {
continue;
}
if (tx >= int(g_MapsizeX) - CHUNKSIZE_X) {
break;
}
SETLIGHTNORTH(tx, ty, tz) = 0xFF;
}
}
}
// /
}
}
}
}
}
for (size_t x = 0; x < g_MapsizeX; ++x) {
printProgress(x + g_MapsizeX * (explore ? 1 : 0), g_MapsizeX * (explore ? 2 : 1));
for (size_t z = 0; z < g_MapsizeZ; ++z) {
size_t ground = 0;
size_t cave = 0;
for (int y = g_MapsizeY - 1; y >= 0; --y) {
uint8_t &c = BLOCKAT(x, y, z);
if (c != AIR && cave > 0) { // Found a cave, leave floor
if (c == GRASS || c == LEAVES || c == SNOW || GETLIGHTAT(x, y, z) == 0) {
c = AIR; // But never count snow or leaves
} //else cnt[*c]++;
if (c != WATER && c != STAT_WATER) {
--cave;
}
} else if (c != AIR) { // Block is not air, count up "ground"
c = AIR;
if (c != LOG && c != LEAVES && c != SNOW && c != WOOD && c != WATER && c != STAT_WATER) {
++ground;
}
} else if (ground < 3) { // Block is air, if there was not enough ground above, don't treat that as a cave
ground = 0;
} else { // Thats a cave, draw next two blocks below it
cave = 2;
}
}
}
}
printProgress(10, 10);
//for (int i = 0; i < 256; ++i) {
// if (cnt[i] == 0) continue;
// printf("Block %d: %d\n", i, cnt[i]);
//}
}
bool prepareNextArea(int splitX, int splitZ, int &bitmapStartX, int &bitmapStartY)
{
static int currentAreaX = -1;
static int currentAreaZ = 0;
// move on to next part and stop if we're done
++currentAreaX;
if (currentAreaX >= splitX) {
currentAreaX = 0;
++currentAreaZ;
}
if (currentAreaZ >= splitZ) {
return true;
}
// For bright map edges
if (g_Orientation == West || g_Orientation == East) {
gAtBottomRight = (currentAreaZ + 1 == splitZ);
gAtBottomLeft = (currentAreaX + 1 == splitX);
} else {
gAtBottomLeft = (currentAreaZ + 1 == splitZ);
gAtBottomRight = (currentAreaX + 1 == splitX);
}
// Calc size of area to be rendered (in chunks)
const int subAreaX = ((g_TotalToChunkX - g_TotalFromChunkX) + (splitX - 1)) / splitX;
const int subAreaZ = ((g_TotalToChunkZ - g_TotalFromChunkZ) + (splitZ - 1)) / splitZ;
// Adjust values for current frame. order depends on map orientation
g_FromChunkX = g_TotalFromChunkX + subAreaX * (g_Orientation == North || g_Orientation == West ? currentAreaX : splitX - (currentAreaX + 1));
g_FromChunkZ = g_TotalFromChunkZ + subAreaZ * (g_Orientation == North || g_Orientation == East ? currentAreaZ : splitZ - (currentAreaZ + 1));
g_ToChunkX = g_FromChunkX + subAreaX;
g_ToChunkZ = g_FromChunkZ + subAreaZ;
// Bounds checking
if (g_ToChunkX > g_TotalToChunkX) {
g_ToChunkX = g_TotalToChunkX;
}
if (g_ToChunkZ > g_TotalToChunkZ) {
g_ToChunkZ = g_TotalToChunkZ;
}
printf("Pass %d of %d...\n", int(currentAreaX + (currentAreaZ * splitX) + 1), int(splitX * splitZ));
// Calulate pixel offsets in bitmap. Forgot how this works right after writing it, really.
if (g_Orientation == North) {
bitmapStartX = (((g_TotalToChunkZ - g_TotalFromChunkZ) * CHUNKSIZE_Z) * 2 + 3) // Center of image..
- ((g_ToChunkZ - g_TotalFromChunkZ) * CHUNKSIZE_Z * 2) // increasing Z pos will move left in bitmap
+ ((g_FromChunkX - g_TotalFromChunkX) * CHUNKSIZE_X * 2); // increasing X pos will move right in bitmap