Repository navigation
Expand file tree
/
Copy pathdverb1.c
More file actions
447 lines (398 loc) · 9.5 KB
/
Copy pathdverb1.c
File metadata and controls
447 lines (398 loc) · 9.5 KB
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
/* TAKE-- BASIC TAKE SEQUENCE */
/*COPYRIGHT 1980, INFOCOM COMPUTERS AND COMMUNICATIONS, CAMBRIDGE MA. 02142*/
/* ALL RIGHTS RESERVED, COMMERCIAL USAGE STRICTLY PROHIBITED */
/* WRITTEN BY R. M. SUPNIK */
#include "funcs.h"
#include "vars.h"
/* TAKE AN OBJECT (FOR VERBS TAKE, PUT, DROP, READ, ETC.) */
logical take_(flg)
logical flg;
{
/* System generated locals */
integer i__1;
logical ret_val;
/* Local variables */
integer oa;
integer x;
ret_val = FALSE_;
/* !ASSUME LOSES. */
oa = objcts_1.oactio[prsvec_1.prso - 1];
/* !GET OBJECT ACTION. */
if (prsvec_1.prso <= star_1.strbit) {
goto L100;
}
/* !STAR? */
ret_val = objact_();
/* !YES, LET IT HANDLE. */
return ret_val;
L100:
x = objcts_1.ocan[prsvec_1.prso - 1];
/* !INSIDE? */
if (prsvec_1.prso != advs_1.avehic[play_1.winner - 1]) {
goto L400;
}
/* !HIS VEHICLE? */
rspeak_(672);
/* !DUMMY. */
return ret_val;
L400:
if ((objcts_1.oflag1[prsvec_1.prso - 1] & TAKEBT) != 0) {
goto L500;
}
if (! oappli_(oa, 0)) {
i__1 = rnd_(5) + 552;
rspeak_(i__1);
}
return ret_val;
/* OBJECT IS TAKEABLE AND IN POSITION TO BE TAKEN. */
L500:
if (x != 0 || qhere_(prsvec_1.prso, play_1.here)) {
goto L600;
}
if (objcts_1.oadv[prsvec_1.prso - 1] == play_1.winner) {
rspeak_(557);
}
/* !ALREADY GOT IT? */
return ret_val;
L600:
if (x != 0 && objcts_1.oadv[x - 1] == play_1.winner || weight_(0,
prsvec_1.prso, play_1.winner) + objcts_1.osize[prsvec_1.prso - 1]
<= state_1.mxload) {
goto L700;
}
rspeak_(558);
/* !TOO MUCH WEIGHT. */
return ret_val;
L700:
ret_val = TRUE_;
/* !AT LAST. */
if (oappli_(oa, 0)) {
return ret_val;
}
/* !DID IT HANDLE? */
newsta_(prsvec_1.prso, 0, 0, 0, play_1.winner);
/* !TAKE OBJECT FOR WINNER. */
objcts_1.oflag2[prsvec_1.prso - 1] |= TCHBT;
scrupd_(objcts_1.ofval[prsvec_1.prso - 1]);
/* !UPDATE SCORE. */
objcts_1.ofval[prsvec_1.prso - 1] = 0;
/* !CANT BE SCORED AGAIN. */
if (flg) {
rspeak_(559);
}
/* !TELL TAKEN. */
return ret_val;
} /* take_ */
/* DROP- DROP VERB PROCESSOR */
/* DECLARATIONS */
logical drop_(z)
logical z;
{
/* System generated locals */
logical ret_val;
/* Local variables */
logical f;
integer i, x;
ret_val = TRUE_;
/* !ASSUME WINS. */
x = objcts_1.ocan[prsvec_1.prso - 1];
/* !GET CONTAINER. */
if (x == 0) {
goto L200;
}
/* !IS IT INSIDE? */
if (objcts_1.oadv[x - 1] != play_1.winner) {
goto L1000;
}
/* !IS HE CARRYING CON? */
if ((objcts_1.oflag2[x - 1] & OPENBT) != 0) {
goto L300;
}
rspsub_(525, objcts_1.odesc2[x - 1]);
/* !CANT REACH. */
return ret_val;
L200:
if (objcts_1.oadv[prsvec_1.prso - 1] != play_1.winner) {
goto L1000;
}
/* !IS HE CARRYING OBJ? */
L300:
if (advs_1.avehic[play_1.winner - 1] == 0) {
goto L400;
}
/* !IS HE IN VEHICLE? */
prsvec_1.prsi = advs_1.avehic[play_1.winner - 1];
/* !YES, */
f = put_(1);
/* !DROP INTO VEHICLE. */
prsvec_1.prsi = 0;
/* !DISARM PARSER. */
return ret_val;
/* !DONE. */
L400:
newsta_(prsvec_1.prso, 0, play_1.here, 0, 0);
/* !DROP INTO ROOM. */
if (play_1.here == rindex_1.mtree) {
newsta_(prsvec_1.prso, 0, rindex_1.fore3, 0, 0);
}
scrupd_(objcts_1.ofval[prsvec_1.prso - 1]);
/* !SCORE OBJECT. */
objcts_1.ofval[prsvec_1.prso - 1] = 0;
/* !CANT BE SCORED AGAIN. */
objcts_1.oflag2[prsvec_1.prso - 1] |= TCHBT;
if (objact_()) {
return ret_val;
}
/* !DID IT HANDLE? */
i = 0;
/* !ASSUME NOTHING TO SAY. */
if (prsvec_1.prsa == vindex_1.dropw) {
i = 528;
}
if (prsvec_1.prsa == vindex_1.throww) {
i = 529;
}
if (i != 0 && play_1.here == rindex_1.mtree) {
i = 659;
}
rspsub_(i, objcts_1.odesc2[prsvec_1.prso - 1]);
return ret_val;
L1000:
rspeak_(527);
/* !DONT HAVE IT. */
return ret_val;
} /* drop_ */
/* PUT- PUT VERB PROCESSOR */
/* DECLARATIONS */
logical put_(flg)
logical flg;
{
/* System generated locals */
logical ret_val;
/* Local variables */
integer j;
integer svi, svo;
ret_val = FALSE_;
if (prsvec_1.prso <= star_1.strbit && prsvec_1.prsi <= star_1.strbit) {
goto L200;
}
if (! objact_()) {
rspeak_(560);
}
/* !STAR */
ret_val = TRUE_;
return ret_val;
L200:
if ((objcts_1.oflag2[prsvec_1.prsi - 1] & OPENBT) != 0 || (
objcts_1.oflag1[prsvec_1.prsi - 1] & DOORBT +
CONTBT) != 0 || (objcts_1.oflag2[prsvec_1.prsi - 1] &
VEHBT) != 0) {
goto L300;
}
rspeak_(561);
/* !CANT PUT IN THAT. */
return ret_val;
L300:
if ((objcts_1.oflag2[prsvec_1.prsi - 1] & OPENBT) != 0) {
goto L400;
}
/* !IS IT OPEN? */
rspeak_(562);
/* !NO, JOKE */
return ret_val;
L400:
if (prsvec_1.prso != prsvec_1.prsi) {
goto L500;
}
/* !INTO ITSELF? */
rspeak_(563);
/* !YES, JOKE. */
return ret_val;
L500:
if (objcts_1.ocan[prsvec_1.prso - 1] != prsvec_1.prsi) {
goto L600;
}
/* !ALREADY INSIDE. */
rspsb2_(564, objcts_1.odesc2[prsvec_1.prso - 1], objcts_1.odesc2[
prsvec_1.prsi - 1]);
ret_val = TRUE_;
return ret_val;
L600:
if (weight_(0, prsvec_1.prso, 0) + weight_(0, prsvec_1.prsi,
0) + objcts_1.osize[prsvec_1.prso - 1] <= objcts_1.ocapac[
prsvec_1.prsi - 1]) {
goto L700;
}
rspeak_(565);
/* !THEN CANT DO IT. */
return ret_val;
/* NOW SEE IF OBJECT (OR ITS CONTAINER) IS IN ROOM */
L700:
j = prsvec_1.prso;
/* !START SEARCH. */
L725:
if (qhere_(j, play_1.here)) {
goto L750;
}
/* !IS IT HERE? */
j = objcts_1.ocan[j - 1];
if (j != 0) {
goto L725;
}
/* !MORE TO DO? */
goto L800;
/* !NO, SCH FAILS. */
L750:
svo = prsvec_1.prso;
/* !SAVE PARSER. */
svi = prsvec_1.prsi;
prsvec_1.prsa = vindex_1.takew;
prsvec_1.prsi = 0;
if (! take_(0)) {
return ret_val;
}
/* !TAKE OBJECT. */
prsvec_1.prsa = vindex_1.putw;
prsvec_1.prso = svo;
prsvec_1.prsi = svi;
goto L1000;
/* NOW SEE IF OBJECT IS ON PERSON. */
L800:
if (objcts_1.ocan[prsvec_1.prso - 1] == 0) {
goto L1000;
}
/* !INSIDE? */
if ((objcts_1.oflag2[objcts_1.ocan[prsvec_1.prso - 1] - 1] &
OPENBT) != 0) {
goto L900;
}
/* !OPEN? */
rspsub_(566, objcts_1.odesc2[prsvec_1.prso - 1]);
/* !LOSE. */
return ret_val;
L900:
scrupd_(objcts_1.ofval[prsvec_1.prso - 1]);
/* !SCORE OBJECT. */
objcts_1.ofval[prsvec_1.prso - 1] = 0;
objcts_1.oflag2[prsvec_1.prso - 1] |= TCHBT;
newsta_(prsvec_1.prso, 0, 0, 0, play_1.winner);
/* !TEMPORARILY ON WINNER. */
L1000:
if (objact_()) {
return ret_val;
}
/* !NO, GIVE OBJECT A SHOT. */
newsta_(prsvec_1.prso, 2, 0, prsvec_1.prsi, 0);
/* !CONTAINED INSIDE. */
ret_val = TRUE_;
<
8000
div id="LC328" class="react-file-line html-div" data-testid="code-cell" data-line-number="328" style="position:relative"> return ret_val;
} /* put_ */
/* VALUAC- HANDLES VALUABLES/EVERYTHING */
void valuac_(v)
integer v;
{
/* System generated locals */
integer i__1;
/* Local variables */
logical f;
integer i;
logical f1;
integer savep, saveh;
f = TRUE_;
/* !ASSUME NO ACTIONS. */
i = 579;
/* !ASSUME NOT LIT. */
if (! lit_(play_1.here)) {
goto L4000;
}
/* !IF NOT LIT, PUNT. */
i = 677;
/* !ASSUME WRONG VERB. */
savep = prsvec_1.prso;
/* !SAVE PRSO. */
saveh = play_1.here;
/* !SAVE HERE. */
/* L100: */
if (prsvec_1.prsa != vindex_1.takew) {
goto L1000;
}
/* !TAKE EVERY/VALUA? */
i__1 = objcts_1.olnt;
for (prsvec_1.prso = 1; prsvec_1.prso <= i__1; ++prsvec_1.prso) {
/* !LOOP THRU OBJECTS. */
if (! qhere_(prsvec_1.prso, play_1.here) || (objcts_1.oflag1[
prsvec_1.prso - 1] & VISIBT) == 0 || (
objcts_1.oflag2[prsvec_1.prso - 1] & ACTRBT) != 0 ||
savep == v && objcts_1.otval[prsvec_1.prso - 1] <= 0) {
goto L500;
}
if ((objcts_1.oflag1[prsvec_1.prso - 1] & TAKEBT) == 0 && (
objcts_1.oflag2[prsvec_1.prso - 1] & TRYBT) == 0) {
goto L500;
}
f = FALSE_;
rspsub_(580, objcts_1.odesc2[prsvec_1.prso - 1]);
f1 = take_(1);
if (saveh != play_1.here) {
return;
}
L500:
;
}
goto L3000;
L1000:
if (prsvec_1.prsa != vindex_1.dropw) {
goto L2000;
}
/* !DROP EVERY/VALUA? */
i__1 = objcts_1.olnt;
for (prsvec_1.prso = 1; prsvec_1.prso <= i__1; ++prsvec_1.prso) {
if (objcts_1.oadv[prsvec_1.prso - 1] != play_1.winner || savep == v
&& objcts_1.otval[prsvec_1.prso - 1] <= 0) {
goto L1500;
}
f = FALSE_;
rspsub_(580, objcts_1.odesc2[prsvec_1.prso - 1]);
f1 = drop_(1);
if (saveh != play_1.here) {
return;
}
L1500:
;
}
goto L3000;
L2000:
if (prsvec_1.prsa != vindex_1.putw) {
goto L3000;
}
/* !PUT EVERY/VALUA? */
i__1 = objcts_1.olnt;
for (prsvec_1.prso = 1; prsvec_1.prso <= i__1; ++prsvec_1.prso) {
/* !LOOP THRU OBJECTS. */
if (objcts_1.oadv[prsvec_1.prso - 1] != play_1.winner ||
prsvec_1.prso == prsvec_1.prsi || savep == v &&
objcts_1.otval[prsvec_1.prso - 1] <= 0 || (objcts_1.oflag1[
prsvec_1.prso - 1] & VISIBT) == 0) {
goto L2500;
}
f = FALSE_;
rspsub_(580, objcts_1.odesc2[prsvec_1.prso - 1]);
f1 = put_(1);
if (saveh != play_1.here) {
return;
}
L2500:
;
}
L3000:
i = 581;
if (savep == v) {
i = 582;
}
/* !CHOOSE MESSAGE. */
L4000:
if (f) {
rspeak_(i);
}
/* !IF NOTHING, REPORT. */
} /* valuac_ */