forked from revk/PuzzleBox
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpuzzlebox.c
1380 lines (1358 loc) · 57.5 KB
/
puzzlebox.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
// Puzzle box maker
// (c) 2018 Adrian Kennard www.me.uk @TheRealRevK
// This includes a distinctive "A" in the design at the final park point, otherwise there are no loops in the maze
// Please leave the "A" in the design as a distinctive feature
#include <stdio.h>
#include <string.h>
#include <popt.h>
#include <err.h>
#include <stdlib.h>
#include <ctype.h>
#include <math.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <time.h>
#include "apple-strdupa.h"
// Flags for maze array
#define FLAGL 0x01 // Left
#define FLAGR 0x02 // Right
#define FLAGU 0x04 // Up
#define FLAGD 0x08 // Down
#define FLAGA 0x0F // All directions
#define FLAGI 0x80 // Invalid
#define BIASL 2 // Direction bias for random maze choices
#define BIASR 1
#define BIASU 1
#define BIASD 4
#define SCALE 1000LL // Scales used for some aspects of output
#define SCALEI "0.001"
#define scaled(x) ((long long)round((x)*SCALE))
int
main (int argc, const char *argv[])
{
double basethickness = 1.6;
double basegap = 0.4;
double baseheight = 10;
double corediameter = 10;
double coreheight = 50;
double wallthickness = 1.2;
double mazethickness = 2;
double mazestep = 3;
double clearance = 0.4; // General X/Y clearance for parts
double nubrclearance = 0.1; // Extra radius clearance for nub, should be less than clearance, can be -ve
double nubzclearance = 0.2; // Extra Z clearance (per /4 maze step)
double parkthickness = 0.7;
double coregap = 0;
double outerround = 2;
double mazemargin = 1;
double textdepth = 0.5;
double logodepth = 0.6;
double gripdepth = 2;
double textsidescale = 1;
char *textinside = NULL;
char *textend = NULL;
char *textsides = NULL;
char *textfont = NULL;
char *textfontend = NULL;
int parts = 4;
int part = 0;
int inside = 0;
int flip = 0;
int outersides = 7;
int testmaze = 0;
int helix = 3;
int nubs = helix;
int logo = 0;
int textslow = 0;
int textoutset = 0;
int symmectriccut = 0;
int coresolid = 0;
int mime = (getenv ("HTTP_HOST") ? 1 : 0);
int webform = 0;
int parkvertical = 0;
int mazecomplexity = 5;
int mirrorinside = 0; // Clockwise lock on inside - may be unwise as more likely to come undone with outer.
int noa = 0;
int basewide = 0;
int f = open ("/dev/urandom", O_RDONLY);
if (f < 0)
err (1, "Open /dev/random");
char pathsep = 0;
char *path = getenv ("PATH_INFO");
if (path)
pathsep = '/';
else if ((path = getenv ("QUERY_STRING")))
pathsep = '&';
const struct poptOption optionsTable[] = {
{"parts", 'm', POPT_ARG_INT | POPT_ARGFLAG_SHOW_DEFAULT, &parts, 0, "Total parts", "N"},
{"part", 'n', POPT_ARG_INT, &part, 0, "Part to make", "N (0 for all)"},
{"inside", 'i', POPT_ARG_NONE, &inside, 0, "Maze on inside (hard)"},
{"flip", 'f', POPT_ARG_NONE, &flip, 0, "Alternating inside/outside maze"},
{"nubs", 'N', POPT_ARG_INT | POPT_ARGFLAG_SHOW_DEFAULT, &nubs, 0, "Nubs", "N"},
{"helix", 'H', POPT_ARG_INT | POPT_ARGFLAG_SHOW_DEFAULT, &helix, 0, "Helix", "N (0 for non helical)"},
{"base-height", 'b', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &baseheight, 0, "Base height", "mm"},
{"core-diameter", 'c', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &corediameter, 0, "Core diameter for content", "mm"},
{"core-height", 'h', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &coreheight, 0, "Core height for content", "mm"},
{"core-gap", 'C', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &coregap, 0, "Core gap to allow content to be removed", "mm"},
{"core-solid", 'q', POPT_ARG_NONE, &coresolid, 0, "Core solid (content is in part 2)"},
{"base-thickness", 'B', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &basethickness, 0, "Base thickness", "mm"},
{"base-gap", 'G', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &basegap, 0, "Base gap (Z clearance)", "mm"},
{"base-wide", 'W', POPT_ARG_NONE, &basewide, 0, "Inside base full width"},
{"part-thickness", 'w', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &wallthickness, 0, "Wall thickness", "mm"},
{"maze-thickness", 't', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &mazethickness, 0, "Maze thickness", "mm"},
{"maze-step", 'z', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &mazestep, 0, "Maze spacing", "mm"},
{"maze-margin", 'M', POPT_ARG_DOUBLE | (mazemargin ? POPT_ARGFLAG_SHOW_DEFAULT : 0), &mazemargin, 0, "Maze top margin", "mm"},
{"maze-complexity", 'X', POPT_ARG_INT | (mazecomplexity ? POPT_ARGFLAG_SHOW_DEFAULT : 0), &mazecomplexity, 0,
"Maze complexity", "-10 to 10"},
{"park-thickness", 'p', POPT_ARG_DOUBLE | (parkthickness ? POPT_ARGFLAG_SHOW_DEFAULT : 0), &parkthickness, 0,
"Thickness of park ridge to click closed", "mm"},
{"park-vertical", 'v', POPT_ARG_NONE, &parkvertical, 0, "Park vertically"},
{"clearance", 'g', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &clearance, 0, "General X/Y clearance", "mm"},
{"outer-sides", 's', POPT_ARG_INT | (outersides ? POPT_ARGFLAG_SHOW_DEFAULT : 0), &outersides, 0, "Number of outer sides",
"N (0=round)"},
{"outer-round", 'r', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &outerround, 0, "Outer rounding on ends", "mm"},
{"grip-depth", 'R', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &gripdepth, 0, "Grip depth", "mm"},
{"text-depth", 'D', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &textdepth, 0, "Text depth", "mm"},
{"text-end", 'E', POPT_ARG_STRING | (textend ? POPT_ARGFLAG_SHOW_DEFAULT : 0), &textend, 0, "Text (initials) on end",
"X{\\X...}"},
{"text-side", 'S', POPT_ARG_STRING | (textsides ? POPT_ARGFLAG_SHOW_DEFAULT : 0), &textsides, 0, "Text on sides",
"Text{\\Text...}"},
{"text-font", 'F', POPT_ARG_STRING | (textfont ? POPT_ARGFLAG_SHOW_DEFAULT : 0), &textfont, 0, "Text font (optional)",
"Font"},
{"text-font-end", 'e', POPT_ARG_STRING | (textfontend ? POPT_ARGFLAG_SHOW_DEFAULT : 0), &textfontend, 0,
"Text font for end (optional)", "Font"},
{"text-slow", 'd', POPT_ARG_NONE, &textslow, 0, "Text has diagonal edges (very slow)"},
{"text-side-scale", 'T', POPT_ARG_DOUBLE, &textsidescale, 0, "Scale side text (i.e. if too long)", "N"},
{"text-outset", 'O', POPT_ARG_NONE, &textoutset, 0, "Text on sides is outset not embossed"},
{"text-inside", 'I', POPT_ARG_STRING | (textinside ? POPT_ARGFLAG_SHOW_DEFAULT : 0), &textinside, 0,
"Text (initials) inside end", "X{\\X...}"},
{"logo-depth", 'L', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &logodepth, 0, "Logo (and inside text) cut depth", "mm"},
{"symmetric-cut", 'V', POPT_ARG_NONE, &symmectriccut, 0, "Symmetric maze cut"},
{"nub-r-clearance", 'y', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &nubrclearance, 0, "Extra clearance on radius for nub",
"mm"},
{"nub-z-clearance", 'Z', POPT_ARG_DOUBLE | POPT_ARGFLAG_SHOW_DEFAULT, &nubzclearance, 0, "Extra clearance on height of nub",
"mm"},
{"logo", 'A', POPT_ARG_NONE, &logo, 0, "Include A&A logo in last lid"},
{"test", 'Q', POPT_ARG_NONE, &testmaze, 0, "Test pattern instead of maze"},
{"mime", 0, POPT_ARG_NONE | (mime ? POPT_ARGFLAG_DOC_HIDDEN : 0), &mime, 0, "MIME Header"},
{"no-a", 0, POPT_ARG_NONE | (noa ? POPT_ARGFLAG_DOC_HIDDEN : 0), &noa, 0, "No A"},
{"web-form", 0, POPT_ARG_NONE, &webform, 0, "Web form"},
POPT_AUTOHELP {}
};
{ // POPT
poptContext optCon; // context for parsing command-line options
optCon = poptGetContext (NULL, argc, argv, optionsTable, 0);
//poptSetOtherOptionHelp (optCon, "");
int c;
if ((c = poptGetNextOpt (optCon)) < -1)
errx (1, "%s: %s\n", poptBadOption (optCon, POPT_BADOPTION_NOALIAS), poptStrerror (c));
if (poptPeekArg (optCon))
{
poptPrintUsage (optCon, stderr, 0);
return -1;
}
poptFreeContext (optCon);
}
char *error = NULL;
if (path)
{ // Settings from PATH_INFO
path = strdupa (path);
while (*path)
{
if (*path == pathsep)
{
*path++ = 0;
continue;
}
if (!isalpha (*path))
{
if (asprintf (&error, "Path error [%s]\n", path) < 0)
errx (1, "malloc");
break;
}
char arg = *path++;
int o;
for (o = 0; optionsTable[o].longName && optionsTable[o].shortName != arg; o++);
if (!optionsTable[o].shortName)
{
if (asprintf (&error, "Unknown arg [%c]", arg) < 0)
errx (1, "malloc");
break;
}
if (optionsTable[o].arg)
switch (optionsTable[o].argInfo & POPT_ARG_MASK)
{
case POPT_ARG_INT:
if (*path != '=')
{
if (asprintf (&error, "Missing value [%c=]", arg) < 0)
errx (1, "malloc");
break;
}
if (path[1])
*(int *) optionsTable[o].arg = strtod (path + 1, &path);
break;
case POPT_ARG_DOUBLE:
if (*path != '=')
{
if (asprintf (&error, "Missing value [%c=]", arg) < 0)
errx (1, "malloc");
break;
}
if (path[1])
*(double *) optionsTable[o].arg = strtod (path + 1, &path);
break;
case POPT_ARG_NONE:
*(int *) optionsTable[o].arg = 1;
if (*path == '=')
{ // Skip =on, etc.
path++;
while (*path && *path != pathsep)
path++;
}
break;
case POPT_ARG_STRING:
if (*path != '=')
{
if (asprintf (&error, "Missing value [%c=]", arg) < 0)
errx (1, "malloc");
break;
}
path++;
*(char **) optionsTable[o].arg = path;
char *o = path;
while (*path && *path != pathsep)
{
if (pathsep == '&' && *path == '+')
*o++ = ' ';
else if (pathsep == '&' && *path == '%' && isxdigit (path[1]) && isxdigit (path[2]))
{
*o++ =
(((isalpha (path[1]) ? 9 : 0) + (path[1] & 0xF)) << 4) + ((isalpha (path[2]) ? 9 : 0) + (path[2] & 0xF));
path += 2;
} else
*o++ = *path;
path++;
}
if (o < path)
*o = 0;
break;
}
}
}
if (webform)
{
int o;
for (o = 0; optionsTable[o].longName; o++)
if (optionsTable[o].shortName && optionsTable[o].arg)
{
printf ("<tr>");
printf ("<td><label for='%c'>%c%s</label></td>", optionsTable[o].shortName, optionsTable[o].shortName,
(optionsTable[o].argInfo & POPT_ARG_MASK) == POPT_ARG_NONE ? "" : "=");
printf ("<td>");
switch (optionsTable[o].argInfo & POPT_ARG_MASK)
{
case POPT_ARG_NONE: // Checkbox
printf ("<input type=checkbox id='%c' name='%c'/>", optionsTable[o].shortName, optionsTable[o].shortName);
break;
case POPT_ARG_INT: // Select
{
int l = 0,
h = 3,
v = *(int *) optionsTable[o].arg;
if (optionsTable[o].shortName == 'N')
l = 1; // Nubs
if (optionsTable[o].shortName == 'm')
l = 2; // Walls
if (optionsTable[o].shortName == 'n' || optionsTable[o].shortName == 'm')
h = 6; // Walls or part
if (optionsTable[o].shortName == 's')
h = 20; // Sides
if (optionsTable[o].shortName == 'X')
{ // Complexity
l = -10;
h = 10;
}
printf ("<select name='%c' id='%c'>", optionsTable[o].shortName, optionsTable[o].shortName);
for (; l <= h; l++)
printf ("<option value='%d'%s>%d</option>", l, l == v ? " selected" : "", l);
printf ("</select>");
}
break;
case POPT_ARG_DOUBLE: // Double
{
double v = *(double *) optionsTable[o].arg;
printf ("<input size='5' name='%c' id='%c'", optionsTable[o].shortName, optionsTable[o].shortName);
if (v)
{
char temp[50],
*p;
sprintf (temp, "%f", v);
for (p = temp + strlen (temp); p > temp && p[-1] == '0'; p--);
if (p > temp && p[-1] == '.')
p--;
*p = 0;
printf (" value='%s'", temp);
}
printf ("/>");
}
break;
case POPT_ARG_STRING: // String
{
char *v = *(char **) optionsTable[o].arg;
printf ("<input name='%c' id='%c'", optionsTable[o].shortName, optionsTable[o].shortName);
if (optionsTable[o].shortName == 'E')
printf (" size='2'"); // Initials
if (v)
printf (" value='%s'", v);
printf ("/>");
}
break;
}
if (optionsTable[o].argDescrip)
printf ("%s", optionsTable[o].argDescrip);
printf ("</td>");
printf ("<td><label for='%c'>%s</label></td>", optionsTable[o].shortName, optionsTable[o].descrip);
printf ("</tr>\n");
}
return 0;
}
// Sanity checks and adjustments
char *normalise (char *t)
{ // Simple text normalise
if (!t || !*t)
return NULL;
char *text = t;
while (*t)
{
if (*t == '"')
*t == '\'';
t++;
}
return text;
}
textend = normalise (textend);
textsides = normalise (textsides);
textinside = normalise (textinside);
if (!outersides)
textsides = NULL;
if (textfont && !*textfont)
textfont = NULL;
if (textfont && !textfontend)
textfontend = textfont;
if (textend && !*textend)
textend = NULL;
if (textinside && !*textinside)
textinside = NULL;
if (textsides && !*textsides)
{
textsidescale = 0;
textsides = NULL;
}
if (helix && nubs > 1 && nubs < helix)
{
if (!(helix % 2) && nubs <= helix / 2)
nubs = helix / 2;
else
nubs = helix;
}
if (helix && nubs > helix)
nubs = helix;
if (gripdepth > (baseheight - outerround) / 6)
gripdepth = (baseheight - outerround) / 6;
if (gripdepth > mazethickness)
gripdepth = mazethickness;
if (!logo && !textinside)
logodepth = 0;
if (!textsides && !textend && !textinside)
textdepth = 0;
if (coresolid && coregap < mazestep * 2)
coregap = mazestep * 2;
int markpos0 = (outersides && outersides / nubs * nubs != outersides); // Mark on position zero for alignment
double nubskew = (symmectriccut ? 0 : mazestep / 8); // Skew the shape of the cut
// MIME header
if (mime)
{
printf ("Content-Type: application/scad\r\nContent-Disposition: Attachment; filename=puzzlebox");
int o;
for (o = 0; optionsTable[o].longName; o++)
if (optionsTable[o].shortName && optionsTable[o].arg)
switch (optionsTable[o].argInfo & POPT_ARG_MASK)
{
case POPT_ARG_NONE:
if (!*(int *) optionsTable[o].arg)
break;
printf ("-%c", optionsTable[o].shortName);
break;
case POPT_ARG_INT:
if (!*(int *) optionsTable[o].arg)
break;
printf ("-%d%c", *(int *) optionsTable[o].arg, optionsTable[o].shortName);
break;
case POPT_ARG_DOUBLE:
if (!*(double *) optionsTable[o].arg)
break;
char temp[50],
*p;
sprintf (temp, "%f", *(double *) optionsTable[o].arg);
p = temp + strlen (temp) - 1;
while (*p == '0')
*p-- = 0;
p = strchr (temp, '.');
if (*p)
*p++ = 0;
printf ("-%s%c%s", temp, optionsTable[o].shortName, p);
break;
case POPT_ARG_STRING:
if (!*(char **) optionsTable[o].arg)
break;
{
char *p = strdupa (*(char * *) optionsTable[o].arg),
*q;
for (q = p; *q; q++)
if (*q <= ' ' || *q == '/' || *q == '\\' || *q == '"' || *q == '\'' || *q == ':' || *q == ';')
*q = '_';
printf ("-%c%s", optionsTable[o].shortName, p);
}
break;
}
printf (".scad\r\n\r\n"); // Used from apache
}
printf ("// Puzzlebox by RevK, @TheRealRevK www.me.uk\n");
printf ("// Thingiverse examples and instructions https://www.thingiverse.com/thing:2410748\n");
printf ("// GitHub source https://github.com/revk/PuzzleBox\n");
printf ("// Get new random custom maze gift boxes from https://www.me.uk/puzzlebox\n");
{ // Document args
time_t now = time (0);
struct tm t;
gmtime_r (&now, &t);
printf ("// Created %04d-%02d-%02dT%02d:%02d:%02dZ %s\n", t.tm_year + 1900, t.tm_mon + 1, t.tm_mday, t.tm_hour, t.tm_min,
t.tm_sec, getenv ("REMOTE_ADDR") ? : "");
int o;
for (o = 0; optionsTable[o].longName; o++)
if (optionsTable[o].shortName && optionsTable[o].arg)
switch (optionsTable[o].argInfo & POPT_ARG_MASK)
{
case POPT_ARG_NONE:
if (*(int *) optionsTable[o].arg)
printf ("// %s: %c\n", optionsTable[o].descrip, optionsTable[o].shortName);
break;
case POPT_ARG_INT:
{
int v = *(int *) optionsTable[o].arg;
if (v)
printf ("// %s: %c=%d\n", optionsTable[o].descrip, optionsTable[o].shortName, v);
}
break;
case POPT_ARG_DOUBLE:
{
double v = *(double *) optionsTable[o].arg;
if (v)
{
char temp[50],
*p;
sprintf (temp, "%f", v);
for (p = temp + strlen (temp); p > temp && p[-1] == '0'; p--);
if (p > temp && p[-1] == '.')
p--;
*p = 0;
printf ("// %s: %c=%s\n", optionsTable[o].descrip, optionsTable[o].shortName, temp);
}
}
break;
case POPT_ARG_STRING:
{
char *v = *(char * *) optionsTable[o].arg;
if (v && *v)
printf ("// %s: %c=%s\n", optionsTable[o].descrip, optionsTable[o].shortName, v);
}
break;
}
}
if (error)
{ // Problem
printf ("// ** %s **\n", error);
return 1;
}
// Other adjustments
basethickness += logodepth;
{ // Modules
if (textslow)
printf
("module cuttext(){translate([0,0,-%d])minkowski(){rotate([0,0,22.5])cylinder(h=%lld,d1=%lld,d2=0,$fn=8);linear_extrude(height=%d,convexity=10)mirror([1,0,0])children();}}\n",
SCALE, scaled (textdepth), scaled (textdepth), SCALE);
else
printf ("module cuttext(){linear_extrude(height=%lld,convexity=10,center=true)mirror([1,0,0])children();}\n",
scaled (textdepth));
// You can use the A&A logo on your maze print providing it is tasteful and not in any way derogatory to A&A or any staff/officers.
if (logo)
printf
("module aa(w=100,white=0,$fn=100){scale(w/100){if(!white)difference(){circle(d=100.5);circle(d=99.5);}difference(){if(white)circle(d=100);difference(){circle(d=92);for(m=[0,1])mirror([m,0,0]){difference(){translate([24,0,0])circle(r=22.5);translate([24,0,0])circle(r=15);}polygon([[1.5,22],[9,22],[9,-18.5],[1.5,-22]]);}}}}} // A&A Logo is copyright (c) 2013 and trademark Andrews & Arnold Ltd\n");
}
void cuttext (double s, char *t, char *f, int outset)
{
if (outset)
printf ("mirror([0,0,1])");
printf ("cuttext()");
printf ("scale(%lld)", scaled (1));
printf ("text(\"%s\"", t);
printf (",halign=\"center\"");
printf (",valign=\"center\"");
printf (",size=%lf", s);
if (*t & 0x80)
printf (",font=\"Noto Emoji\""); // Assume emoji - not clean - TODO needs fontconfig stuff really
else if (f)
printf (",font=\"%s\"", f);
printf (");\n");
}
// The base
printf ("module outer(h,r){e=%lld;minkowski(){cylinder(r1=0,r2=e,h=e,$fn=24);cylinder(h=h-e,r=r,$fn=%d);}}\n",
scaled (outerround), outersides ? : 100);
// Start
double x = 0,
y = 0;
int sq = sqrt (parts) + 0.5,
n = sq * sq - parts;
int box (int part)
{ // Make the box - part 1 in inside
int N,
X,
Y,
Z,
S;
double entrya = 0; // Entry angle
int mazeinside = inside; // This part has maze inside
int mazeoutside = !inside; // This part has maze outside
int nextinside = inside; // Next part has maze inside
int nextoutside = !inside; // Next part has maze outside
if (flip)
{
if (part & 1)
{
mazeinside = 1 - mazeinside;
nextoutside = 1 - nextoutside;
} else
{
mazeoutside = 1 - mazeoutside;
nextinside = 1 - nextinside;
}
}
if (part == 1)
mazeinside = 0;
if (part == parts)
mazeoutside = 0;
if (part + 1 >= parts)
nextoutside = 0;
if (part == parts)
nextinside = 0;
// Dimensions
// r0 is inside of part+maze
// r1 is outside of part+maze
// r2 is outside of base before "sides" adjust
// r3 is outside of base with "sides" adjust
double r1 = corediameter / 2 + wallthickness + (part - 1) * (wallthickness + mazethickness + clearance); // Outer
if (coresolid)
r1 -= wallthickness + mazethickness + clearance - (inside ? mazethickness : 0); // Adjust to make part 2 the core diameter
int W = ((int) (r1 * 2 * M_PI / mazestep)) / nubs * nubs; // Default value
double r0 = r1 - wallthickness; // Inner
if (mazeinside && part > 1)
r0 -= mazethickness; // Maze on inside
if (mazeoutside && part < parts)
r1 += mazethickness; // Maze on outside
double r2 = r1; // Base outer
if (part < parts)
r2 += clearance;
if (part + 1 >= parts && textsides && !textoutset)
r2 += textdepth;
if (nextinside)
r2 += mazethickness;
if (nextoutside || part + 1 == parts)
r2 += wallthickness;
if (basewide && part + 1 < parts)
r2 += nextoutside ? mazethickness : wallthickness;
double r3 = r2;
if (outersides && part + 1 >= parts)
r3 /= cos ((double) M_PI / outersides); // Bigger because of number of sides
printf ("// Part %d (%.2fmm to %.2fmm and %.2fmm/%.2fmm base)\n", part, r0, r1, r2, r3);
double height = (coresolid ? coregap + baseheight : 0) + coreheight + basethickness + (basethickness + basegap) * (part - 1);
if (part == 1)
height -= (coresolid ? coreheight : coregap);
if (part > 1)
height -= baseheight; // base from previous unit is added to this
// Output
void makemaze (double r, int inside)
{ // Make the maze
W = ((int) ((r + (inside ? mazethickness : -mazethickness)) * 2 * M_PI / mazestep)) / nubs * nubs; // Update W for actual maze
double base = (inside ? basethickness : baseheight);
if (inside && part > 2)
base += baseheight; // Nubs don't go all the way to the end
if (inside && part == 2)
base += (coresolid ? coreheight : coregap); // First one is short...
if (inside)
base += basegap;
double h = height - base - mazemargin - (parkvertical ? mazestep / 4 : 0) - mazestep / 8;
int H = (int) (h / mazestep);
printf ("// Maze %s %d/%d\n", inside ? "inside" : "outside", W, H);
double y0 = base + mazestep / 2 - mazestep * (helix + 1) + mazestep / 8;
H += 2 + helix; // Allow one above, one below and helix below
if (W < 3 || H < 1)
errx (1, "Too small");
double a = 0,
dy = 0;
if (helix)
{
a = atan (mazestep * helix / r / 2 / M_PI) * 180 / M_PI;
dy = mazestep * helix / W;
}
unsigned char maze[W][H];
memset (maze, 0, sizeof (unsigned char) * W * H);
int test (int x, int y)
{ // Test if in use...
while (x < 0)
{
x += W;
y -= helix;
}
while (x >= W)
{
x -= W;
y += helix;
}
int n = nubs;
unsigned char v = 0;
while (n--)
{
if (y < 0 || y >= H)
v |= FLAGI;
else
v |= maze[x][y];
if (!n)
break;
x += W / nubs;
while (x >= W)
{
x -= W;
y += helix;
}
if (helix == nubs)
y--;
}
return v;
}
{ // Maze
double margin = mazemargin;
// Make maze
// Clear too high/low
for (Y = 0; Y < H; Y++)
for (X = 0; X < W; X++)
if (mazestep * Y + y0 + dy * X < base + mazestep / 2 + mazestep / 8
|| mazestep * Y + y0 + dy * X > height - mazestep / 2 - margin - mazestep / 8)
maze[X][Y] |= FLAGI; // To high or low
// Final park point
if (parkvertical)
{
for (N = 0; N < helix + 2; N++) // Down to final
{
maze[0][N] |= FLAGU + FLAGD;
maze[X = 0][Y = N + 1] |= FLAGD;
}
if (!inside && !noa && W / nubs > 2 && H > helix + 4)
{ // An "A" at finish
maze[X][Y] |= FLAGD | FLAGU | FLAGR;
maze[X][Y + 1] |= FLAGD | FLAGR;
maze[X + 1][Y] |= FLAGD | FLAGU | FLAGL;
maze[X + 1][Y + 1] |= FLAGD | FLAGL;
maze[X + 1][Y - 1] |= FLAGU;
X++;
Y--;
}
} else // Left to final
{
maze[0][helix + 1] |= FLAGR;
maze[X = 1][Y = helix + 1] |= FLAGL;
if (!inside && !noa && W / nubs > 3 && H > helix + 3)
{ // An "A" at finish
maze[X][Y] |= FLAGL | FLAGR | FLAGU;
maze[X + 1][Y] |= FLAGL | FLAGU;
maze[X + 1][Y + 1] |= FLAGL | FLAGD;
maze[X][Y + 1] |= FLAGL | FLAGR | FLAGD;
maze[X - 1][Y + 1] |= FLAGR;
X--;
Y++;
}
}
// Make maze
int maxx = 0;
if (testmaze)
{ // Simple test pattern
for (Y = 0; Y < H; Y++)
for (X = 0; X < W; X++)
if (!(test (X, Y) & FLAGI) && !(test (X + 1, Y) & FLAGI))
{
maze[X][Y] |= FLAGR;
int x = X + 1,
y = Y;
if (x >= W)
{
x -= W;
y += helix;
}
maze[x][y] |= FLAGL;
}
if (!flip || inside)
while (maxx + 1 < W && !(test (maxx + 1, H - 2) & FLAGI))
maxx++;
} else
{ // Actual maze
int max = 0;
typedef struct pos_s pos_t;
struct pos_s
{
pos_t *next;
int x,
y,
n;
};
pos_t *pos = malloc (sizeof (*pos)),
*last = NULL;
pos->x = X;
pos->y = Y;
pos->n = 0;
pos->next = NULL;
last = pos;
while (pos)
{
pos_t *p = pos;
pos = p->next;
p->next = NULL;
if (!pos)
last = NULL;
// Where we are
X = p->x;
Y = p->y;
int v,
n = 0;
// Which way can we go
// Some bias for direction
if (!test (X + 1, Y))
n += BIASR; // Right
if (!test (X - 1, Y))
n += BIASL; // Left
if (!test (X, Y - 1))
n += BIASD; // Down
if (!test (X, Y + 1))
n += BIASU; // Up
if (!n)
{ // No way forward
free (p);
continue;
}
// Pick one of the ways randomly
if (read (f, &v, sizeof (v)) != sizeof (v))
err (1, "Read /dev/random");
v %= n;
// Move forward
if (!test (X + 1, Y) && (v -= BIASR) < 0)
{ // Right
maze[X][Y] |= FLAGR;
X++;
if (X >= W)
{
X -= W;
Y += helix;
}
maze[X][Y] |= FLAGL;
} else if (!test (X - 1, Y) && (v -= BIASL) < 0)
{ // Left
maze[X][Y] |= FLAGL;
X--;
if (X < 0)
{
X += W;
Y -= helix;
}
maze[X][Y] |= FLAGR;
} else if (!test (X, Y - 1) && (v -= BIASD) < 0)
{ // Down
maze[X][Y] |= FLAGD;
Y--;
maze[X][Y] |= FLAGU;
} else if (!test (X, Y + 1) && (v -= BIASU) < 0)
{ // Up
maze[X][Y] |= FLAGU;
Y++;
maze[X][Y] |= FLAGD;
} else
errx (1, "WTF"); // We should have picked a way we can go
// Entry
if (p->n > max && (test (X, Y + 1) & FLAGI) //
&& (!flip || inside || !(X % (W / nubs))))
{ // Longest path that reaches top
max = p->n;
maxx = X;
}
// Next point to consider
pos_t *next = malloc (sizeof (*next));
next->x = X;
next->y = Y;
next->n = p->n + 1;
next->next = NULL;
// How to add points to queue... start or end
if (read (f, &v, sizeof (v)) != sizeof (v))
err (1, "Read /dev/random");
v %= 10;
if (v < (mazecomplexity < 0 ? -mazecomplexity : mazecomplexity))
{ // add next point at start - makes for longer path
if (!pos)
last = next;
next->next = pos;
pos = next;
} else
{ // add next point at end - makes for multiple paths, which can mean very simple solution
if (last)
last->next = next;
else
pos = next;
last = next;
}
if (mazecomplexity <= 0 && v < -mazecomplexity)
{ // current point to start
if (!pos)
last = p;
p->next = pos;
pos = p;
} else
{
if (last)
last->next = p;
else
pos = p;
last = p;
}
}
printf ("// Path length %d\n", max);
}
entrya = (double) 360 *maxx / W;
// Entry point for maze
for (X = maxx % (W / nubs); X < W; X += W / nubs)
{
Y = H - 1;
while (Y && (maze[X][Y] & FLAGI))
maze[X][Y--] |= FLAGU + FLAGD;
maze[X][Y] += FLAGU;
}
int MAXY = height / (mazestep / 4) + 10;
struct
{ // Data for each slive
// Pre calculated x/y for left side 0=back, 1=recess, 2=front - used to create points
double x[3],
y[3];
// The last points as we work up slice (-ve for recess, 0 for not set yet)
int l,
r;
// Points from bottom up on this slice in order - used to ensure manifold buy using points that would be skipped
int n; // Points added to p
int p[MAXY];
} s[W * 4];
memset (&s, 0, sizeof (*s) * W * 4);
int p[W][H]; // The point start for each usable maze location (0 for not set) - 16 points
memset (*p, 0, sizeof (int) * W * H);
// Work out pre-sets
for (S = 0; S < W * 4; S++)
{
double a = M_PI * 2 * (S - 1.5) / W / 4;
if (!inside)
a = M_PI * 2 - a;
double sa = sin (a),
ca = cos (a);
if (inside)
{
s[S].x[0] = (r + mazethickness + (part < parts ? wallthickness : clearance + 0.01)) * sa;
s[S].y[0] = (r + mazethickness + (part < parts ? wallthickness : clearance + 0.01)) * ca;
s[S].x[1] = (r + mazethickness) * sa;
s[S].y[1] = (r + mazethickness) * ca;
s[S].x[2] = r * sa;
s[S].y[2] = r * ca;
} else
{
s[S].x[0] = (r - mazethickness - wallthickness) * sa;
s[S].y[0] = (r - mazethickness - wallthickness) * ca;
s[S].x[1] = (r - mazethickness) * sa;
s[S].y[1] = (r - mazethickness) * ca;
s[S].x[2] = r * sa;
s[S].y[2] = r * ca;
}
}
if (inside && mirrorinside)
printf ("mirror([1,0,0])");
printf ("polyhedron(");
// Make points
printf ("points=[");
int P = 0;
void addpoint (int S, double x, double y, double z)
{
printf ("[%lld,%lld,%lld],", scaled (x), scaled (y), scaled (z));
if (s[S].n >= MAXY)
errx (1, "WTF points %d", S);
s[S].p[s[S].n++] = P++;
}
void addpointr (int S, double x, double y, double z)
{
printf ("[%lld,%lld,%lld],", scaled (x), scaled (y), scaled (z));
if (s[S].n >= MAXY)
errx (1, "WTF points %d", S);
s[S].p[s[S].n++] = -(P++);
}
int bottom = P;
// Base points
for (S = 0; S < W * 4; S++)
addpoint (S, s[S].x[0], s[S].y[0], basethickness - clearance);
for (S = 0; S < W * 4; S++)
addpointr (S, s[S].x[1], s[S].y[1], basethickness - clearance);
for (S = 0; S < W * 4; S++)
addpoint (S, s[S].x[2], s[S].y[2], basethickness - clearance);
{ // Points for each maze location
double dy = mazestep * helix / W / 4; // Step per S
double my = mazestep / 8; // Vertical steps
double y = y0 - dy * 1.5; // Y vertical centre for S=0
for (Y = 0; Y < H; Y++)
for (X = 0; X < W; X++)
{
unsigned char v = test (X, Y);
if (!(v & FLAGA) || (v & FLAGI))
continue;
p[X][Y] = P;
for (S = X * 4; S < X * 4 + 4; S++)
addpoint (S, s[S].x[2], s[S].y[2], y + Y * mazestep + dy * S - my * 3);
for (S = X * 4; S < X * 4 + 4; S++)
addpointr (S, s[S].x[1], s[S].y[1], y + Y * mazestep + dy * S - my - nubskew);
for (S = X * 4; S < X * 4 + 4; S++)
addpointr (S, s[S].x[1], s[S].y[1], y + Y * mazestep + dy * S + my - nubskew);
for (S = X * 4; S < X * 4 + 4; S++)
addpoint (S, s[S].x[2], s[S].y[2], y + Y * mazestep + dy * S + my * 3);
}
}
int top = P;
for (S = 0; S < W * 4; S++)
addpoint (S, s[S].x[2], s[S].y[2], height - (basewide && !inside && part > 1 ? 0 : margin)); // lower
for (S = 0; S < W * 4; S++)
addpoint (S, s[S].x[1], s[S].y[1], height);
for (S = 0; S < W * 4; S++)
addpoint (S, s[S].x[0], s[S].y[0], height);
for (S = 0; S < W * 4; S++)
{ // Wrap back to start
if (s[S].n >= MAXY)
errx (1, "WTF points");
s[S].p[s[S].n++] = S;
}
printf ("]");
// Make faces
void slice (int S, int l, int r)
{ // Advance slice S to new L and R (-ve for recess)
inline int abs (int x)
{
if (x < 0)
return -x;
return x;
}
inline int sgn (int x)
{
if (x < 0)
return -1;
if (x > 0)
return 1;
return 0;
}
if (S >= W * 4)
errx (1, "Bad render %d", S);
char start = 0;
if (!s[S].l)
{ // New - draw to bottom
s[S].l = (l < 0 ? -1 : 1) * (bottom + S + W * 4 + (l < 0 ? 0 : W * 4));
s[S].r = (r < 0 ? -1 : 1) * (bottom + (S + 1) % (W * 4) + W * 4 + (r < 0 ? 0 : W * 4));
printf ("[%d,%d,%d,%d],", abs (s[S].l), abs (s[S].r), (S + 1) % (W * 4), S);
}
// Advance
if (l == s[S].l && r == s[S].r)
return;