-
Notifications
You must be signed in to change notification settings - Fork 4
/
wizard.c
1515 lines (1325 loc) · 41.1 KB
/
wizard.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
/* wizard.c */
/**/
#include "imoria.h"
#include "dungeon.h"
#define LOW_NUM -98765432
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
#define PB(x,y,z) put_buffer((x),(y),(z))
void game_version()
{
/*{ Print Moria credits -RAK- }*/
/* why is this in the wizard code? */
vtype tmp_str;
clear_from(1);
sprintf(tmp_str," VMS Moria Version 4.8");
PB(tmp_str,1,1);
PB("Version 0.1 : 03/25/83",2,1);
PB("Version 1.0 : 05/01/84",3,1);
PB("Version 2.0 : 07/10/84",4,1);
PB("Version 3.0 : 11/20/84",5,1);
PB("Version 4.0 : 01/20/85",6,1);
PB("Modules :",8,1);
PB(" V1.0 Dungeon Generator - RAK",9,1);
PB(" Character Generator - RAK & JWT",10,1);
PB(" Moria Module - RAK",11,1);
PB(" Miscellaneous - RAK & JWT",12,1);
PB(" V2.0 Town Level & Misc - RAK",13,1);
PB(" V3.0 Internal Help & Misc - RAK",14,1);
PB(" V4.0 Source Release Version - RAK",15,1);
PB("Robert Alan Koeneke Jimmey Wayne Todd Jr.",17,1);
PB("Student/University of Oklahoma Student/University of Oklahoma",18,1);
PB("119 Crystal Bend 1912 Tiffany Dr.",19,1);
PB("Norman, OK 73069 Norman, OK 73071",20,1);
PB("(405)-321-2925 (405) 360-6792",21,1);
pause_game(24);
clear_rc(1,1);
sprintf(tmp_str," VMS Imoria Version 4.85");
PB(tmp_str,1,1);
PB("Programers : Robert Alan Koeneke / University of Oklahoma",3,1);
PB(" Jimmey Wayne Todd / University of Oklahoma",4,1);
PB(" " ,5,1);
PB("UW Modifications by : Kenneth Case, Mary Conner," ,6,1);
PB(" Robert DeLoura, Dan Flye," ,7,1);
PB(" Todd Gardiner, Dave Jungck," ,8,1);
PB(" Andy Walker, Dean Yasuda." ,9,1);
PB(" " ,10,1);
PB("University of Washington version 4.8" ,11,1);
pause_game(24);
clear_rc(1,1);
sprintf(tmp_str," Linux Imoria Version %3.2f, patch level %d",
CUR_VERSION, PATCH_LEVEL);
PB(tmp_str,1,1);
PB("Version 4.85 : 06/25/98 Finished porting from pascal",3,1);
PB(" " ,4,1);
PB("Linux port by Stephen Kertes, 1997-98." ,5,1);
PB(" " ,6,1);
PB("I fixed all the cheats I used while at UW, thanks Paul." ,7,1);
PB(" " ,8,1);
PB("Terminal, screen_map and (L)ocate taken from umoria 5.5" ,9,1);
PB(" " ,10,1);
#if USE_MTWIST
PB("Imoria uses the `Mersenne Twister' random number library",11,1);
PB("Copyright (C) 1997 Makoto Matsumoto and Takuji Nishimura.",12,1);
PB("This library is covered by the GNU Library GPL version 2.",13,1);
PB("See the file mtwist/COPYING for more information.",14,1);
#endif
pause_game(24);
draw_cave();
};
#undef PB
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
void bpswd()
{
/*{ Builds passwords -RAK- }*/
/* Do remember that the passwords are max 12 chars plus a null. */
integer i1;
strcpy(password1,"fragrance");
strcpy(password2,"mopwillow");
if (1) {
/* lesser op password */
set_seed(wdata[0][0]);
for (i1 = 1; i1 <= 12; i1++) {
password1[i1-1] = wdata[0][i1] ^ randint(255) ;
}
password1[12] = 0;
/* full op password */
set_seed(wdata[1][0]);
for (i1 = 1; i1 <= 12; i1++) {
password2[i1-1] = wdata[1][i1] ^ randint(255) ;
}
password2[12] = 0;
set_seed(get_seed());
}
};
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
boolean check_pswd(string passwd, boolean present)
{
integer i1;
char x;
string tpw; /* : packed array [1..12] of char;*/
//account_type account;
boolean checked_out = false;
/* perhaps crpyt() should be used?? */
if (present) {
strcpy(tpw, passwd);
} else {
i1 = 0;
prt("Password : ",1,1);
do {
x = inkey();
switch (x) {
case 10 :
case 13 :
break;
default :
tpw[i1++] = x;
break;
}
} while (!((i1 == 12) || (x == 13) || (x == 10)));
tpw[i1] = 0;
}
if (!(strcmp(tpw, password1))) {
checked_out = true;
wizard1 = true;
} else if (!strcmp(tpw, password2)) {
checked_out = true;
wizard1 = true;
wizard2 = true;
}
/*
if ( uw$id ) then
begin
get_account(account.body);
account.length := index( account.body, ' ' )-1;
if index( wizards, ':'+account+':' ) = 0 then
begin
wizard1 := false;
wizard2 := false;
checked_out := false;
end;
end;
*/
msg_flag = false;
if (! present) {
erase_line(msg_line,msg_line);
}
py.misc.cheated |= checked_out;
became_wizard = checked_out;
return checked_out;
}; /* end check_pswd */
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
void wizard_light()
{
/*{ Light up the dungeon -RAK- }*/
integer i1,i2,i3,i4;
boolean flag;
if (cave[char_row][char_col].pl) {
flag = false;
} else {
flag = true;
}
for (i1 = 0; i1 < cur_height; i1++) {
for (i2 = 0; i2 < cur_width; i2++) {
if (is_in(cave[i1][i2].fval,floor_set)) {
for (i3 = i1-1; i3 <= i1+1; i3++) {
for (i4 = i2-1; i4 <= i2+1; i4++) {
cave[i3][i4].pl = flag;
if (!(flag)) {
cave[i3][i4].fm = false;
}
}
}
}
}
}
prt_map();
detect_trap() ;
detect_sdoor() ;
};
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
void monster_summon_by_name(integer y,integer x,ctype name,boolean present,
boolean sleepy)
{
/*{ Wizard routine for summoning a specific monster -RAD- }*/
integer i1=0,i2,i3,i4;
ctype monster;
boolean junk;
if (!present) {
prt("Monster desired: ",1,1);
junk = (get_string(monster,1,19,26));
} else {
strcpy(monster,name);
junk = true;
}
if (junk) {
i2 = 0;
sscanf(monster,"%ld", &i2);
if (i2 < 0) {
i2 = 1;
}
if (i2 > MAX_CREATURES) {
i2 = MAX_CREATURES;
}
if ((i2 > 0) && (i2 <= MAX_CREATURES)) {
/* summon by number */
i1 = 0;
do {
i3 = y - 2 + randint(3);
i4 = x - 2 + randint(3);
if (in_bounds(i3,i4)) {
/*with cave[i3,i4] do*/
if (is_in(cave[i3][i4].fval, floor_set)) {
if (cave[i3][i4].fopen) {
place_monster(i3,i4,i2,sleepy);
i1 = 8;
y = i3;
x = i4;
}
}
}
i1++;
} while (i1 <= 8);
} else {
/* find by name, then summon */
for (i2 = 1; i2 <= MAX_CREATURES; i2++) {
if ((strstr(c_list[i2].name,monster)!=NULL) && (i1!=10)) {
i1 = 0;
do {
i3 = y - 2 + randint(3);
i4 = x - 2 + randint(3);
if (in_bounds(i3,i4)) {
/*with cave[i3,i4] do*/
if (is_in(cave[i3][i4].fval, floor_set)) {
if (cave[i3][i4].cptr==0) {
if (cave[i3][i4].fopen) {
place_monster(i3,i4,i2,sleepy);
i1 = 9;
y = i3;
x = i4;
}
}
}
}
i1++;
} while (i1<=9);
}
}
} /* end else */
} /* end if junk */
if (!present) {
erase_line(msg_line,msg_line);
}
};
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
/////// wizard_moo_item
//////////////////////////////////////////////////////////////////////
void wmi__init_data_list(list_elem_ptr *data_list)
{
/*{ Code streamlined a bit by Dean Yasuda, to eliminate the
inefficient quicksort/shell-sort combination. Exact duplicate
items eliminated from output list. --MAV }*/
list_elem_ptr curse;
treasure_type temp_ray[MAX_OBJECTS+1];
integer i1,i2,i3,gap;
treasure_type tmp;
for (i1 = 1; i1 <= MAX_OBJECTS; i1++) {
temp_ray[i1] = object_list[i1];
}
for (gap = MAX_OBJECTS / 2 ; gap > 0 ; gap /= 2) {
for (i1 = gap + 1; i1 <= MAX_OBJECTS; i1++) {
for (i2 = i1 - gap ; i2 > 0 ; i2 -= gap) {
i3 = i2 + gap;
if ((temp_ray[i2].tval > temp_ray[i3].tval) ||
((temp_ray[i2].tval == temp_ray[i3].tval) &&
(temp_ray[i2].subval > temp_ray[i3].subval))) {
tmp = temp_ray[i2];
temp_ray[i2] = temp_ray[i3];
temp_ray[i3] = tmp;
} else {
i2 = 0;
}
}
}
}
*data_list = (list_elem_ptr)safe_malloc(sizeof(list_elem),"init_data_list");
curse = *data_list;
curse->data = temp_ray[1];
for (i1 = 2; i1 <= MAX_OBJECTS; i1++) {
if ((temp_ray[i1].tval != temp_ray[i1-1].tval) ||
(temp_ray[i1].subval != temp_ray[i1-1].subval)) {
curse->next =
(list_elem_ptr)safe_malloc(sizeof(list_elem),"init_data_list");
curse = curse->next;
curse->data = temp_ray[i1];
curse->next = nil;
}
}
};
//////////////////////////////////////////////////////////////////////
void wmi__display_commands()
{
prt("You may:",22,1);
prt(" p) Pick an item. b) Browse to next page.",23,1);
prt("^R) Redraw screen. Esc) Exit.",24,1);
};
//////////////////////////////////////////////////////////////////////
void wmi__display_list(list_elem_ptr start, integer *cur_display_size,
list_elem_ptr cur_display[], list_elem_ptr *blegga,
list_elem_ptr *data_list)
{
integer count, old_display_size;
string temp;
old_display_size = *cur_display_size;
count = 0;
for ( ; (start != nil) && (count < MOO_DISPLAY_SIZE) ; ) {
count++;
if (cur_display[count] != start) {
cur_display[count] = start;
sprintf(temp,"%c) %s",96+(int)count,start->data.name);
prt(temp,count+1,1);
}
start = start->next;
}
*cur_display_size = count;
for ( ; old_display_size > *cur_display_size ; old_display_size--) {
erase_line(old_display_size+3,1);
cur_display[old_display_size] = nil;
}
if (start == nil) {
*blegga = *data_list;
} else {
*blegga = start;
}
};
//////////////////////////////////////////////////////////////////////
void wmi__clear_display(integer *cur_display_size, list_elem_ptr cur_display[])
{
integer i4;
*cur_display_size = 0;
for (i4 = 1; i4 <= MOO_DISPLAY_SIZE; i4++) {
cur_display[i4] = nil;
}
};
//////////////////////////////////////////////////////////////////////
void wmi__display_screen(integer *cur_display_size,
list_elem_ptr cur_display[],
list_elem_ptr cur_top,
list_elem_ptr *blegga,
list_elem_ptr *data_list)
{
clear_rc(1,1);
wmi__clear_display(cur_display_size, cur_display);
wmi__display_list(cur_top, cur_display_size, cur_display, blegga, data_list);
wmi__display_commands();
};
//////////////////////////////////////////////////////////////////////
boolean wmi__get_list_entry(integer *com_val,vtype pmt, integer i1, integer i2)
{
char command;
string temp;
boolean flag = true;
*com_val = 0;
sprintf(temp,"(Entries %c-%c, ^Z to exit) %s",(int)i1+96,(int)i2+96,pmt);
for ( ; (((*com_val < i1) || (*com_val > i2)) && (flag)) ; ) {
prt(temp,1,1);
command = inkey();
*com_val = (integer)command;
switch (*com_val) {
case 3: case 25: case 26: case 27:
flag = false;
break;
default:
*com_val -= 96;
break;
}
}
erase_line(1,1);
return flag;
};
//////////////////////////////////////////////////////////////////////
boolean wmi__parse_command(list_elem_ptr *blegga,
list_elem_ptr *cur_top,
integer *cur_display_size,
boolean *exit_flag,
treasure_type *back,
list_elem_ptr cur_display[],
list_elem_ptr *data_list)
{
char command;
integer com_val,which;
boolean flag = false;
if (get_com("",&command)) {
com_val = (integer)command;
switch (com_val) {
case 18 : /*{^R}*/
wmi__display_screen(cur_display_size, cur_display, *cur_top,
blegga, data_list);
break;
case 32 : /*{ }*/
case 98 : /*{b}*/
if (cur_top == blegga) {
prt("Entire list is displayed.",1,1);
} else {
cur_top = blegga;
wmi__display_list(*cur_top, cur_display_size,
cur_display, blegga, data_list);
}
break;
case 112 : /*{p}*/
if (*cur_display_size > 0) {
if (wmi__get_list_entry(&which," Pick which one?",1,
*cur_display_size)) {
*exit_flag = true;
flag = true;
*back = cur_display[which]->data;
}
}
break;
default:
prt("Invalid command",1,1);
break;
}
} else {
*exit_flag = true;
}
return flag;
};
//////////////////////////////////////////////////////////////////////
boolean wizard_moo_item(treasure_type *back)
{
/*{ Wizard routine to pick an item from the entire list, and
magic it until satisfied -DMF- }*/
list_elem_ptr data_list;
list_elem_ptr cur_top;
list_elem_ptr blegga;
list_elem_ptr cur_display[MOO_DISPLAY_SIZE+1];
integer cur_display_size;
boolean exit_flag = false;
boolean flag = false;
*back = blank_treasure;
wmi__init_data_list(&data_list);
cur_top = data_list;
wmi__display_screen(&cur_display_size, cur_display, cur_top,
&blegga, &data_list);
do {
flag = wmi__parse_command(&blegga, &cur_top, &cur_display_size,
&exit_flag, back, cur_display, &data_list);
} while (!exit_flag);
return flag;
};
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
/////// summon_item
//////////////////////////////////////////////////////////////////////
boolean si__get_new_ttype(ttype s, vtype str, string out_str)
{
/*{prompts for new string, <CR> leaves old value}*/
ttype os;
boolean flag = false;
if (strlen(s) > 0) {
sprintf(out_str,"%s [%s] : ",str,s);
} else {
sprintf(out_str,"%s : ",str);
}
prt(out_str,1,1);
strcpy(os, s);
if (get_string(s,1,strlen(out_str)+1,40)) {
flag = true;
if ((strlen(os) > 0) && (strlen(s) == 0)) {
strcpy(s, os);
}
}
return flag;
};
//////////////////////////////////////////////////////////////////////
boolean si__get_item_descriptions(string out_str, treasure_type moo_item[],
boolean *found, integer *num_found)
{
/*{ask wizard for item information/Moo!, Moo./Moo?}*/
boolean ook;
boolean flag = false;
if (si__get_new_ttype(s1,"Item string",out_str)) {
ook = true;
if (strstr(s1,"Moo!") == s1) {
moo_item[1] = blank_treasure;
ook = wizard_moo_item(&(moo_item[1]));
if (ook) {
*found = true;
*num_found = 1;
}
draw_cave();
}
if (ook) {
if (si__get_new_ttype(s2,"More stuff #1",out_str)) {
if (si__get_new_ttype(s3,"More stuff #2",out_str)) {
if (si__get_new_ttype(s4,"Special",out_str)) {
if (i_summ_count > 0) {
sprintf(out_str,"Maximum number of tries: [%ld] : ",i_summ_count);
} else {
strcpy(out_str, "Maximum number of tries: ");
}
prt(out_str,1,1);
if (get_string(out_str,1,strlen(out_str)+1,60)) {
flag = true;
}
}
}
}
}
}
return flag;
};
//////////////////////////////////////////////////////////////////////
boolean si__narrow(ttype s, integer *num_found, integer moo_cursor[])
{
/*{ eliminate all items without string s from array moo_cursor }*/
integer i1,i2;
boolean flag = false;
i2 = 1;
if (strlen(s) > 0) {
for (i1 = 1; i1 <= *num_found; i1++) {
if (strstr(object_list[moo_cursor[i1]].name,s) != NULL) {
moo_cursor[i2] = moo_cursor[i1];
i2++;
}
}
}
if (i2 > 1) {
flag = true; /*{at least one feasible substring found}*/
*num_found = i2 - 1;
}
return flag;
};
//////////////////////////////////////////////////////////////////////
boolean si__narrow_choices(integer *num_found, integer moo_cursor[],
treasure_type moo_item[])
{
/*{ use 3 substrings to narrow down specify possible items }*/
integer i1;
boolean flag = false;
ENTER("si__narrow_choices","w");
for (i1 = 1; i1 <= MAX_OBJECTS; i1++) {
moo_cursor[i1] = i1;
}
*num_found = MAX_OBJECTS;
if (si__narrow(s1, num_found, moo_cursor)) {
flag = true;
if (si__narrow(s2, num_found, moo_cursor)) {
si__narrow(s3, num_found, moo_cursor);
}
for (i1 = 1; i1 <= *num_found; i1++) {
moo_item[i1] = object_list[moo_cursor[i1]];
}
}
RETURN("si__narrow_choices", "w",'b',"found:",&flag);
return flag;
};
//////////////////////////////////////////////////////////////////////
void si__pesky_stuff(integer *best_value, integer *good_value,
treasure_type *best_pick, treasure_type *good_pick,
integer *optimize, string out_str,
integer *i_summ_count, integer *cur_pos,
integer x, integer y)
{
/*{init variables, see if optimizing (1=best, -1= worst); find # of tries }*/
integer omax;
*best_value = LOW_NUM;
*good_value = LOW_NUM;
*best_pick = yums[5]; /*{rice-a-roni}*/
*good_pick = yums[5];
if (strstr(s4,"Moo.") != NULL) {
*optimize = 1;
} else if (strstr(s4,"Moo?") != NULL) {
*optimize = -1;
} else {
*optimize = 0;
}
omax = *i_summ_count;
sscanf(out_str,"%ld",i_summ_count);
if (*i_summ_count == 0) {
*i_summ_count = omax;
}
if (i_summ_count <= 0) {
*i_summ_count = 1;
}
popt(cur_pos);
cave[y][x].tptr = *cur_pos;
t_list[*cur_pos] = blank_treasure;
sprintf(t_list[*cur_pos].name, "& bogus summoned item %ld", *cur_pos);
};
//////////////////////////////////////////////////////////////////////
boolean si__optimize_item(treasure_type *pick, integer *value,
integer optimize, integer cur_pos)
{
/*{ formula for comparing value of items}*/
integer i1;
boolean flag = false;
//with t_list[cur_pos]. do;
i1 = optimize * (t_list[cur_pos].cost + t_list[cur_pos].tohit +
t_list[cur_pos].todam + t_list[cur_pos].toac);
if (i1 > *value) {
*value = i1;
*pick = t_list[cur_pos];
flag = true;
}
return flag;
};
//////////////////////////////////////////////////////////////////////
boolean summon_item(integer y,integer x,ttype name1,ttype name2,
integer count,boolean present)
{
/*{ Wizard routine to summon a random item by substring(s) of its }*/
/*{ name, with a maximum # of tries -DMF- }*/
integer i1,i2,num_found;
integer optimize;
integer best_value,good_value;
treasure_type best_pick,good_pick;
boolean flag,done,found;
string out_str;
integer cur_pos;
char command;
treasure_type moo_item[MAX_OBJECTS+1];
integer moo_cursor[MAX_OBJECTS+1];
boolean return_value = false;
ENTER("summon_item","w");
found = false;
done = false;
if (present) {
flag = (strlen(name1) != 0);
strcpy(s1, name1);
strcpy(s2, name2);
strcpy(s3, "");
strcpy(s4, "Moo.");
sprintf(out_str,"%ld",count);
} else {
/*{found := true iff successful Moo!}*/
flag = si__get_item_descriptions(out_str, moo_item, &found, &num_found);
}
if (flag) {
si__pesky_stuff(&best_value, &good_value, &best_pick, &good_pick,
&optimize, out_str, &i_summ_count, &cur_pos, x, y);
if (!found) {
/*{create array of all ok choices}*/
found = si__narrow_choices(&num_found, moo_cursor, moo_item);
}
if (found) {
if (!present) {
msg_print("Press any key to abort...");
put_qio();
}
for (i1 = 0 ; (i1 < i_summ_count) && (!done) ; i1++) {
t_list[cur_pos] = moo_item[((num_found*i1) / i_summ_count)+1];
if (!present) {
inkey_delay(&command,0);
done = (command != 0);
}
magic_treasure(cur_pos,1000,false);
if (((strlen(s2) == 0) || (strstr(t_list[cur_pos].name,s2) != NULL)) &&
((strlen(s3) == 0) || (strstr(t_list[cur_pos].name,s3) != NULL))) {
if (si__optimize_item(&best_pick,&best_value,optimize,cur_pos)) {
/*{ leave loop prematurely if not optimizing and item is found }*/
if (optimize == 0) {
done = true;
}
}
/*{ while no correct pick, get best non-correct item }*/
} else if ((optimize != 0) && (best_value == LOW_NUM)) {
si__optimize_item(&good_pick,&good_value,optimize,cur_pos);
}
} /* end for */
} /* end if found */
if (best_value > LOW_NUM) {
msg_print("Allocated.");
t_list[cur_pos] = best_pick;
//with t_list[cur_pos]. do;
if (t_list[cur_pos].subval > 255) {
i2 = t_list[cur_pos].cost;
if (i2 < 3) {
i2 = 3;
}
t_list[cur_pos].number = i_summ_count / sqrt(100*i2 / GOLD_VALUE);
if (t_list[cur_pos].number < 1) {
t_list[cur_pos].number = 1;
} else if (t_list[cur_pos].number > 100) {
t_list[cur_pos].number = 100;
}
}
} else if (good_value > LOW_NUM) {
msg_print("Found, but not perfect match.");
t_list[cur_pos] = good_pick;
} else {
msg_print("Unfortunately your wish did not come true.");
msg_print("You have, however, been awarded a valuable consolation gift!");
t_list[cur_pos] = yums[5]; /*{rice}*/
t_list[cur_pos].number = 12;
}
return_value = true;
} else { /*{ if flag }*/
msg_print("Invalid input");
}
RETURN("summon_item", "w",'b',"allocated:",&return_value);
return return_value;
};
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
void enter_wizard_mode(boolean ask_for_pass)
{
if (wizard1) {
msg_print("Wizard mode off.");
wizard1 = false;
wizard2 = false;
reset_flag = true;
no_controly();
} else {
if (became_wizard || !ask_for_pass) {
/*if (check_pswd("doublespeak",true)) {*/
if (check_pswd(password1,true)) {
msg_print("Wizard mode on.");
controly();
}
} else {
if (check_pswd("",false)) {
msg_print("Wizard mode on.");
controly();
}
}
}
};
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////
void esf__display_commands()
{
prt("You may:",21,1);
prt(" d) Delete an entry. b) Browse to next page.",22,1);
prt(" c) Change an entry.",23,1);
prt(" q) Quit and save changes Esc) Exit without saving.",24,1);
};
//////////////////////////////////////////////////////////////////////
void esf__display_list(int start, string list[], int n1, int *blegga,
int *cur_display_size)
{
integer count,old_display_size;
string out_val;
old_display_size = *cur_display_size;
for (count = 0 ; (start <= n1) && (count < 15) ; start++) {
count++;
sprintf(out_val,"%c)%s",(char)(96+count),list[start]);
if (strlen(out_val) > 80) {
out_val[79] = 0;
}
prt(out_val,count+3,1);
}
*cur_display_size = count;
for ( ; (old_display_size > *cur_display_size) ; old_display_size--) {
erase_line(old_display_size+3,1);
}
if (start > n1) {
*blegga = 1;
} else {
*blegga = start;
}
};
//////////////////////////////////////////////////////////////////////
void esf__display_screen(int cur_top, string list[], int n1, int *blegga,
int *cur_display_size)
{
clear_screen();
*cur_display_size = 0;
put_buffer(" Username Points Diff Character name Level Race Class",2,1);
put_buffer(" ____________ ________ _ ________________________ __ __________ ______________",3,1);
esf__display_list(cur_top, list, n1, blegga, cur_display_size);
esf__display_commands();
};
//////////////////////////////////////////////////////////////////////
boolean esf__get_list_entry(int *com_val, vtype pmt, int cur_top,
int i1, int i2)
{
vtype out_val;
boolean flag = true;
*com_val = 0;
sprintf(out_val,"(Entries %c-%c, Esc to exit) %s",
(char)(i1+96), (char)(i2+96), pmt);
for ( ; (((*com_val < i1) || (*com_val > i2)) && (flag)) ; ) {
prt(out_val,1,1);
*com_val = inkey();
switch (*com_val) {
case 3: case 25: case 26: case 27:
flag = false;
break;
default:
(*com_val) += (cur_top - 97);
break;
}
}
erase_line(1,1);
return flag;
};
//////////////////////////////////////////////////////////////////////
void esf__change_entry(int cur_top, string list[], int n1,
int cur_display_size)
{
int which, i1;
string user,score,name,level;
string race,class,diffic;
integer sc,lvl,diff,i4;
boolean flag, aborted = true;
if (cur_display_size > 0) {
if (esf__get_list_entry(&which," Change which one?",
cur_top, 1, cur_top + cur_display_size - 1)) {
prt("Username : ",1,1);
if (get_string(user,1,12,12)) {
prt("Score : ",1,1);
if (get_string(score,1,9,8)) {
prt("Difficulty : ",1,1);
if (get_string(diffic,1,14,1)) {
prt("Character name : ",1,1);
if (get_string(name,1,18,24)) {
prt("Level : ",1,1);
if (get_string(level,1,9,2)) {
prt("Race : ",1,1);
if (get_string(race,1,8,10)) {
prt("Class : ",1,1);
if (get_string(class,1,9,16)) {
aborted = false;
sscanf(diffic, "%ld", &diff);
sscanf(level, "%ld", &lvl);
sscanf(score, "%ld", &sc);
sscanf(&(list[which][13]),"%ld",&i4);
if (sc == i4) {
i1 = which;
} else {
/* nuke the current slot */
for (i1 = which ; i1 < n1 ; i1++) {
strcpy(list[i1], list[i1+1]);
}
/* find the spot to insert at */
flag = false;
for (i1=1; (i1<n1) && !flag ; ) {/* XXXX corrupted? */
sscanf(&(list[i1][13]),"%ld",&i4);
if (i4 < sc) {
flag = true;
} else {
i1++;
}
}
}
format_top_score(list[i1], user, sc, diff, name, lvl,
race, class);
}
}
}
}
}
}
}
}
}
if (aborted) {
prt("Score not changed.",1,1);
} else {
prt("Score changed.",1,1);
}
};
//////////////////////////////////////////////////////////////////////
void esf__delete_entry(int cur_top, string list[], int *n1,
int cur_display_size)
{