ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/button.C
(Generate patch)

Comparing deliantra/server/common/button.C (file contents):
Revision 1.3 by elmex, Tue Aug 29 17:29:27 2006 UTC vs.
Revision 1.37 by root, Tue Jul 31 17:33:14 2007 UTC

1/* 1/*
2 * static char *rcsid_button_c = 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * "$Id: button.C,v 1.3 2006/08/29 17:29:27 elmex Exp $"; 3 *
4 */ 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5
6/*
7 CrossFire, A Multiplayer game for X-windows
8
9 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
10 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
11 7 *
12 This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT is free software: you can redistribute it and/or modify
13 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
14 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
15 (at your option) any later version. 11 * (at your option) any later version.
16 12 *
17 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
18 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 GNU General Public License for more details. 16 * GNU General Public License for more details.
21 17 *
22 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
23 along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
24 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
25 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
26 The authors can be reached via e-mail at crossfire-devel@real-time.com
27*/ 22 */
28 23
29#include <global.h> 24#include <global.h>
30#include <funcpoint.h> 25#include <funcpoint.h>
31 26
32/* 27/*
… …
37 * elmex: 32 * elmex:
38 * This function takes a objectlink list with all the objects are going to be activated. 33 * This function takes a objectlink list with all the objects are going to be activated.
39 * state is a true/false flag that will actiavte objects that have FLAG_ACTIVATE_ON_PUSH/RELEASE set. 34 * state is a true/false flag that will actiavte objects that have FLAG_ACTIVATE_ON_PUSH/RELEASE set.
40 * The source argument can be 0 or the source object for this activation. 35 * The source argument can be 0 or the source object for this activation.
41 */ 36 */
37void
42void activate_connection_link (objectlink *ol, bool state, object *source = 0) 38activate_connection_link (objectlink * ol, bool state, object *source = 0)
43{ 39{
44 object *tmp = 0;
45
46 for (; ol; ol = ol->next) 40 for (; ol; ol = ol->next)
47 { 41 {
48 if (!ol->ob || ol->ob->count != ol->id) 42 if (!ol->ob)
49 { 43 {
50 LOG (llevError, "Internal error in activate_connection_link (%ld).\n", ol->id); 44 LOG (llevError, "Internal error in activate_connection_link.\n");
51 continue; 45 continue;
52 } 46 }
47
53 /* a button link object can become freed when the map is saving. As 48 /* a button link object can become freed when the map is saving. As
54 * a map is saved, objects are removed and freed, and if an object is 49 * a map is saved, objects are removed and freed, and if an object is
55 * on top of a button, this function is eventually called. If a map 50 * on top of a button, this function is eventually called. If a map
56 * is getting moved out of memory, the status of buttons and levers 51 * is getting moved out of memory, the status of buttons and levers
57 * probably isn't important - it will get sorted out when the map is 52 * probably isn't important - it will get sorted out when the map is
58 * re-loaded. As such, just exit this function if that is the case. 53 * re-loaded. As such, just exit this function if that is the case.
59 */ 54 */
60 55
61 if (QUERY_FLAG (ol->ob, FLAG_FREED)) 56 if (QUERY_FLAG (ol->ob, FLAG_FREED))
62 return; 57 return;
58
63 tmp = ol->ob; 59 object *tmp = ol->ob;
64 60
65 /* if the criteria isn't appropriate, don't do anything */ 61 /* if the criteria isn't appropriate, don't do anything */
66 if (state && !QUERY_FLAG (tmp, FLAG_ACTIVATE_ON_PUSH)) 62 if (state && !QUERY_FLAG (tmp, FLAG_ACTIVATE_ON_PUSH))
67 continue; 63 continue;
64
68 if (!state && !QUERY_FLAG (tmp, FLAG_ACTIVATE_ON_RELEASE)) 65 if (!state && !QUERY_FLAG (tmp, FLAG_ACTIVATE_ON_RELEASE))
69 continue; 66 continue;
70 67
71 switch (tmp->type) 68 switch (tmp->type)
72 { 69 {
73 case GATE: 70 case GATE:
74 case HOLE: 71 case HOLE:
75 tmp->value = tmp->stats.maxsp ? !state : state; 72 tmp->value = tmp->stats.maxsp ? !state : state;
76 tmp->speed = 0.5; 73 tmp->set_speed (0.5);
77 update_ob_speed (tmp);
78 break; 74 break;
79 75
80 case CF_HANDLE: 76 case CF_HANDLE:
81 SET_ANIMATION (tmp, 77 SET_ANIMATION (tmp, (tmp->value = tmp->stats.maxsp ? !state : state));
82 (tmp->value =
83 tmp->stats.maxsp ? !state : state));
84 update_object (tmp, UP_OBJ_FACE); 78 update_object (tmp, UP_OBJ_FACE);
85 break; 79 break;
86 80
87 case SIGN: 81 case SIGN:
88 if (!tmp->stats.food || tmp->last_eat < tmp->stats.food) 82 if (!tmp->stats.food || tmp->last_eat < tmp->stats.food)
89 { 83 {
84 tmp->play_sound (tmp->sound);
90 new_info_map (NDI_UNIQUE | NDI_NAVY, tmp->map, tmp->msg); 85 new_info_map (NDI_UNIQUE | NDI_NAVY, tmp->map, tmp->msg);
91 if (tmp->stats.food) 86 if (tmp->stats.food)
92 tmp->last_eat++; 87 tmp->last_eat++;
93 } 88 }
94 break; 89 break;
95 90
96 case ALTAR: 91 case ALTAR:
97 tmp->value = 1; 92 tmp->value = 1;
98 SET_ANIMATION (tmp, tmp->value); 93 SET_ANIMATION (tmp, tmp->value);
99 update_object (tmp, UP_OBJ_FACE); 94 update_object (tmp, UP_OBJ_FACE);
100 break; 95 break;
101 96
102 case BUTTON: 97 case BUTTON:
103 case PEDESTAL: 98 case PEDESTAL:
104 tmp->value = state; 99 tmp->value = state;
105 SET_ANIMATION (tmp, tmp->value); 100 SET_ANIMATION (tmp, tmp->value);
106 update_object (tmp, UP_OBJ_FACE); 101 update_object (tmp, UP_OBJ_FACE);
107 break; 102 break;
108 103
109 case MOOD_FLOOR: 104 case MOOD_FLOOR:
110 do_mood_floor (tmp, source); 105 do_mood_floor (tmp, source);
111 break; 106 break;
112 107
113 case TIMED_GATE: 108 case TIMED_GATE:
114 tmp->speed = tmp->arch->clone.speed; 109 tmp->set_speed (tmp->arch->speed);
115 update_ob_speed (tmp); /* original values */
116 tmp->value = tmp->arch->clone.value; 110 tmp->value = tmp->arch->value;
117 tmp->stats.sp = 1; 111 tmp->stats.sp = 1;
118 tmp->stats.hp = tmp->stats.maxhp; 112 tmp->stats.hp = tmp->stats.maxhp;
119 /* Handle multipart gates. We copy the value for the other parts 113 /* Handle multipart gates. We copy the value for the other parts
120 * from the head - this ensures that the data will consistent 114 * from the head - this ensures that the data will consistent
121 */ 115 */
122 for (tmp = tmp->more; tmp != NULL; tmp = tmp->more) 116 for (object *part = tmp->more; part; part = part->more)
123 { 117 {
124 tmp->speed = tmp->head->speed; 118 part->value = tmp->value;
125 tmp->value = tmp->head->value; 119 part->stats.sp = tmp->stats.sp;
126 tmp->stats.sp = tmp->head->stats.sp; 120 part->stats.hp = tmp->stats.hp;
127 tmp->stats.hp = tmp->head->stats.hp;
128 update_ob_speed (tmp); 121 part->set_speed (tmp->speed);
129 } 122 }
130 break; 123 break;
131 124
132 case DIRECTOR: 125 case DIRECTOR:
133 case FIREWALL: 126 case FIREWALL:
134 if (!QUERY_FLAG (tmp, FLAG_ANIMATE) && tmp->type == FIREWALL) 127 if (!QUERY_FLAG (tmp, FLAG_ANIMATE) && tmp->type == FIREWALL)
135 move_firewall (tmp); 128 move_firewall (tmp);
136 else 129 else
137 { 130 {
138 if ((tmp->stats.sp += tmp->stats.maxsp) > 8) /* next direction */ 131 if ((tmp->stats.sp += tmp->stats.maxsp) > 8) /* next direction */
139 tmp->stats.sp = ((tmp->stats.sp - 1) % 8) + 1; 132 tmp->stats.sp = ((tmp->stats.sp - 1) % 8) + 1;
133
140 animate_turning (tmp); 134 animate_turning (tmp);
141 } 135 }
142 break; 136 break;
143 137
144 case TELEPORTER: 138 case TELEPORTER:
145 move_teleporter (tmp); 139 move_teleporter (tmp);
146 break; 140 break;
147 141
148 case CREATOR: 142 case CREATOR:
149 move_creator (tmp); 143 move_creator (tmp);
150 break; 144 break;
151 145
152 case TRIGGER_MARKER: 146 case TRIGGER_MARKER:
153 move_marker (tmp); 147 move_marker (tmp);
154 break; 148 break;
155 149
156 case DUPLICATOR: 150 case DUPLICATOR:
157 move_duplicator (tmp); 151 move_duplicator (tmp);
158 break; 152 break;
159 } 153 }
160 } 154 }
161} 155}
162 156
163/* 157/*
… …
170 * altars/pedestals/holes in the whole map. 164 * altars/pedestals/holes in the whole map.
171 * Changed the routine to loop through _all_ objects. 165 * Changed the routine to loop through _all_ objects.
172 * Better hurry with that linked list... 166 * Better hurry with that linked list...
173 * 167 *
174 */ 168 */
169void
175void push_button (object *op) 170push_button (object *op)
176{ 171{
177 oblinkpt *obp = get_button_links (op); 172 oblinkpt *obp = get_button_links (op);
178 173
179 if (INVOKE_MAP (TRIGGER, op->map, ARG_INT64(obp->value), ARG_INT(op->value))) 174 if (!obp)
180 return; 175 return;
181 176
182 if (obp && obp->link) 177 if (INVOKE_MAP (TRIGGER, op->map, ARG_INT64 (obp->value), ARG_INT (op->value)))
178 return;
179
183 activate_connection_link (obp->link, op->value, op); 180 activate_connection_link (obp->link, op->value, op);
184} 181}
185 182
186/* 183/*
187 * elmex: 184 * elmex:
188 * This activates a connection, similar to push_button (object *op) but it takes 185 * This activates a connection, similar to push_button (object *op) but it takes
189 * only a map, a connection value and a true or false flag that indicated whether 186 * only a map, a connection value and a true or false flag that indicated whether
190 * the connection was 'state' or 'released'. So that you can activate objects 187 * the connection was 'state' or 'released'. So that you can activate objects
191 * who have FLAG_ACTIVATE_ON_PUSH/RELEASE set properly. 188 * who have FLAG_ACTIVATE_ON_PUSH/RELEASE set properly.
192 * 189 *
193 */ 190 */
191void
194void activate_connection (mapstruct *map, long connection, bool state) 192activate_connection (maptile *map, long connection, bool state)
195{ 193{
196 if (INVOKE_MAP (TRIGGER, map, ARG_INT64(connection), ARG_INT(state))) 194 if (INVOKE_MAP (TRIGGER, map, ARG_INT64 (connection), ARG_INT (state)))
197 return; 195 return;
198 196
199 oblinkpt *obp = get_connection_links (map, connection); 197 oblinkpt *obp = get_connection_links (map, connection);
200 if (obp && obp->link) 198
199 if (obp)
201 activate_connection_link (obp->link, state); 200 activate_connection_link (obp->link, state);
202} 201}
203 202
204/* 203/*
205 * Updates everything connected with the button op. 204 * Updates everything connected with the button op.
206 * After changing the state of a button, this function must be called 205 * After changing the state of a button, this function must be called
207 * to make sure that all gates and other buttons connected to the 206 * to make sure that all gates and other buttons connected to the
208 * button reacts to the (eventual) change of state. 207 * button reacts to the (eventual) change of state.
209 */ 208 */
210 209void
211void update_button(object *op) { 210update_button (object *op)
211{
212 object *ab,*tmp,*head; 212 object *ab, *tmp, *head;
213 int tot,any_down=0, old_value=op->value; 213 int tot, any_down = 0, old_value = op->value;
214 oblinkpt *obp = 0; 214 oblinkpt *obp = 0;
215 objectlink *ol; 215 objectlink *ol;
216 216
217 obp = get_button_links (op); 217 obp = get_button_links (op);
218 /* LOG(llevDebug, "update_button: %s (%d)\n", op->name, op->count); */ 218 /* LOG(llevDebug, "update_button: %s (%d)\n", op->name, op->count); */
219 if (obp) 219 if (obp)
220 for (ol = obp->link; ol; ol = ol->next) { 220 for (ol = obp->link; ol; ol = ol->next)
221 if (!ol->ob || ol->ob->count != ol->id) { 221 {
222 if (!ol->ob)
223 {
222 LOG(llevDebug, "Internal error in update_button (%s).\n", op->name); 224 LOG (llevDebug, "Internal error in update_button (%s).\n", &op->name);
223 continue; 225 continue;
224 } 226 }
227
225 tmp = ol->ob; 228 tmp = ol->ob;
226 if (tmp->type==BUTTON) { 229 if (tmp->type == BUTTON)
230 {
227 for(ab=tmp->above,tot=0;ab!=NULL;ab=ab->above) 231 for (ab = tmp->above, tot = 0; ab != NULL; ab = ab->above)
228 /* Bug? The pedestal code below looks for the head of 232 /* Bug? The pedestal code below looks for the head of
229 * the object, this bit doesn't. I'd think we should check 233 * the object, this bit doesn't. I'd think we should check
230 * for head here also. Maybe it also makese sense to 234 * for head here also. Maybe it also makese sense to
231 * make the for ab=tmp->above loop common, and alter 235 * make the for ab=tmp->above loop common, and alter
232 * behaviour based on object within that loop? 236 * behaviour based on object within that loop?
233 */ 237 */
234 238
235 /* Basically, if the move_type matches that on what the 239 /* Basically, if the move_type matches that on what the
236 * button wants, we count it. The second check is so that 240 * button wants, we count it. The second check is so that
237 * objects don't move (swords, etc) will count. Note that 241 * objects don't move (swords, etc) will count. Note that
238 * this means that more work is needed to make buttons 242 * this means that more work is needed to make buttons
239 * that are only triggered by flying objects. 243 * that are only triggered by flying objects.
240 */ 244 */
241 if ((ab->move_type & tmp->move_on) || ab->move_type==0 ) 245 if ((ab->move_type & tmp->move_on) || ab->move_type == 0)
242 tot+=ab->weight*(ab->nrof?ab->nrof:1)+ab->carrying; 246 tot += ab->weight * (ab->nrof ? ab->nrof : 1) + ab->carrying;
243 247
244 tmp->value=(tot>=tmp->weight)?1:0; 248 tmp->value = (tot >= tmp->weight) ? 1 : 0;
245 if(tmp->value) 249 if (tmp->value)
246 any_down=1; 250 any_down = 1;
251 }
247 } else if (tmp->type == PEDESTAL) { 252 else if (tmp->type == PEDESTAL)
253 {
248 tmp->value = 0; 254 tmp->value = 0;
249 for(ab=tmp->above; ab!=NULL; ab=ab->above) { 255 for (ab = tmp->above; ab != NULL; ab = ab->above)
250 head = ab->head ? ab->head : ab; 256 {
257 head = ab->head_ ();
251 /* Same note regarding move_type for buttons above apply here. */ 258 /* Same note regarding move_type for buttons above apply here. */
252 if ( ((head->move_type & tmp->move_on) || ab->move_type==0) && 259 if (((head->move_type & tmp->move_on) || ab->move_type == 0) &&
253 (head->race==tmp->slaying || 260 (head->race == tmp->slaying ||
254 ((head->type==SPECIAL_KEY) && (head->slaying==tmp->slaying)) || 261 ((head->type == SPECIAL_KEY) && (head->slaying == tmp->slaying)) ||
255 (!strcmp (tmp->slaying, "player") && 262 (!strcmp (tmp->slaying, "player") && head->type == PLAYER)))
256 head->type == PLAYER)))
257 tmp->value = 1; 263 tmp->value = 1;
258 } 264 }
265
259 if(tmp->value) 266 if (tmp->value)
260 any_down=1; 267 any_down = 1;
261 } 268 }
262 } 269 }
263 if(any_down) /* If any other buttons were down, force this to remain down */ 270 if (any_down) /* If any other buttons were down, force this to remain down */
264 op->value=1; 271 op->value = 1;
265 272
266 /* If this button hasn't changed, don't do anything */ 273 /* If this button hasn't changed, don't do anything */
267 if (op->value != old_value) { 274 if (op->value != old_value)
275 {
268 SET_ANIMATION(op, op->value); 276 SET_ANIMATION (op, op->value);
269 update_object(op, UP_OBJ_FACE); 277 update_object (op, UP_OBJ_FACE);
270 push_button(op); /* Make all other buttons the same */ 278 push_button (op); /* Make all other buttons the same */
271 }
272}
273
274/*
275 * Updates every button on the map (by calling update_button() for them).
276 */
277
278void update_buttons(mapstruct *m) {
279 objectlink *ol;
280 oblinkpt *obp;
281 for (obp = m->buttons; obp; obp = obp->next)
282 for (ol = obp->link; ol; ol = ol->next) {
283 if (!ol->ob || ol->ob->count != ol->id) {
284 LOG(llevError, "Internal error in update_button (%s (%dx%d):%d, connected %ld).\n",
285 ol->ob?ol->ob->name:"null",
286 ol->ob?ol->ob->x:-1,
287 ol->ob?ol->ob->y:-1,
288 ol->id,
289 obp->value);
290 continue;
291 } 279 }
292 if (ol->ob->type==BUTTON || ol->ob->type==PEDESTAL)
293 {
294 update_button(ol->ob);
295 break;
296 }
297 }
298} 280}
299 281
282void
300void use_trigger(object *op) 283use_trigger (object *op)
301{ 284{
302
303 /* Toggle value */ 285 /* Toggle value */
304 op->value = !op->value; 286 op->value = !op->value;
305 push_button(op); 287 push_button (op);
306} 288}
307 289
308/* 290/*
309 * Note: animate_object should be used instead of this, 291 * Note: animate_object should be used instead of this,
310 * but it can't handle animations in the 8 directions 292 * but it can't handle animations in the 8 directions
311 */ 293 */
312 294void
313void animate_turning(object *op) /* only one part objects */ 295animate_turning (object *op) /* only one part objects */
314{ 296{
315 if (++op->state >= NUM_ANIMATIONS(op)/8) 297 if (++op->state >= NUM_ANIMATIONS (op) / 8)
316 op->state=0; 298 op->state = 0;
317 SET_ANIMATION(op, (op->stats.sp-1) * NUM_ANIMATIONS(op) / 8 + 299 SET_ANIMATION (op, (op->stats.sp - 1) * NUM_ANIMATIONS (op) / 8 + op->state);
318 op->state);
319 update_object(op,UP_OBJ_FACE); 300 update_object (op, UP_OBJ_FACE);
320} 301}
321 302
322#define ARCH_SACRIFICE(xyz) ((xyz)->slaying) 303#define ARCH_SACRIFICE(xyz) ((xyz)->slaying)
323#define NROF_SACRIFICE(xyz) ((uint32)(xyz)->stats.food) 304#define NROF_SACRIFICE(xyz) ((uint32)(xyz)->stats.food)
324 305
… …
330 * 311 *
331 * 0.93.4: Linked objects (ie, objects that are connected) can not be 312 * 0.93.4: Linked objects (ie, objects that are connected) can not be
332 * sacrificed. This fixes a bug of trying to put multiple altars/related 313 * sacrificed. This fixes a bug of trying to put multiple altars/related
333 * objects on the same space that take the same sacrifice. 314 * objects on the same space that take the same sacrifice.
334 */ 315 */
335 316
317int
336int check_altar_sacrifice (const object *altar, const object *sacrifice) 318check_altar_sacrifice (const object *altar, const object *sacrifice)
337{ 319{
338 if ( ! QUERY_FLAG (sacrifice, FLAG_ALIVE) 320 if (!QUERY_FLAG (sacrifice, FLAG_ALIVE) && !QUERY_FLAG (sacrifice, FLAG_IS_LINKED) && sacrifice->type != PLAYER)
339 && ! QUERY_FLAG (sacrifice, FLAG_IS_LINKED)
340 && sacrifice->type != PLAYER)
341 { 321 {
342 if ((ARCH_SACRIFICE(altar) == sacrifice->arch->name || 322 if ((ARCH_SACRIFICE (altar) == sacrifice->arch->archname
343 ARCH_SACRIFICE(altar) == sacrifice->name || 323 || ARCH_SACRIFICE (altar) == sacrifice->name
344 ARCH_SACRIFICE(altar) == sacrifice->slaying || 324 || ARCH_SACRIFICE (altar) == sacrifice->slaying
345 (!strcmp(ARCH_SACRIFICE(altar),query_base_name(sacrifice,0)))) 325 || (!strcmp (ARCH_SACRIFICE (altar), query_base_name (sacrifice, 0))))
346 && NROF_SACRIFICE(altar) <= (sacrifice->nrof?sacrifice->nrof:1)) 326 && NROF_SACRIFICE (altar) <= (sacrifice->nrof ? sacrifice->nrof : 1))
347 return 1; 327 return 1;
328
348 if (strcmp (ARCH_SACRIFICE(altar), "money") == 0 329 if (strcmp (ARCH_SACRIFICE (altar), "money") == 0
349 && sacrifice->type == MONEY
350 && sacrifice->nrof * sacrifice->value >= NROF_SACRIFICE(altar)) 330 && sacrifice->type == MONEY && sacrifice->nrof * sacrifice->value >= NROF_SACRIFICE (altar))
351 return 1; 331 return 1;
352 } 332 }
333
353 return 0; 334 return 0;
354} 335}
355
356 336
357/* 337/*
358 * operate_altar checks if sacrifice was accepted and removes sacrificed 338 * operate_altar checks if sacrifice was accepted and removes sacrificed
359 * objects. If sacrifice was succeed return 1 else 0. Might be better to 339 * objects. If sacrifice was succeed return 1 else 0. Might be better to
360 * call check_altar_sacrifice (above) than depend on the return value, 340 * call check_altar_sacrifice (above) than depend on the return value,
361 * since operate_altar will remove the sacrifice also. 341 * since operate_altar will remove the sacrifice also.
362 * 342 *
363 * If this function returns 1, '*sacrifice' is modified to point to the 343 * If this function returns 1, '*sacrifice' is modified to point to the
364 * remaining sacrifice, or is set to NULL if the sacrifice was used up. 344 * remaining sacrifice, or is set to NULL if the sacrifice was used up.
365 */ 345 */
366 346int
367int operate_altar (object *altar, object **sacrifice) 347operate_altar (object *altar, object **sacrifice)
368{ 348{
369
370 if ( ! altar->map) { 349 if (!altar->map)
350 {
371 LOG (llevError, "BUG: operate_altar(): altar has no map\n"); 351 LOG (llevError, "BUG: operate_altar(): altar has no map\n");
372 return 0; 352 return 0;
373 } 353 }
374 354
375 if (!altar->slaying || altar->value) 355 if (!altar->slaying || altar->value)
376 return 0; 356 return 0;
377 357
378 if ( ! check_altar_sacrifice (altar, *sacrifice)) 358 if (!check_altar_sacrifice (altar, *sacrifice))
379 return 0; 359 return 0;
380 360
381 /* check_altar_sacrifice should have already verified that enough money 361 /* check_altar_sacrifice should have already verified that enough money
382 * has been dropped. 362 * has been dropped.
383 */ 363 */
384 if (!strcmp(ARCH_SACRIFICE(altar), "money")) { 364 if (!strcmp (ARCH_SACRIFICE (altar), "money"))
365 {
385 int number=NROF_SACRIFICE(altar) / (*sacrifice)->value; 366 int number = NROF_SACRIFICE (altar) / (*sacrifice)->value;
386 367
387 /* Round up any sacrifices. Altars don't make change either */ 368 /* Round up any sacrifices. Altars don't make change either */
388 if (NROF_SACRIFICE(altar) % (*sacrifice)->value) number++; 369 if (NROF_SACRIFICE (altar) % (*sacrifice)->value)
370 number++;
371
389 *sacrifice = decrease_ob_nr (*sacrifice, number); 372 *sacrifice = decrease_ob_nr (*sacrifice, number);
390 } 373 }
391 else 374 else
392 *sacrifice = decrease_ob_nr (*sacrifice, NROF_SACRIFICE(altar)); 375 *sacrifice = decrease_ob_nr (*sacrifice, NROF_SACRIFICE (altar));
393 376
394 if (altar->msg) 377 if (altar->msg)
395 new_info_map(NDI_BLACK, altar->map, altar->msg); 378 new_info_map (NDI_BLACK, altar->map, altar->msg);
379
396 return 1; 380 return 1;
397} 381}
398 382
383void
399void trigger_move (object *op, int state) /* 1 down and 0 up */ 384trigger_move (object *op, int state) /* 1 down and 0 up */
400{ 385{
401 op->stats.wc = state; 386 op->stats.wc = state;
402 if (state) { 387 if (state)
388 {
403 use_trigger(op); 389 use_trigger (op);
404 if (op->stats.exp > 0) /* check sanity */ 390 op->set_speed (op->stats.exp > 0 ? 1. / op->stats.exp : 1.);
405 op->speed = 1.0 / op->stats.exp;
406 else
407 op->speed = 1.0;
408 update_ob_speed(op);
409 op->speed_left = -1; 391 op->speed_left = -1;
410 } else { 392 }
393 else
394 {
411 use_trigger(op); 395 use_trigger (op);
412 op->speed = 0; 396 op->set_speed (0);
413 update_ob_speed(op);
414 } 397 }
415} 398}
416 399
417 400
418/* 401/*
… …
425 * 408 *
426 * TRIGGER: Returns 1 if handle could be moved, 0 if not. 409 * TRIGGER: Returns 1 if handle could be moved, 0 if not.
427 * 410 *
428 * TRIGGER_BUTTON, TRIGGER_PEDESTAL: Returns 0. 411 * TRIGGER_BUTTON, TRIGGER_PEDESTAL: Returns 0.
429 */ 412 */
413int
430int check_trigger (object *op, object *cause) 414check_trigger (object *op, object *cause)
431{ 415{
432 object *tmp; 416 object *tmp;
433 int push = 0, tot = 0; 417 int push = 0, tot = 0;
434 int in_movement = op->stats.wc || op->speed; 418 int in_movement = op->stats.wc || op->speed;
435 419
436 switch (op->type) { 420 switch (op->type)
421 {
437 case TRIGGER_BUTTON: 422 case TRIGGER_BUTTON:
438 if (op->weight > 0) { 423 if (op->weight > 0)
424 {
439 if (cause) { 425 if (cause)
426 {
440 for (tmp = op->above; tmp; tmp = tmp->above) 427 for (tmp = op->above; tmp; tmp = tmp->above)
441 /* Comment reproduced from update_buttons(): */ 428 /* Comment reproduced from update_buttons(): */
442 /* Basically, if the move_type matches that on what the 429 /* Basically, if the move_type matches that on what the
443 * button wants, we count it. The second check is so that 430 * button wants, we count it. The second check is so that
444 * objects that don't move (swords, etc) will count. Note that 431 * objects that don't move (swords, etc) will count. Note that
445 * this means that more work is needed to make buttons 432 * this means that more work is needed to make buttons
446 * that are only triggered by flying objects. 433 * that are only triggered by flying objects.
447 */ 434 */
448 435
449 if ((tmp->move_type & op->move_on) || tmp->move_type==0) { 436 if ((tmp->move_type & op->move_on) || tmp->move_type == 0)
437 {
450 tot += tmp->weight * (tmp->nrof ? tmp->nrof : 1) 438 tot += tmp->weight * (tmp->nrof ? tmp->nrof : 1) + tmp->carrying;
451 + tmp->carrying;
452 } 439 }
453 if (tot >= op->weight) 440 if (tot >= op->weight)
454 push = 1; 441 push = 1;
455 if (op->stats.ac == push) 442 if (op->stats.ac == push)
456 return 0; 443 return 0;
457 op->stats.ac = push; 444 op->stats.ac = push;
458 if (NUM_ANIMATIONS(op) > 1) { 445 if (NUM_ANIMATIONS (op) > 1)
446 {
459 SET_ANIMATION (op, push); 447 SET_ANIMATION (op, push);
460 update_object (op, UP_OBJ_FACE); 448 update_object (op, UP_OBJ_FACE);
461 } 449 }
462 if (in_movement || ! push) 450 if (in_movement || !push)
463 return 0; 451 return 0;
464 } 452 }
465 trigger_move (op, push); 453 trigger_move (op, push);
466 } 454 }
467 return 0; 455 return 0;
468 456
469 case TRIGGER_PEDESTAL: 457 case TRIGGER_PEDESTAL:
470 if (cause) { 458 if (cause)
459 {
471 for (tmp = op->above; tmp; tmp = tmp->above) { 460 for (tmp = op->above; tmp; tmp = tmp->above)
461 {
472 object *head = tmp->head ? tmp->head : tmp; 462 object *head = tmp->head_ ();
473 463
474 /* See comment in TRIGGER_BUTTON about move_types */ 464 /* See comment in TRIGGER_BUTTON about move_types */
475 if (((head->move_type & op->move_on) || head->move_type==0) 465 if (((head->move_type & op->move_on) || head->move_type == 0)
476 && (head->race==op->slaying ||
477 (!strcmp (op->slaying, "player") && head->type == PLAYER))) { 466 && (head->race == op->slaying || (!strcmp (op->slaying, "player") && head->type == PLAYER)))
467 {
478 push = 1; 468 push = 1;
479 break; 469 break;
480 } 470 }
481 } 471 }
472
482 if (op->stats.ac == push) 473 if (op->stats.ac == push)
483 return 0; 474 return 0;
475
484 op->stats.ac = push; 476 op->stats.ac = push;
477
485 if (NUM_ANIMATIONS(op) > 1) { 478 if (NUM_ANIMATIONS (op) > 1)
479 {
486 SET_ANIMATION (op, push); 480 SET_ANIMATION (op, push);
487 update_object (op, UP_OBJ_FACE); 481 update_object (op, UP_OBJ_FACE);
488 } 482 }
483
489 update_object(op,UP_OBJ_FACE); 484 update_object (op, UP_OBJ_FACE);
485
490 if (in_movement || ! push) 486 if (in_movement || !push)
491 return 0; 487 return 0;
492 } 488 }
489
493 trigger_move (op, push); 490 trigger_move (op, push);
494 return 0; 491 return 0;
495 492
496 case TRIGGER_ALTAR: 493 case TRIGGER_ALTAR:
497 if (cause) { 494 if (cause)
495 {
498 if (in_movement) 496 if (in_movement)
499 return 0; 497 return 0;
498
500 if (operate_altar (op, &cause)) { 499 if (operate_altar (op, &cause))
500 {
501 if (NUM_ANIMATIONS(op) > 1) { 501 if (NUM_ANIMATIONS (op) > 1)
502 {
502 SET_ANIMATION (op, 1); 503 SET_ANIMATION (op, 1);
503 update_object(op, UP_OBJ_FACE); 504 update_object (op, UP_OBJ_FACE);
504 } 505 }
506
505 if (op->last_sp >= 0) { 507 if (op->last_sp >= 0)
508 {
506 trigger_move (op, 1); 509 trigger_move (op, 1);
507 if (op->last_sp > 0) 510 if (op->last_sp > 0)
508 op->last_sp = -op->last_sp; 511 op->last_sp = -op->last_sp;
509 } 512 }
510 else { 513 else
514 {
511 /* for trigger altar with last_sp, the ON/OFF 515 /* for trigger altar with last_sp, the ON/OFF
512 * status (-> +/- value) is "simulated": 516 * status (-> +/- value) is "simulated":
513 */ 517 */
514 op->value = !op->value; 518 op->value = !op->value;
515 trigger_move (op, 1); 519 trigger_move (op, 1);
516 op->last_sp = -op->last_sp; 520 op->last_sp = -op->last_sp;
517 op->value = !op->value; 521 op->value = !op->value;
518 } 522 }
523
519 return cause == NULL; 524 return cause == NULL;
520 } else {
521 return 0;
522 } 525 }
523 } else { 526 else
527 return 0;
528 }
529 else
530 {
524 if (NUM_ANIMATIONS(op) > 1) { 531 if (NUM_ANIMATIONS (op) > 1)
532 {
525 SET_ANIMATION (op, 0); 533 SET_ANIMATION (op, 0);
526 update_object(op, UP_OBJ_FACE); 534 update_object (op, UP_OBJ_FACE);
527 } 535 }
528 536
529 /* If trigger_altar has "last_sp > 0" set on the map, 537 /* If trigger_altar has "last_sp > 0" set on the map,
530 * it will push the connected value only once per sacrifice. 538 * it will push the connected value only once per sacrifice.
531 * Otherwise (default), the connected value will be 539 * Otherwise (default), the connected value will be
532 * pushed twice: First by sacrifice, second by reset! -AV 540 * pushed twice: First by sacrifice, second by reset! -AV
533 */ 541 */
534 if (!op->last_sp) 542 if (!op->last_sp)
535 trigger_move (op, 0); 543 trigger_move (op, 0);
536 else { 544 else
545 {
537 op->stats.wc = 0; 546 op->stats.wc = 0;
538 op->value = !op->value; 547 op->value = !op->value;
539 op->speed = 0; 548 op->set_speed (0);
540 update_ob_speed(op);
541 } 549 }
542 } 550 }
543 return 0; 551 return 0;
544 552
545 case TRIGGER: 553 case TRIGGER:
546 if (cause) { 554 if (cause)
555 {
547 if (in_movement) 556 if (in_movement)
548 return 0; 557 return 0;
558
549 push = 1; 559 push = 1;
550 } 560 }
561
551 if (NUM_ANIMATIONS(op) > 1) { 562 if (NUM_ANIMATIONS (op) > 1)
563 {
552 SET_ANIMATION (op, push); 564 SET_ANIMATION (op, push);
553 update_object(op, UP_OBJ_FACE); 565 update_object (op, UP_OBJ_FACE);
554 } 566 }
567
555 trigger_move (op, push); 568 trigger_move (op, push);
556 return 1; 569 return 1;
557 570
558 default: 571 default:
559 LOG(llevDebug, "Unknown trigger type: %s (%d)\n", op->name, op->type); 572 LOG (llevDebug, "Unknown trigger type: %s (%d)\n", &op->name, op->type);
560 return 0; 573 return 0;
561 } 574 }
562} 575}
563 576
577void
564void add_button_link(object *button, mapstruct *map, int connected) { 578add_button_link (object *button, maptile *map, int connected)
579{
565 oblinkpt *obp; 580 oblinkpt *obp;
566 objectlink *ol = get_objectlink(); 581 objectlink *ol = get_objectlink ();
567 582
568 if (!map) { 583 if (!map)
584 {
569 LOG(llevError, "Tried to add button-link without map.\n"); 585 LOG (llevError, "Tried to add button-link without map.\n");
570 return; 586 return;
571 } 587 }
588
572 if (!editor) button->path_attuned = connected; /* peterm: I need this so I can rebuild 589 button->path_attuned = connected; /* peterm: I need this so I can rebuild
573 a connected map from a template map. */ 590 a connected map from a template map. */
574/* LOG(llevDebug,"adding button %s (%d)\n", button->name, connected);*/
575 591
576 SET_FLAG(button,FLAG_IS_LINKED); 592 SET_FLAG (button, FLAG_IS_LINKED);
577 593
578 ol->ob = button; 594 ol->ob = button;
579 ol->id = button->count;
580 595
581 for (obp = map->buttons; obp && obp->value != connected; obp = obp->next); 596 for (obp = map->buttons; obp && obp->value != connected; obp = obp->next)
597 ;
582 598
583 if (obp) { 599 if (obp)
600 {
584 ol->next = obp->link; 601 ol->next = obp->link;
585 obp->link = ol; 602 obp->link = ol;
603 }
586 } else { 604 else
605 {
587 obp = get_objectlinkpt(); 606 obp = get_objectlinkpt ();
588 obp->value = connected; 607 obp->value = connected;
589 608
590 obp->next = map->buttons; 609 obp->next = map->buttons;
591 map->buttons = obp; 610 map->buttons = obp;
592 obp->link = ol; 611 obp->link = ol;
593 } 612 }
594} 613}
595 614
596/* 615/*
597 * Remove the object from the linked lists of buttons in the map. 616 * Remove the object from the linked lists of buttons in the map.
598 * This is only needed by editors. 617 * This is only needed by editors.
599 */ 618 */
600 619
620void
601void remove_button_link(object *op) { 621remove_button_link (object *op)
622{
602 oblinkpt *obp; 623 oblinkpt *obp;
603 objectlink **olp, *ol; 624 objectlink **olp, *ol;
604 625
605 if (op->map == NULL) { 626 if (op->map == NULL)
627 {
606 LOG(llevError, "remove_button_link() in object without map.\n"); 628 LOG (llevError, "remove_button_link() in object without map.\n");
607 return; 629 return;
608 } 630 }
631
609 if (!QUERY_FLAG(op,FLAG_IS_LINKED)) { 632 if (!QUERY_FLAG (op, FLAG_IS_LINKED))
633 {
610 LOG(llevError, "remove_button_linked() in unlinked object.\n"); 634 LOG (llevError, "remove_button_linked() in unlinked object.\n");
611 return; 635 return;
612 } 636 }
637
613 for (obp = op->map->buttons; obp; obp = obp->next) 638 for (obp = op->map->buttons; obp; obp = obp->next)
614 for (olp = &obp->link; (ol = *olp); olp = &ol->next) 639 for (olp = &obp->link; (ol = *olp); olp = &ol->next)
615 if (ol->ob == op) { 640 if (ol->ob == op)
641 {
642
616/* LOG(llevDebug, "Removed link %d in button %s and map %s.\n", 643/* LOG(llevDebug, "Removed link %d in button %s and map %s.\n",
617 obp->value, op->name, op->map->path); 644 obp->value, op->name, op->map->path);
618*/ 645*/
619 *olp = ol->next; 646 *olp = ol->next;
620 free(ol); 647 delete ol;
621 return; 648 return;
622 } 649 }
650
623 LOG(llevError, "remove_button_linked(): couldn't find object.\n"); 651 LOG (llevError, "remove_button_linked(): couldn't find object.\n");
624 CLEAR_FLAG(op,FLAG_IS_LINKED); 652 CLEAR_FLAG (op, FLAG_IS_LINKED);
625} 653}
626 654
627/* 655/*
628 * Gets the objectlink for this connection from the map. 656 * Gets the objectlink for this connection from the map.
629 */ 657 */
658oblinkpt *
630oblinkpt *get_connection_links (mapstruct *map, long connection) 659get_connection_links (maptile *map, long connection)
631{ 660{
632 for (oblinkpt *obp = map->buttons; obp; obp = obp->next) 661 for (oblinkpt * obp = map->buttons; obp; obp = obp->next)
633 if (obp->value == connection) 662 if (obp->value == connection)
634 return obp; 663 return obp;
664
635 return 0; 665 return 0;
636} 666}
637 667
638/* 668/*
639 * Return the first objectlink in the objects linked to this one 669 * Return the first objectlink in the objects linked to this one
640 */ 670 */
641 671
672oblinkpt *
642oblinkpt *get_button_links(const object *button) { 673get_button_links (const object *button)
674{
643 oblinkpt *obp; 675 oblinkpt *obp;
644 objectlink *ol; 676 objectlink *ol;
645 677
646 if (!button->map) 678 if (!button->map)
647 return NULL; 679 return NULL;
680
648 for (obp = button->map->buttons; obp; obp = obp->next) 681 for (obp = button->map->buttons; obp; obp = obp->next)
649 for (ol = obp->link; ol; ol = ol->next) 682 for (ol = obp->link; ol; ol = ol->next)
650 if (ol->ob == button && ol->id == button->count) 683 if (ol->ob == button)
651 return obp; 684 return obp;
685
652 return NULL; 686 return NULL;
653} 687}
654 688
655/* 689/*
656 * Made as a separate function to increase efficiency 690 * Made as a separate function to increase efficiency
657 */ 691 */
658 692
693int
659int get_button_value(const object *button) { 694get_button_value (const object *button)
695{
660 oblinkpt *obp; 696 oblinkpt *obp;
661 objectlink *ol; 697 objectlink *ol;
662 698
663 if (!button->map) 699 if (!button->map)
664 return 0; 700 return 0;
665 for (obp = button->map->buttons; obp; obp = obp->next) 701 for (obp = button->map->buttons; obp; obp = obp->next)
666 for (ol = obp->link; ol; ol = ol->next) 702 for (ol = obp->link; ol; ol = ol->next)
667 if (ol->ob == button && ol->id == button->count) 703 if (ol->ob == button)
668 return obp->value; 704 return obp->value;
669 return 0; 705 return 0;
670} 706}
671 707
672/* This routine makes monsters who are 708/* This routine makes monsters who are
… …
675 * If floor is to be triggered must have 711 * If floor is to be triggered must have
676 * a speed of zero (default is 1 for all 712 * a speed of zero (default is 1 for all
677 * but the charm floor type). 713 * but the charm floor type).
678 * by b.t. thomas@nomad.astro.psu.edu 714 * by b.t. thomas@nomad.astro.psu.edu
679 */ 715 */
680 716
717void
681void do_mood_floor(object *op, object *source) { 718do_mood_floor (object *op, object *source)
682 object *tmp; 719{
683 object *tmp2;
684
685 if (!source) 720 if (!source)
686 source = op; 721 source = op;
687 722
688 for (tmp = GET_MAP_OB(op->map, op->x, op->y); tmp; tmp=tmp->above) 723 mapspace &ms = op->ms ();
724
725 if (!(ms.flags () & P_IS_ALIVE))
726 return;
727
728 object *tmp;
729
730 for (tmp = ms.top; tmp; tmp = tmp->below)
689 if (QUERY_FLAG(tmp, FLAG_MONSTER)) break; 731 if (QUERY_FLAG (tmp, FLAG_MONSTER))
732 break;
690 733
691 /* doesn't effect players, and if there is a player on this space, won't also 734 /* doesn't effect players, and if there is a player on this space, won't also
692 * be a monster here. 735 * be a monster here.
693 */ 736 */
737 //TODO: have players really FLAG_MONSTER? kept it for safety
694 if (!tmp || tmp->type == PLAYER) return; 738 if (!tmp || tmp->type == PLAYER)
739 return;
695 740
696 switch(op->last_sp) { 741 switch (op->last_sp)
742 {
697 case 0: /* furious--make all monsters mad */ 743 case 0: /* furious--make all monsters mad */
698 if(QUERY_FLAG(tmp, FLAG_UNAGGRESSIVE))
699 CLEAR_FLAG(tmp, FLAG_UNAGGRESSIVE);
700 if(QUERY_FLAG(tmp, FLAG_FRIENDLY)) {
701 CLEAR_FLAG(tmp, FLAG_FRIENDLY);
702 remove_friendly_object(tmp);
703 tmp->attack_movement = 0;
704 /* lots of checks here, but want to make sure we don't
705 * dereference a null value
706 */
707 if (tmp->type == GOLEM && tmp->owner && tmp->owner->type==PLAYER &&
708 tmp->owner->contr->ranges[range_golem]==tmp) {
709 tmp->owner->contr->ranges[range_golem]=NULL;
710 tmp->owner->contr->golem_count = 0;
711 }
712 tmp->owner = 0;
713 }
714 break;
715 case 1: /* angry -- get neutral monsters mad */
716 if(QUERY_FLAG(tmp, FLAG_UNAGGRESSIVE)&&
717 !QUERY_FLAG(tmp, FLAG_FRIENDLY))
718 CLEAR_FLAG(tmp, FLAG_UNAGGRESSIVE);
719 break;
720 case 2: /* calm -- pacify unfriendly monsters */
721 if(!QUERY_FLAG(tmp, FLAG_UNAGGRESSIVE)) 744 if (QUERY_FLAG (tmp, FLAG_UNAGGRESSIVE))
745 CLEAR_FLAG (tmp, FLAG_UNAGGRESSIVE);
746
747 if (QUERY_FLAG (tmp, FLAG_FRIENDLY))
748 {
749 tmp->attack_movement = 0;
750 /* lots of checks here, but want to make sure we don't
751 * dereference a null value
752 */
753 if (tmp->type == GOLEM
754 && tmp->owner
755 && tmp->owner->type == PLAYER
756 && tmp->owner->contr->golem == tmp)
757 tmp->owner->contr->golem = 0;
758
759 tmp->owner = 0;
760
761 remove_friendly_object (tmp);
762 }
763 break;
764
765 case 1: /* angry -- get neutral monsters mad */
766 if (QUERY_FLAG (tmp, FLAG_UNAGGRESSIVE) && !QUERY_FLAG (tmp, FLAG_FRIENDLY))
767 CLEAR_FLAG (tmp, FLAG_UNAGGRESSIVE);
768 break;
769
770 case 2: /* calm -- pacify unfriendly monsters */
722 SET_FLAG(tmp, FLAG_UNAGGRESSIVE); 771 SET_FLAG (tmp, FLAG_UNAGGRESSIVE);
723 break; 772 break;
773
724 case 3: /* make all monsters fall asleep */ 774 case 3: /* make all monsters fall asleep */
725 if(!QUERY_FLAG(tmp, FLAG_SLEEP))
726 SET_FLAG(tmp, FLAG_SLEEP); 775 SET_FLAG (tmp, FLAG_SLEEP);
727 break; 776 break;
777
728 case 4: /* charm all monsters */ 778 case 4: /* charm all monsters */
729 if (op == source) break; /* only if 'connected' */ 779 if (op == source)
780 break; /* only if 'connected' */
730 781
731 for(tmp2=get_map_ob(source->map,source->x,source->y); /* finding an owner */ 782 if (object *pl = source->ms ().player ())
732 tmp2->type!=PLAYER;tmp2=tmp2->above) 783 {
733 if(tmp2->above==NULL) break; 784 tmp->set_owner (pl);
734
735 if (tmp2->type != PLAYER)
736 break;
737 set_owner(tmp,tmp2);
738 SET_FLAG(tmp,FLAG_MONSTER); 785 SET_FLAG (tmp, FLAG_MONSTER);
786
739 tmp->stats.exp = 0; 787 tmp->stats.exp = 0;
740 SET_FLAG(tmp, FLAG_FRIENDLY); 788
741 add_friendly_object (tmp); 789 add_friendly_object (tmp);
742 tmp->attack_movement = PETMOVE; 790 tmp->attack_movement = PETMOVE;
791 }
792 break;
793
794 case 6: // kill monsters
795 if (!QUERY_FLAG (tmp, FLAG_FRIENDLY))
743 break; 796 break;
744 797
798 // FALL THROUGH
799 case 5: // kill all alives
800 if (!tmp->flag [FLAG_PRECIOUS])
801 {
802 get_archetype ("burnout")->insert_at (tmp, source);
803 tmp->destroy ();
804 }
805 break;
806
745 default: 807 default:
746 break; 808 break;
747
748 } 809 }
749} 810}
750 811
751/* this function returns the object it matches, or NULL if non. 812/* this function returns the object it matches, or NULL if non.
752 * It will descend through containers to find the object. 813 * It will descend through containers to find the object.
753 * slaying = match object slaying flag 814 * slaying = match object slaying flag
754 * race = match object archetype name flag 815 * race = match object archetype name flag
755 * hp = match object type (excpt type '0'== PLAYER) 816 * hp = match object type (excpt type '0'== PLAYER)
756 */ 817 */
757 818object *
758object * check_inv_recursive(object *op, const object *trig) 819check_inv_recursive (object *op, const object *trig)
759{ 820{
760 object *tmp,*ret=NULL; 821 object *tmp, *ret = NULL;
761 822
762 /* First check the object itself. */ 823 /* First check the object itself. */
763 if((trig->stats.hp && (op->type == trig->stats.hp)) 824 if ((trig->stats.hp && (op->type == trig->stats.hp))
764 || (trig->slaying && (op->slaying == trig->slaying)) 825 || (trig->slaying && (op->slaying == trig->slaying))
765 || (trig->race && (op->arch->name == trig->race))) 826 || (trig->race && (op->arch->archname == trig->race)))
766 return op; 827 return op;
767 828
768 for(tmp=op->inv; tmp; tmp=tmp->below) { 829 for (tmp = op->inv; tmp; tmp = tmp->below)
830 {
769 if (tmp->inv) { 831 if (tmp->inv)
832 {
770 ret=check_inv_recursive(tmp, trig); 833 ret = check_inv_recursive (tmp, trig);
834 if (ret)
771 if (ret) return ret; 835 return ret;
772 } 836 }
773 else if((trig->stats.hp && (tmp->type == trig->stats.hp)) 837 else if ((trig->stats.hp && (tmp->type == trig->stats.hp))
774 || (trig->slaying && (tmp->slaying == trig->slaying)) 838 || (trig->slaying && (tmp->slaying == trig->slaying))
775 || (trig->race && (tmp->arch->name == trig->race))) 839 || (trig->race && (tmp->arch->archname == trig->race)))
776 return tmp; 840 return tmp;
777 } 841 }
778 return NULL; 842 return NULL;
779} 843}
780 844
781/* check_inv(), a function to search the inventory, 845/* check_inv(), a function to search the inventory,
782 * of a player and then based on a set of conditions, 846 * of a player and then based on a set of conditions,
783 * the square will activate connected items. 847 * the square will activate connected items.
784 * Monsters can't trigger this square (for now) 848 * Monsters can't trigger this square (for now)
785 * Values are: last_sp = 1/0 obj/no obj triggers 849 * Values are: last_sp = 1/0 obj/no obj triggers
786 * last_heal = 1/0 remove/dont remove obj if triggered 850 * last_heal = 1/0 remove/dont remove obj if triggered
787 * -b.t. (thomas@nomad.astro.psu.edu 851 * -b.t. (thomas@nomad.astro.psu.edu
788 */ 852 *
789 853 * Tue Dec 19 15:34:00 CET 2006 elmex: changed the function to ignore op
854 * because the check-inventory semantic essentially only applies when
855 * something is above the inventory checker.
856 * The semantic prior this change was: trigger if something has moved on or off
857 * and has a matching item. Imagine what happens if someone steps on the inventory
858 * checker with a matching item, has it, activates the connection, throws the item
859 * away, and then leaves the inventory checker. That would've caused an always-enabled
860 * state in the inventory checker. This won't happen anymore now.
861 *
862 * Wed Jan 10 11:34:26 CET 2007 elmex: fixed this function, we now check
863 * whether op is on this mapspace or not, because the value (1|0) depends
864 * on this information. also make sure to only push_button if op has
865 * a matching item (because when we do a push_button with value=0 timed gates
866 * will still open)! (i hope i got the semantics right this time)
867 *
868 */
869void
790void check_inv (object *op, object *trig) { 870check_inv (object *op, object *trig)
791object *match; 871{
872 trig->value = 0; // deactivate if none of the following conditions apply
792 873
793 if(op->type != PLAYER) return; 874 object *pl = trig->ms ().player ();
794 match = check_inv_recursive(op,trig); 875 object *match = check_inv_recursive (op, trig);
795 if (match && trig->last_sp) { 876
877 // elmex: a note about (pl == op):
878 // if pl == 0 then the player has left this space
879 // if pl != 0 then a player is on this mapspace, but then
880 // we still have to check whether it's the player that triggered
881 // this inv-checker, because if not, then the op left this inv-checker
882 // and we have to set the value to 0
883
884 if (match && trig->last_sp) // match == having
885 {
796 if(trig->last_heal) 886 if (trig->last_heal)
797 decrease_ob(match); 887 decrease_ob (match);
798 use_trigger(trig); 888
889 trig->value = (pl == op ? 1 : 0); // 1 if matching player entered, and 0 if he left
890 push_button (trig);
891 }
892 else if (!match && !trig->last_sp) // match == not having
799 } 893 {
800 else if (!match && !trig->last_sp) 894 trig->value = (pl == op ? 1 : 0); // 1 if matching player entered, and 0 if he left
801 use_trigger(trig); 895 push_button (trig);
802}
803
804
805/* This does a minimal check of the button link consistency for object
806 * map. All it really does it much sure the object id link that is set
807 * matches what the object has.
808 */
809void verify_button_links(const mapstruct *map) {
810 oblinkpt *obp;
811 objectlink *ol;
812
813 if (!map) return;
814
815 for (obp = map->buttons; obp; obp = obp->next) {
816 for (ol=obp->link; ol; ol=ol->next) {
817 if (ol->id!=ol->ob->count)
818 LOG(llevError,"verify_button_links: object %s on list is corrupt (%d!=%d)\n",ol->ob->name, ol->id, ol->ob->count);
819 }
820 } 896 }
821} 897}
898

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines