forked from NetHack/NetHack
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathdungeon.c
3111 lines (2809 loc) · 97.4 KB
/
dungeon.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
/* NetHack 3.6 dungeon.c $NHDT-Date: 1559476918 2019/06/02 12:01:58 $ $NHDT-Branch: NetHack-3.6 $:$NHDT-Revision: 1.95 $ */
/* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */
/*-Copyright (c) Robert Patrick Rankin, 2012. */
/* NetHack may be freely redistributed. See license for details. */
#include "hack.h"
#include "dgn_file.h"
#include "dlb.h"
#include "lev.h"
#define DUNGEON_FILE "dungeon"
#define X_START "x-strt"
#define X_LOCATE "x-loca"
#define X_GOAL "x-goal"
struct proto_dungeon {
struct tmpdungeon tmpdungeon[MAXDUNGEON];
struct tmplevel tmplevel[LEV_LIMIT];
s_level *final_lev[LEV_LIMIT]; /* corresponding level pointers */
struct tmpbranch tmpbranch[BRANCH_LIMIT];
int start; /* starting index of current dungeon sp levels */
int n_levs; /* number of tmplevel entries */
int n_brs; /* number of tmpbranch entries */
};
int n_dgns; /* number of dungeons (also used in mklev.c and do.c) */
static branch *branches = (branch *) 0; /* dungeon branch list */
mapseen *mapseenchn = (struct mapseen *) 0; /*DUNGEON_OVERVIEW*/
struct lchoice {
int idx;
schar lev[MAXLINFO];
schar playerlev[MAXLINFO];
xchar dgn[MAXLINFO];
char menuletter;
};
static void FDECL(Fread, (genericptr_t, int, int, dlb *));
STATIC_DCL xchar FDECL(dname_to_dnum, (const char *));
STATIC_DCL int FDECL(find_branch, (const char *, struct proto_dungeon *));
STATIC_DCL xchar FDECL(parent_dnum, (const char *, struct proto_dungeon *));
STATIC_DCL int FDECL(level_range, (XCHAR_P, int, int, int,
struct proto_dungeon *, int *));
STATIC_DCL xchar FDECL(parent_dlevel, (const char *, struct proto_dungeon *));
STATIC_DCL int FDECL(correct_branch_type, (struct tmpbranch *));
STATIC_DCL branch *FDECL(add_branch, (int, int, struct proto_dungeon *));
STATIC_DCL void FDECL(add_level, (s_level *));
STATIC_DCL void FDECL(init_level, (int, int, struct proto_dungeon *));
STATIC_DCL int FDECL(possible_places, (int, boolean *,
struct proto_dungeon *));
STATIC_DCL xchar FDECL(pick_level, (boolean *, int));
STATIC_DCL boolean FDECL(place_level, (int, struct proto_dungeon *));
STATIC_DCL boolean FDECL(unplaced_floater, (struct dungeon *));
STATIC_DCL boolean FDECL(unreachable_level, (d_level *, BOOLEAN_P));
STATIC_DCL void FDECL(tport_menu, (winid, char *, struct lchoice *, d_level *,
BOOLEAN_P));
STATIC_DCL const char *FDECL(br_string, (int));
STATIC_DCL char FDECL(chr_u_on_lvl, (d_level *));
STATIC_DCL void FDECL(print_branch, (winid, int, int, int, BOOLEAN_P,
struct lchoice *));
STATIC_DCL mapseen *FDECL(load_mapseen, (int));
STATIC_DCL void FDECL(save_mapseen, (int, mapseen *));
STATIC_DCL mapseen *FDECL(find_mapseen, (d_level *));
STATIC_DCL mapseen *FDECL(find_mapseen_by_str, (const char *));
STATIC_DCL void FDECL(print_mapseen, (winid, mapseen *, int, int, BOOLEAN_P));
STATIC_DCL boolean FDECL(interest_mapseen, (mapseen *));
STATIC_DCL void FDECL(traverse_mapseenchn, (BOOLEAN_P, winid,
int, int, int *));
STATIC_DCL const char *FDECL(seen_string, (XCHAR_P, const char *));
STATIC_DCL const char *FDECL(br_string2, (branch *));
STATIC_DCL const char *FDECL(shop_string, (int));
STATIC_DCL char *FDECL(tunesuffix, (mapseen *, char *));
#ifdef DEBUG
#define DD dungeons[i]
STATIC_DCL void NDECL(dumpit);
STATIC_OVL void
dumpit()
{
int i;
s_level *x;
branch *br;
if (!explicitdebug(__FILE__))
return;
for (i = 0; i < n_dgns; i++) {
fprintf(stderr, "\n#%d \"%s\" (%s):\n", i, DD.dname, DD.proto);
fprintf(stderr, " num_dunlevs %d, dunlev_ureached %d\n",
DD.num_dunlevs, DD.dunlev_ureached);
fprintf(stderr, " depth_start %d, ledger_start %d\n",
DD.depth_start, DD.ledger_start);
fprintf(stderr, " flags:%s%s%s\n",
DD.flags.rogue_like ? " rogue_like" : "",
DD.flags.maze_like ? " maze_like" : "",
DD.flags.hellish ? " hellish" : "");
getchar();
}
fprintf(stderr, "\nSpecial levels:\n");
for (x = sp_levchn; x; x = x->next) {
fprintf(stderr, "%s (%d): ", x->proto, x->rndlevs);
fprintf(stderr, "on %d, %d; ", x->dlevel.dnum, x->dlevel.dlevel);
fprintf(stderr, "flags:%s%s%s%s\n",
x->flags.rogue_like ? " rogue_like" : "",
x->flags.maze_like ? " maze_like" : "",
x->flags.hellish ? " hellish" : "",
x->flags.town ? " town" : "");
getchar();
}
fprintf(stderr, "\nBranches:\n");
for (br = branches; br; br = br->next) {
fprintf(stderr, "%d: %s, end1 %d %d, end2 %d %d, %s\n", br->id,
br->type == BR_STAIR
? "stair"
: br->type == BR_NO_END1
? "no end1"
: br->type == BR_NO_END2
? "no end2"
: br->type == BR_PORTAL
? "portal"
: "unknown",
br->end1.dnum, br->end1.dlevel, br->end2.dnum,
br->end2.dlevel, br->end1_up ? "end1 up" : "end1 down");
}
getchar();
fprintf(stderr, "\nDone\n");
getchar();
}
#endif
/* Save the dungeon structures. */
void
save_dungeon(fd, perform_write, free_data)
int fd;
boolean perform_write, free_data;
{
branch *curr, *next;
mapseen *curr_ms, *next_ms;
int count;
if (perform_write) {
bwrite(fd, (genericptr_t) &n_dgns, sizeof n_dgns);
bwrite(fd, (genericptr_t) dungeons,
sizeof(dungeon) * (unsigned) n_dgns);
bwrite(fd, (genericptr_t) &dungeon_topology, sizeof dungeon_topology);
bwrite(fd, (genericptr_t) tune, sizeof tune);
for (count = 0, curr = branches; curr; curr = curr->next)
count++;
bwrite(fd, (genericptr_t) &count, sizeof(count));
for (curr = branches; curr; curr = curr->next)
bwrite(fd, (genericptr_t) curr, sizeof(branch));
count = maxledgerno();
bwrite(fd, (genericptr_t) &count, sizeof count);
bwrite(fd, (genericptr_t) level_info,
(unsigned) count * sizeof(struct linfo));
bwrite(fd, (genericptr_t) &inv_pos, sizeof inv_pos);
for (count = 0, curr_ms = mapseenchn; curr_ms;
curr_ms = curr_ms->next)
count++;
bwrite(fd, (genericptr_t) &count, sizeof(count));
for (curr_ms = mapseenchn; curr_ms; curr_ms = curr_ms->next)
save_mapseen(fd, curr_ms);
}
if (free_data) {
for (curr = branches; curr; curr = next) {
next = curr->next;
free((genericptr_t) curr);
}
branches = 0;
for (curr_ms = mapseenchn; curr_ms; curr_ms = next_ms) {
next_ms = curr_ms->next;
if (curr_ms->custom)
free((genericptr_t) curr_ms->custom);
if (curr_ms->final_resting_place)
savecemetery(fd, FREE_SAVE, &curr_ms->final_resting_place);
free((genericptr_t) curr_ms);
}
mapseenchn = 0;
}
}
/* Restore the dungeon structures. */
void
restore_dungeon(fd)
int fd;
{
branch *curr, *last;
int count, i;
mapseen *curr_ms, *last_ms;
mread(fd, (genericptr_t) &n_dgns, sizeof(n_dgns));
mread(fd, (genericptr_t) dungeons, sizeof(dungeon) * (unsigned) n_dgns);
mread(fd, (genericptr_t) &dungeon_topology, sizeof dungeon_topology);
mread(fd, (genericptr_t) tune, sizeof tune);
last = branches = (branch *) 0;
mread(fd, (genericptr_t) &count, sizeof(count));
for (i = 0; i < count; i++) {
curr = (branch *) alloc(sizeof(branch));
mread(fd, (genericptr_t) curr, sizeof(branch));
curr->next = (branch *) 0;
if (last)
last->next = curr;
else
branches = curr;
last = curr;
}
mread(fd, (genericptr_t) &count, sizeof(count));
if (count >= MAXLINFO)
panic("level information count larger (%d) than allocated size",
count);
mread(fd, (genericptr_t) level_info,
(unsigned) count * sizeof(struct linfo));
mread(fd, (genericptr_t) &inv_pos, sizeof inv_pos);
mread(fd, (genericptr_t) &count, sizeof(count));
last_ms = (mapseen *) 0;
for (i = 0; i < count; i++) {
curr_ms = load_mapseen(fd);
curr_ms->next = (mapseen *) 0;
if (last_ms)
last_ms->next = curr_ms;
else
mapseenchn = curr_ms;
last_ms = curr_ms;
}
}
static void
Fread(ptr, size, nitems, stream)
genericptr_t ptr;
int size, nitems;
dlb *stream;
{
int cnt;
if ((cnt = dlb_fread(ptr, size, nitems, stream)) != nitems) {
panic(
"Premature EOF on dungeon description file!\r\nExpected %d bytes - got %d.",
(size * nitems), (size * cnt));
nh_terminate(EXIT_FAILURE);
}
}
STATIC_OVL xchar
dname_to_dnum(s)
const char *s;
{
xchar i;
for (i = 0; i < n_dgns; i++)
if (!strcmp(dungeons[i].dname, s))
return i;
panic("Couldn't resolve dungeon number for name \"%s\".", s);
/*NOT REACHED*/
return (xchar) 0;
}
s_level *
find_level(s)
const char *s;
{
s_level *curr;
for (curr = sp_levchn; curr; curr = curr->next)
if (!strcmpi(s, curr->proto))
break;
return curr;
}
/* Find the branch that links the named dungeon. */
STATIC_OVL int
find_branch(s, pd)
const char *s; /* dungeon name */
struct proto_dungeon *pd;
{
int i;
if (pd) {
for (i = 0; i < pd->n_brs; i++)
if (!strcmp(pd->tmpbranch[i].name, s))
break;
if (i == pd->n_brs)
panic("find_branch: can't find %s", s);
} else {
/* support for level tport by name */
branch *br;
const char *dnam;
for (br = branches; br; br = br->next) {
dnam = dungeons[br->end2.dnum].dname;
if (!strcmpi(dnam, s)
|| (!strncmpi(dnam, "The ", 4) && !strcmpi(dnam + 4, s)))
break;
}
i = br ? ((ledger_no(&br->end1) << 8) | ledger_no(&br->end2)) : -1;
}
return i;
}
/*
* Find the "parent" by searching the prototype branch list for the branch
* listing, then figuring out to which dungeon it belongs.
*/
STATIC_OVL xchar
parent_dnum(s, pd)
const char *s; /* dungeon name */
struct proto_dungeon *pd;
{
int i;
xchar pdnum;
i = find_branch(s, pd);
/*
* Got branch, now find parent dungeon. Stop if we have reached
* "this" dungeon (if we haven't found it by now it is an error).
*/
for (pdnum = 0; strcmp(pd->tmpdungeon[pdnum].name, s); pdnum++)
if ((i -= pd->tmpdungeon[pdnum].branches) < 0)
return pdnum;
panic("parent_dnum: couldn't resolve branch.");
/*NOT REACHED*/
return (xchar) 0;
}
/*
* Return a starting point and number of successive positions a level
* or dungeon entrance can occupy.
*
* Note: This follows the acouple (instead of the rcouple) rules for a
* negative random component (randc < 0). These rules are found
* in dgn_comp.y. The acouple [absolute couple] section says that
* a negative random component means from the (adjusted) base to the
* end of the dungeon.
*/
STATIC_OVL int
level_range(dgn, base, randc, chain, pd, adjusted_base)
xchar dgn;
int base, randc, chain;
struct proto_dungeon *pd;
int *adjusted_base;
{
int lmax = dungeons[dgn].num_dunlevs;
if (chain >= 0) { /* relative to a special level */
s_level *levtmp = pd->final_lev[chain];
if (!levtmp)
panic("level_range: empty chain level!");
base += levtmp->dlevel.dlevel;
} else { /* absolute in the dungeon */
/* from end of dungeon */
if (base < 0)
base = (lmax + base + 1);
}
if (base < 1 || base > lmax)
panic("level_range: base value out of range");
*adjusted_base = base;
if (randc == -1) { /* from base to end of dungeon */
return (lmax - base + 1);
} else if (randc) {
/* make sure we don't run off the end of the dungeon */
return (((base + randc - 1) > lmax) ? lmax - base + 1 : randc);
} /* else only one choice */
return 1;
}
STATIC_OVL xchar
parent_dlevel(s, pd)
const char *s;
struct proto_dungeon *pd;
{
int i, j, num, base, dnum = parent_dnum(s, pd);
branch *curr;
i = find_branch(s, pd);
num = level_range(dnum, pd->tmpbranch[i].lev.base,
pd->tmpbranch[i].lev.rand, pd->tmpbranch[i].chain, pd,
&base);
/* KMH -- Try our best to find a level without an existing branch */
i = j = rn2(num);
do {
if (++i >= num)
i = 0;
for (curr = branches; curr; curr = curr->next)
if ((curr->end1.dnum == dnum && curr->end1.dlevel == base + i)
|| (curr->end2.dnum == dnum && curr->end2.dlevel == base + i))
break;
} while (curr && i != j);
return (base + i);
}
/* Convert from the temporary branch type to the dungeon branch type. */
STATIC_OVL int
correct_branch_type(tbr)
struct tmpbranch *tbr;
{
switch (tbr->type) {
case TBR_STAIR:
return BR_STAIR;
case TBR_NO_UP:
return tbr->up ? BR_NO_END1 : BR_NO_END2;
case TBR_NO_DOWN:
return tbr->up ? BR_NO_END2 : BR_NO_END1;
case TBR_PORTAL:
return BR_PORTAL;
}
impossible("correct_branch_type: unknown branch type");
return BR_STAIR;
}
/*
* Add the given branch to the branch list. The branch list is ordered
* by end1 dungeon and level followed by end2 dungeon and level. If
* extract_first is true, then the branch is already part of the list
* but needs to be repositioned.
*/
void
insert_branch(new_branch, extract_first)
branch *new_branch;
boolean extract_first;
{
branch *curr, *prev;
long new_val, curr_val, prev_val;
if (extract_first) {
for (prev = 0, curr = branches; curr; prev = curr, curr = curr->next)
if (curr == new_branch)
break;
if (!curr)
panic("insert_branch: not found");
if (prev)
prev->next = curr->next;
else
branches = curr->next;
}
new_branch->next = (branch *) 0;
/* Convert the branch into a unique number so we can sort them. */
#define branch_val(bp) \
((((long) (bp)->end1.dnum * (MAXLEVEL + 1) + (long) (bp)->end1.dlevel) \
* (MAXDUNGEON + 1) * (MAXLEVEL + 1)) \
+ ((long) (bp)->end2.dnum * (MAXLEVEL + 1) + (long) (bp)->end2.dlevel))
/*
* Insert the new branch into the correct place in the branch list.
*/
prev = (branch *) 0;
prev_val = -1;
new_val = branch_val(new_branch);
for (curr = branches; curr;
prev_val = curr_val, prev = curr, curr = curr->next) {
curr_val = branch_val(curr);
if (prev_val < new_val && new_val <= curr_val)
break;
}
if (prev) {
new_branch->next = curr;
prev->next = new_branch;
} else {
new_branch->next = branches;
branches = new_branch;
}
}
/* Add a dungeon branch to the branch list. */
STATIC_OVL branch *
add_branch(dgn, child_entry_level, pd)
int dgn;
int child_entry_level;
struct proto_dungeon *pd;
{
static int branch_id = 0;
int branch_num;
branch *new_branch;
branch_num = find_branch(dungeons[dgn].dname, pd);
new_branch = (branch *) alloc(sizeof(branch));
(void) memset((genericptr_t)new_branch, 0, sizeof(branch));
new_branch->next = (branch *) 0;
new_branch->id = branch_id++;
new_branch->type = correct_branch_type(&pd->tmpbranch[branch_num]);
new_branch->end1.dnum = parent_dnum(dungeons[dgn].dname, pd);
new_branch->end1.dlevel = parent_dlevel(dungeons[dgn].dname, pd);
new_branch->end2.dnum = dgn;
new_branch->end2.dlevel = child_entry_level;
new_branch->end1_up = pd->tmpbranch[branch_num].up ? TRUE : FALSE;
insert_branch(new_branch, FALSE);
return new_branch;
}
/*
* Add new level to special level chain. Insert it in level order with the
* other levels in this dungeon. This assumes that we are never given a
* level that has a dungeon number less than the dungeon number of the
* last entry.
*/
STATIC_OVL void
add_level(new_lev)
s_level *new_lev;
{
s_level *prev, *curr;
prev = (s_level *) 0;
for (curr = sp_levchn; curr; curr = curr->next) {
if (curr->dlevel.dnum == new_lev->dlevel.dnum
&& curr->dlevel.dlevel > new_lev->dlevel.dlevel)
break;
prev = curr;
}
if (!prev) {
new_lev->next = sp_levchn;
sp_levchn = new_lev;
} else {
new_lev->next = curr;
prev->next = new_lev;
}
}
STATIC_OVL void
init_level(dgn, proto_index, pd)
int dgn, proto_index;
struct proto_dungeon *pd;
{
s_level *new_level;
struct tmplevel *tlevel = &pd->tmplevel[proto_index];
pd->final_lev[proto_index] = (s_level *) 0; /* no "real" level */
if (!wizard && tlevel->chance <= rn2(100))
return;
pd->final_lev[proto_index] = new_level =
(s_level *) alloc(sizeof(s_level));
(void) memset((genericptr_t)new_level, 0, sizeof(s_level));
/* load new level with data */
Strcpy(new_level->proto, tlevel->name);
new_level->boneid = tlevel->boneschar;
new_level->dlevel.dnum = dgn;
new_level->dlevel.dlevel = 0; /* for now */
new_level->flags.town = !!(tlevel->flags & TOWN);
new_level->flags.hellish = !!(tlevel->flags & HELLISH);
new_level->flags.maze_like = !!(tlevel->flags & MAZELIKE);
new_level->flags.rogue_like = !!(tlevel->flags & ROGUELIKE);
new_level->flags.align = ((tlevel->flags & D_ALIGN_MASK) >> 4);
if (!new_level->flags.align)
new_level->flags.align =
((pd->tmpdungeon[dgn].flags & D_ALIGN_MASK) >> 4);
new_level->rndlevs = tlevel->rndlevs;
new_level->next = (s_level *) 0;
}
STATIC_OVL int
possible_places(idx, map, pd)
int idx; /* prototype index */
boolean *map; /* array MAXLEVEL+1 in length */
struct proto_dungeon *pd;
{
int i, start, count;
s_level *lev = pd->final_lev[idx];
/* init level possibilities */
for (i = 0; i <= MAXLEVEL; i++)
map[i] = FALSE;
/* get base and range and set those entries to true */
count = level_range(lev->dlevel.dnum, pd->tmplevel[idx].lev.base,
pd->tmplevel[idx].lev.rand, pd->tmplevel[idx].chain,
pd, &start);
for (i = start; i < start + count; i++)
map[i] = TRUE;
/* mark off already placed levels */
for (i = pd->start; i < idx; i++) {
if (pd->final_lev[i] && map[pd->final_lev[i]->dlevel.dlevel]) {
map[pd->final_lev[i]->dlevel.dlevel] = FALSE;
--count;
}
}
return count;
}
/* Pick the nth TRUE entry in the given boolean array. */
STATIC_OVL xchar
pick_level(map, nth)
boolean *map; /* an array MAXLEVEL+1 in size */
int nth;
{
int i;
for (i = 1; i <= MAXLEVEL; i++)
if (map[i] && !nth--)
return (xchar) i;
panic("pick_level: ran out of valid levels");
return 0;
}
#ifdef DDEBUG
static void FDECL(indent, (int));
static void
indent(d)
int d;
{
while (d-- > 0)
fputs(" ", stderr);
}
#endif
/*
* Place a level. First, find the possible places on a dungeon map
* template. Next pick one. Then try to place the next level. If
* successful, we're done. Otherwise, try another (and another) until
* all possible places have been tried. If all possible places have
* been exhausted, return false.
*/
STATIC_OVL boolean
place_level(proto_index, pd)
int proto_index;
struct proto_dungeon *pd;
{
boolean map[MAXLEVEL + 1]; /* valid levels are 1..MAXLEVEL inclusive */
s_level *lev;
int npossible;
#ifdef DDEBUG
int i;
#endif
if (proto_index == pd->n_levs)
return TRUE; /* at end of proto levels */
lev = pd->final_lev[proto_index];
/* No level created for this prototype, goto next. */
if (!lev)
return place_level(proto_index + 1, pd);
npossible = possible_places(proto_index, map, pd);
for (; npossible; --npossible) {
lev->dlevel.dlevel = pick_level(map, rn2(npossible));
#ifdef DDEBUG
indent(proto_index - pd->start);
fprintf(stderr, "%s: trying %d [ ", lev->proto, lev->dlevel.dlevel);
for (i = 1; i <= MAXLEVEL; i++)
if (map[i])
fprintf(stderr, "%d ", i);
fprintf(stderr, "]\n");
#endif
if (place_level(proto_index + 1, pd))
return TRUE;
map[lev->dlevel.dlevel] = FALSE; /* this choice didn't work */
}
#ifdef DDEBUG
indent(proto_index - pd->start);
fprintf(stderr, "%s: failed\n", lev->proto);
#endif
return FALSE;
}
struct level_map {
const char *lev_name;
d_level *lev_spec;
} level_map[] = { { "air", &air_level },
{ "asmodeus", &asmodeus_level },
{ "astral", &astral_level },
{ "baalz", &baalzebub_level },
{ "bigrm", &bigroom_level },
{ "castle", &stronghold_level },
{ "earth", &earth_level },
{ "fakewiz1", &portal_level },
{ "fire", &fire_level },
{ "juiblex", &juiblex_level },
{ "knox", &knox_level },
{ "medusa", &medusa_level },
{ "oracle", &oracle_level },
{ "orcus", &orcus_level },
{ "rogue", &rogue_level },
{ "sanctum", &sanctum_level },
{ "valley", &valley_level },
{ "water", &water_level },
{ "wizard1", &wiz1_level },
{ "wizard2", &wiz2_level },
{ "wizard3", &wiz3_level },
{ "minend", &mineend_level },
{ "soko1", &sokoend_level },
{ X_START, &qstart_level },
{ X_LOCATE, &qlocate_level },
{ X_GOAL, &nemesis_level },
{ "", (d_level *) 0 } };
/* initialize the "dungeon" structs */
void
init_dungeons()
{
dlb *dgn_file;
register int i, cl = 0, cb = 0;
register s_level *x;
struct proto_dungeon pd;
struct level_map *lev_map;
struct version_info vers_info;
pd.n_levs = pd.n_brs = 0;
dgn_file = dlb_fopen(DUNGEON_FILE, RDBMODE);
if (!dgn_file) {
char tbuf[BUFSZ];
Sprintf(tbuf, "Cannot open dungeon description - \"%s", DUNGEON_FILE);
#ifdef DLBRSRC /* using a resource from the executable */
Strcat(tbuf, "\" resource!");
#else /* using a file or DLB file */
#if defined(DLB)
Strcat(tbuf, "\" from ");
#ifdef PREFIXES_IN_USE
Strcat(tbuf, "\n\"");
if (fqn_prefix[DATAPREFIX])
Strcat(tbuf, fqn_prefix[DATAPREFIX]);
#else
Strcat(tbuf, "\"");
#endif
Strcat(tbuf, DLBFILE);
#endif
Strcat(tbuf, "\" file!");
#endif
#ifdef WIN32
interject_assistance(1, INTERJECT_PANIC, (genericptr_t) tbuf,
(genericptr_t) fqn_prefix[DATAPREFIX]);
#endif
panic1(tbuf);
}
/* validate the data's version against the program's version */
Fread((genericptr_t) &vers_info, sizeof vers_info, 1, dgn_file);
/* we'd better clear the screen now, since when error messages come from
* check_version() they will be printed using pline(), which doesn't
* mix with the raw messages that might be already on the screen
*/
if (iflags.window_inited)
clear_nhwindow(WIN_MAP);
if (!check_version(&vers_info, DUNGEON_FILE, TRUE))
panic("Dungeon description not valid.");
/*
* Read in each dungeon and transfer the results to the internal
* dungeon arrays.
*/
sp_levchn = (s_level *) 0;
Fread((genericptr_t) &n_dgns, sizeof(int), 1, dgn_file);
if (n_dgns >= MAXDUNGEON)
panic("init_dungeons: too many dungeons");
for (i = 0; i < n_dgns; i++) {
Fread((genericptr_t) &pd.tmpdungeon[i], sizeof(struct tmpdungeon), 1,
dgn_file);
if (!wizard && pd.tmpdungeon[i].chance
&& (pd.tmpdungeon[i].chance <= rn2(100))) {
int j;
/* skip over any levels or branches */
for (j = 0; j < pd.tmpdungeon[i].levels; j++)
Fread((genericptr_t) &pd.tmplevel[cl],
sizeof(struct tmplevel), 1, dgn_file);
for (j = 0; j < pd.tmpdungeon[i].branches; j++)
Fread((genericptr_t) &pd.tmpbranch[cb],
sizeof(struct tmpbranch), 1, dgn_file);
n_dgns--;
i--;
continue;
}
Strcpy(dungeons[i].dname, pd.tmpdungeon[i].name);
Strcpy(dungeons[i].proto, pd.tmpdungeon[i].protoname);
dungeons[i].boneid = pd.tmpdungeon[i].boneschar;
if (pd.tmpdungeon[i].lev.rand)
dungeons[i].num_dunlevs = (xchar) rn1(pd.tmpdungeon[i].lev.rand,
pd.tmpdungeon[i].lev.base);
else
dungeons[i].num_dunlevs = (xchar) pd.tmpdungeon[i].lev.base;
if (!i) {
dungeons[i].ledger_start = 0;
dungeons[i].depth_start = 1;
dungeons[i].dunlev_ureached = 1;
} else {
dungeons[i].ledger_start =
dungeons[i - 1].ledger_start + dungeons[i - 1].num_dunlevs;
dungeons[i].dunlev_ureached = 0;
}
dungeons[i].flags.hellish = !!(pd.tmpdungeon[i].flags & HELLISH);
dungeons[i].flags.maze_like = !!(pd.tmpdungeon[i].flags & MAZELIKE);
dungeons[i].flags.rogue_like = !!(pd.tmpdungeon[i].flags & ROGUELIKE);
dungeons[i].flags.align =
((pd.tmpdungeon[i].flags & D_ALIGN_MASK) >> 4);
/*
* Set the entry level for this dungeon. The pd.tmpdungeon entry
* value means:
* < 0 from bottom (-1 == bottom level)
* 0 default (top)
* > 0 actual level (1 = top)
*
* Note that the entry_lev field in the dungeon structure is
* redundant. It is used only here and in print_dungeon().
*/
if (pd.tmpdungeon[i].entry_lev < 0) {
dungeons[i].entry_lev =
dungeons[i].num_dunlevs + pd.tmpdungeon[i].entry_lev + 1;
if (dungeons[i].entry_lev <= 0)
dungeons[i].entry_lev = 1;
} else if (pd.tmpdungeon[i].entry_lev > 0) {
dungeons[i].entry_lev = pd.tmpdungeon[i].entry_lev;
if (dungeons[i].entry_lev > dungeons[i].num_dunlevs)
dungeons[i].entry_lev = dungeons[i].num_dunlevs;
} else { /* default */
dungeons[i].entry_lev = 1; /* defaults to top level */
}
if (i) { /* set depth */
branch *br;
schar from_depth;
boolean from_up;
br = add_branch(i, dungeons[i].entry_lev, &pd);
/* Get the depth of the connecting end. */
if (br->end1.dnum == i) {
from_depth = depth(&br->end2);
from_up = !br->end1_up;
} else {
from_depth = depth(&br->end1);
from_up = br->end1_up;
}
/*
* Calculate the depth of the top of the dungeon via
* its branch. First, the depth of the entry point:
*
* depth of branch from "parent" dungeon
* + -1 or 1 depending on an up or down stair or
* 0 if portal
*
* Followed by the depth of the top of the dungeon:
*
* - (entry depth - 1)
*
* We'll say that portals stay on the same depth.
*/
dungeons[i].depth_start =
from_depth + (br->type == BR_PORTAL ? 0 : (from_up ? -1 : 1))
- (dungeons[i].entry_lev - 1);
}
/* this is redundant - it should have been flagged by dgn_comp */
if (dungeons[i].num_dunlevs > MAXLEVEL)
dungeons[i].num_dunlevs = MAXLEVEL;
pd.start = pd.n_levs; /* save starting point */
pd.n_levs += pd.tmpdungeon[i].levels;
if (pd.n_levs > LEV_LIMIT)
panic("init_dungeon: too many special levels");
/*
* Read in the prototype special levels. Don't add generated
* special levels until they are all placed.
*/
for (; cl < pd.n_levs; cl++) {
Fread((genericptr_t) &pd.tmplevel[cl], sizeof(struct tmplevel), 1,
dgn_file);
init_level(i, cl, &pd);
}
/*
* Recursively place the generated levels for this dungeon. This
* routine will attempt all possible combinations before giving
* up.
*/
if (!place_level(pd.start, &pd))
panic("init_dungeon: couldn't place levels");
#ifdef DDEBUG
fprintf(stderr, "--- end of dungeon %d ---\n", i);
fflush(stderr);
getchar();
#endif
for (; pd.start < pd.n_levs; pd.start++)
if (pd.final_lev[pd.start])
add_level(pd.final_lev[pd.start]);
pd.n_brs += pd.tmpdungeon[i].branches;
if (pd.n_brs > BRANCH_LIMIT)
panic("init_dungeon: too many branches");
for (; cb < pd.n_brs; cb++)
Fread((genericptr_t) &pd.tmpbranch[cb], sizeof(struct tmpbranch),
1, dgn_file);
}
(void) dlb_fclose(dgn_file);
for (i = 0; i < 5; i++)
tune[i] = 'A' + rn2(7);
tune[5] = 0;
/*
* Find most of the special levels and dungeons so we can access their
* locations quickly.
*/
for (lev_map = level_map; lev_map->lev_name[0]; lev_map++) {
x = find_level(lev_map->lev_name);
if (x) {
assign_level(lev_map->lev_spec, &x->dlevel);
if (!strncmp(lev_map->lev_name, "x-", 2)) {
/* This is where the name substitution on the
* levels of the quest dungeon occur.
*/
Sprintf(x->proto, "%s%s", urole.filecode,
&lev_map->lev_name[1]);
} else if (lev_map->lev_spec == &knox_level) {
branch *br;
/*
* Kludge to allow floating Knox entrance. We
* specify a floating entrance by the fact that
* its entrance (end1) has a bogus dnum, namely
* n_dgns.
*/
for (br = branches; br; br = br->next)
if (on_level(&br->end2, &knox_level))
break;
if (br)
br->end1.dnum = n_dgns;
/* adjust the branch's position on the list */
insert_branch(br, TRUE);
}
}
}
/*
* I hate hardwiring these names. :-(
*/
quest_dnum = dname_to_dnum("The Quest");
sokoban_dnum = dname_to_dnum("Sokoban");
mines_dnum = dname_to_dnum("The Gnomish Mines");
tower_dnum = dname_to_dnum("Vlad's Tower");
/* one special fixup for dummy surface level */
if ((x = find_level("dummy")) != 0) {
i = x->dlevel.dnum;
/* the code above puts earth one level above dungeon level #1,
making the dummy level overlay level 1; but the whole reason
for having the dummy level is to make earth have depth -1
instead of 0, so adjust the start point to shift endgame up */
if (dunlevs_in_dungeon(&x->dlevel) > 1 - dungeons[i].depth_start)
dungeons[i].depth_start -= 1;
/* TODO: strip "dummy" out all the way here,
so that it's hidden from '#wizwhere' feedback. */
}
#ifdef DEBUG
dumpit();
#endif
}
/* return the level number for lev in *this* dungeon */
xchar
dunlev(lev)
d_level *lev;
{
return lev->dlevel;
}
/* return the lowest level number for *this* dungeon */
xchar
dunlevs_in_dungeon(lev)
d_level *lev;
{
return dungeons[lev->dnum].num_dunlevs;
}
/* return the lowest level explored in the game*/
xchar
deepest_lev_reached(noquest)
boolean noquest;
{