1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | 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 |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | sub/add_weight will transcend the environment updating the carrying |
26 | sub/add_weight will transcend the environment updating the carrying |
26 | variable. */ |
27 | variable. */ |
27 | #include <global.h> |
28 | #include <global.h> |
… | |
… | |
30 | #include <sys/uio.h> |
31 | #include <sys/uio.h> |
31 | #include <object.h> |
32 | #include <object.h> |
32 | #include <funcpoint.h> |
33 | #include <funcpoint.h> |
33 | #include <loader.h> |
34 | #include <loader.h> |
34 | |
35 | |
|
|
36 | #include <bitset> |
|
|
37 | |
35 | int nrofallocobjects = 0; |
38 | int nrofallocobjects = 0; |
36 | static UUID uuid; |
39 | static UUID uuid; |
37 | const uint64 UUID_SKIP = 1<<19; |
40 | const uint64 UUID_SKIP = 1<<19; |
38 | |
41 | |
39 | object *active_objects; /* List of active objects that need to be processed */ |
42 | objectvec objects; |
|
|
43 | activevec actives; |
40 | |
44 | |
41 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
45 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
42 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
46 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
43 | }; |
47 | }; |
44 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
48 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
… | |
… | |
139 | * objects with lists are rare, and lists stay short. If not, use a |
143 | * objects with lists are rare, and lists stay short. If not, use a |
140 | * different structure or at least keep the lists sorted... |
144 | * different structure or at least keep the lists sorted... |
141 | */ |
145 | */ |
142 | |
146 | |
143 | /* For each field in wants, */ |
147 | /* For each field in wants, */ |
144 | for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next) |
148 | for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next) |
145 | { |
149 | { |
146 | key_value *has_field; |
150 | key_value *has_field; |
147 | |
151 | |
148 | /* Look for a field in has with the same key. */ |
152 | /* Look for a field in has with the same key. */ |
149 | has_field = get_ob_key_link (has, wants_field->key); |
153 | has_field = get_ob_key_link (has, wants_field->key); |
… | |
… | |
183 | * |
187 | * |
184 | * Note that this function appears a lot longer than the macro it |
188 | * Note that this function appears a lot longer than the macro it |
185 | * replaces - this is mostly for clarity - a decent compiler should hopefully |
189 | * replaces - this is mostly for clarity - a decent compiler should hopefully |
186 | * reduce this to the same efficiency. |
190 | * reduce this to the same efficiency. |
187 | * |
191 | * |
188 | * Check nrof variable *before* calling CAN_MERGE() |
192 | * Check nrof variable *before* calling can_merge() |
189 | * |
193 | * |
190 | * Improvements made with merge: Better checking on potion, and also |
194 | * Improvements made with merge: Better checking on potion, and also |
191 | * check weight |
195 | * check weight |
192 | */ |
196 | */ |
193 | |
|
|
194 | bool object::can_merge (object *ob1, object *ob2) |
197 | bool object::can_merge_slow (object *ob1, object *ob2) |
195 | { |
198 | { |
196 | /* A couple quicksanity checks */ |
199 | /* A couple quicksanity checks */ |
197 | if ((ob1 == ob2) || (ob1->type != ob2->type)) |
200 | if (ob1 == ob2 |
|
|
201 | || ob1->type != ob2->type |
|
|
202 | || ob1->speed != ob2->speed |
|
|
203 | || ob1->value != ob2->value |
|
|
204 | || ob1->name != ob2->name) |
198 | return 0; |
205 | return 0; |
199 | |
206 | |
200 | if (ob1->speed != ob2->speed) |
207 | //TODO: this ain't working well, use nicer and correct overflow check |
201 | return 0; |
|
|
202 | |
|
|
203 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
208 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
204 | * value could not be stored in a sint32 (which unfortunately sometimes is |
209 | * value could not be stored in a sint32 (which unfortunately sometimes is |
205 | * used to store nrof). |
210 | * used to store nrof). |
206 | */ |
211 | */ |
207 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
212 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
… | |
… | |
217 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
222 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
218 | |
223 | |
219 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
224 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
220 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
225 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
221 | |
226 | |
222 | |
227 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
223 | /* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something |
228 | || ob1->arch != ob2->arch |
224 | * being locked in inventory should prevent merging. |
|
|
225 | * 0x4 in flags3 is CLIENT_SENT |
|
|
226 | */ |
|
|
227 | if ((ob1->arch != ob2->arch) || |
|
|
228 | (ob1->flags[0] != ob2->flags[0]) || |
|
|
229 | (ob1->flags[1] != ob2->flags[1]) || |
|
|
230 | ((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) || |
|
|
231 | ((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) || |
|
|
232 | (ob1->name != ob2->name) || |
229 | || ob1->name != ob2->name |
233 | (ob1->title != ob2->title) || |
230 | || ob1->title != ob2->title |
234 | (ob1->msg != ob2->msg) || |
231 | || ob1->msg != ob2->msg |
235 | (ob1->weight != ob2->weight) || |
232 | || ob1->weight != ob2->weight |
236 | (memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) || |
233 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
237 | (memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) || |
234 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) ) |
238 | (ob1->attacktype != ob2->attacktype) || |
235 | || ob1->attacktype != ob2->attacktype |
239 | (ob1->magic != ob2->magic) || |
236 | || ob1->magic != ob2->magic |
240 | (ob1->slaying != ob2->slaying) || |
237 | || ob1->slaying != ob2->slaying |
241 | (ob1->skill != ob2->skill) || |
238 | || ob1->skill != ob2->skill |
242 | (ob1->value != ob2->value) || |
239 | || ob1->value != ob2->value |
243 | (ob1->animation_id != ob2->animation_id) || |
240 | || ob1->animation_id != ob2->animation_id |
244 | (ob1->client_type != ob2->client_type) || |
241 | || ob1->client_type != ob2->client_type |
245 | (ob1->materialname != ob2->materialname) || |
242 | || ob1->materialname != ob2->materialname |
246 | (ob1->lore != ob2->lore) || |
243 | || ob1->lore != ob2->lore |
247 | (ob1->subtype != ob2->subtype) || |
244 | || ob1->subtype != ob2->subtype |
248 | (ob1->move_type != ob2->move_type) || |
245 | || ob1->move_type != ob2->move_type |
249 | (ob1->move_block != ob2->move_block) || |
246 | || ob1->move_block != ob2->move_block |
250 | (ob1->move_allow != ob2->move_allow) || |
247 | || ob1->move_allow != ob2->move_allow |
251 | (ob1->move_on != ob2->move_on) || |
248 | || ob1->move_on != ob2->move_on |
252 | (ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty)) |
249 | || ob1->move_off != ob2->move_off |
|
|
250 | || ob1->move_slow != ob2->move_slow |
|
|
251 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
253 | return 0; |
252 | return 0; |
254 | |
253 | |
255 | /* This is really a spellbook check - really, we should |
254 | /* This is really a spellbook check - really, we should |
256 | * check all objects in the inventory. |
255 | * check all objects in the inventory. |
257 | */ |
256 | */ |
… | |
… | |
260 | /* if one object has inventory but the other doesn't, not equiv */ |
259 | /* if one object has inventory but the other doesn't, not equiv */ |
261 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
260 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
262 | return 0; |
261 | return 0; |
263 | |
262 | |
264 | /* Now check to see if the two inventory objects could merge */ |
263 | /* Now check to see if the two inventory objects could merge */ |
265 | if (!CAN_MERGE (ob1->inv, ob2->inv)) |
264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
266 | return 0; |
265 | return 0; |
267 | |
266 | |
268 | /* inventory ok - still need to check rest of this object to see |
267 | /* inventory ok - still need to check rest of this object to see |
269 | * if it is valid. |
268 | * if it is valid. |
270 | */ |
269 | */ |
… | |
… | |
279 | |
278 | |
280 | /* Note sure why the following is the case - either the object has to |
279 | /* Note sure why the following is the case - either the object has to |
281 | * be animated or have a very low speed. Is this an attempted monster |
280 | * be animated or have a very low speed. Is this an attempted monster |
282 | * check? |
281 | * check? |
283 | */ |
282 | */ |
284 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) |
283 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
285 | return 0; |
284 | return 0; |
286 | |
285 | |
287 | switch (ob1->type) |
286 | switch (ob1->type) |
288 | { |
287 | { |
289 | case SCROLL: |
288 | case SCROLL: |
… | |
… | |
354 | op = op->env; |
353 | op = op->env; |
355 | return op; |
354 | return op; |
356 | } |
355 | } |
357 | |
356 | |
358 | /* |
357 | /* |
359 | * Eneq(@csd.uu.se): Since we can have items buried in a character we need |
|
|
360 | * a better check. We basically keeping traversing up until we can't |
|
|
361 | * or find a player. |
|
|
362 | */ |
|
|
363 | |
|
|
364 | object * |
|
|
365 | is_player_inv (object *op) |
|
|
366 | { |
|
|
367 | for (; op != NULL && op->type != PLAYER; op = op->env) |
|
|
368 | if (op->env == op) |
|
|
369 | op->env = NULL; |
|
|
370 | return op; |
|
|
371 | } |
|
|
372 | |
|
|
373 | /* |
|
|
374 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
358 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
375 | * Some error messages. |
359 | * Some error messages. |
376 | * The result of the dump is stored in the static global errmsg array. |
360 | * The result of the dump is stored in the static global errmsg array. |
377 | */ |
361 | */ |
378 | |
362 | |
… | |
… | |
381 | { |
365 | { |
382 | if (!op) |
366 | if (!op) |
383 | return strdup ("[NULLOBJ]"); |
367 | return strdup ("[NULLOBJ]"); |
384 | |
368 | |
385 | object_freezer freezer; |
369 | object_freezer freezer; |
386 | save_object (freezer, op, 3); |
370 | save_object (freezer, op, 1); |
387 | return freezer.as_string (); |
371 | return freezer.as_string (); |
388 | } |
372 | } |
389 | |
373 | |
390 | /* |
374 | /* |
391 | * get_nearest_part(multi-object, object 2) returns the part of the |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
408 | } |
392 | } |
409 | |
393 | |
410 | /* |
394 | /* |
411 | * Returns the object which has the count-variable equal to the argument. |
395 | * Returns the object which has the count-variable equal to the argument. |
412 | */ |
396 | */ |
413 | |
|
|
414 | object * |
397 | object * |
415 | find_object (tag_t i) |
398 | find_object (tag_t i) |
416 | { |
399 | { |
417 | for (object *op = object::first; op; op = op->next) |
400 | for_all_objects (op) |
418 | if (op->count == i) |
401 | if (op->count == i) |
419 | return op; |
402 | return op; |
420 | |
403 | |
421 | return 0; |
404 | return 0; |
422 | } |
405 | } |
423 | |
406 | |
424 | /* |
407 | /* |
425 | * Returns the first object which has a name equal to the argument. |
408 | * Returns the first object which has a name equal to the argument. |
426 | * Used only by the patch command, but not all that useful. |
409 | * Used only by the patch command, but not all that useful. |
427 | * Enables features like "patch <name-of-other-player> food 999" |
410 | * Enables features like "patch <name-of-other-player> food 999" |
428 | */ |
411 | */ |
429 | |
|
|
430 | object * |
412 | object * |
431 | find_object_name (const char *str) |
413 | find_object_name (const char *str) |
432 | { |
414 | { |
433 | shstr_cmp str_ (str); |
415 | shstr_cmp str_ (str); |
434 | object *op; |
416 | object *op; |
435 | |
417 | |
436 | for (op = object::first; op != NULL; op = op->next) |
418 | for_all_objects (op) |
437 | if (op->name == str_) |
419 | if (op->name == str_) |
438 | break; |
420 | break; |
439 | |
421 | |
440 | return op; |
422 | return op; |
441 | } |
423 | } |
… | |
… | |
484 | } |
466 | } |
485 | |
467 | |
486 | op->key_values = 0; |
468 | op->key_values = 0; |
487 | } |
469 | } |
488 | |
470 | |
489 | void object::clear () |
|
|
490 | { |
|
|
491 | attachable_base::clear (); |
|
|
492 | |
|
|
493 | free_key_values (this); |
|
|
494 | |
|
|
495 | owner = 0; |
|
|
496 | name = 0; |
|
|
497 | name_pl = 0; |
|
|
498 | title = 0; |
|
|
499 | race = 0; |
|
|
500 | slaying = 0; |
|
|
501 | skill = 0; |
|
|
502 | msg = 0; |
|
|
503 | lore = 0; |
|
|
504 | custom_name = 0; |
|
|
505 | materialname = 0; |
|
|
506 | contr = 0; |
|
|
507 | below = 0; |
|
|
508 | above = 0; |
|
|
509 | inv = 0; |
|
|
510 | container = 0; |
|
|
511 | env = 0; |
|
|
512 | more = 0; |
|
|
513 | head = 0; |
|
|
514 | map = 0; |
|
|
515 | active_next = 0; |
|
|
516 | active_prev = 0; |
|
|
517 | |
|
|
518 | memset (static_cast<object_pod *>(this), 0, sizeof (object_pod)); |
|
|
519 | |
|
|
520 | SET_FLAG (this, FLAG_REMOVED); |
|
|
521 | |
|
|
522 | /* What is not cleared is next, prev, and count */ |
|
|
523 | |
|
|
524 | expmul = 1.0; |
|
|
525 | face = blank_face; |
|
|
526 | |
|
|
527 | if (settings.casting_time) |
|
|
528 | casting_time = -1; |
|
|
529 | } |
|
|
530 | |
|
|
531 | void object::clone (object *destination) |
|
|
532 | { |
|
|
533 | *(object_copy *)destination = *this; |
|
|
534 | *(object_pod *)destination = *this; |
|
|
535 | |
|
|
536 | if (self || cb) |
|
|
537 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); |
|
|
538 | } |
|
|
539 | |
|
|
540 | /* |
471 | /* |
541 | * copy object first frees everything allocated by the second object, |
472 | * copy_to first frees everything allocated by the dst object, |
542 | * and then copies the contends of the first object into the second |
473 | * and then copies the contents of itself into the second |
543 | * object, allocating what needs to be allocated. Basically, any |
474 | * object, allocating what needs to be allocated. Basically, any |
544 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
475 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
545 | * if the first object is freed, the pointers in the new object |
476 | * if the first object is freed, the pointers in the new object |
546 | * will point at garbage. |
477 | * will point at garbage. |
547 | */ |
478 | */ |
548 | void |
479 | void |
549 | copy_object (object *op2, object *op) |
480 | object::copy_to (object *dst) |
550 | { |
481 | { |
551 | bool is_freed = QUERY_FLAG (op, FLAG_FREED); |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
552 | bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
553 | |
484 | |
554 | op2->clone (op); |
485 | *(object_copy *)dst = *this; |
555 | |
486 | |
556 | if (is_freed) |
487 | if (is_freed) |
557 | SET_FLAG (op, FLAG_FREED); |
488 | SET_FLAG (dst, FLAG_FREED); |
558 | |
489 | |
559 | if (is_removed) |
490 | if (is_removed) |
560 | SET_FLAG (op, FLAG_REMOVED); |
491 | SET_FLAG (dst, FLAG_REMOVED); |
561 | |
492 | |
562 | if (op2->speed < 0) |
493 | if (speed < 0) |
563 | op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0; |
494 | dst->speed_left = speed_left - rndm (); |
564 | |
495 | |
565 | /* Copy over key_values, if any. */ |
496 | /* Copy over key_values, if any. */ |
566 | if (op2->key_values) |
497 | if (key_values) |
567 | { |
498 | { |
568 | key_value *tail = 0; |
499 | key_value *tail = 0; |
569 | key_value *i; |
500 | key_value *i; |
570 | |
501 | |
571 | op->key_values = 0; |
502 | dst->key_values = 0; |
572 | |
503 | |
573 | for (i = op2->key_values; i; i = i->next) |
504 | for (i = key_values; i; i = i->next) |
574 | { |
505 | { |
575 | key_value *new_link = new key_value; |
506 | key_value *new_link = new key_value; |
576 | |
507 | |
577 | new_link->next = 0; |
508 | new_link->next = 0; |
578 | new_link->key = i->key; |
509 | new_link->key = i->key; |
579 | new_link->value = i->value; |
510 | new_link->value = i->value; |
580 | |
511 | |
581 | /* Try and be clever here, too. */ |
512 | /* Try and be clever here, too. */ |
582 | if (!op->key_values) |
513 | if (!dst->key_values) |
583 | { |
514 | { |
584 | op->key_values = new_link; |
515 | dst->key_values = new_link; |
585 | tail = new_link; |
516 | tail = new_link; |
586 | } |
517 | } |
587 | else |
518 | else |
588 | { |
519 | { |
589 | tail->next = new_link; |
520 | tail->next = new_link; |
590 | tail = new_link; |
521 | tail = new_link; |
591 | } |
522 | } |
592 | } |
523 | } |
593 | } |
524 | } |
594 | |
525 | |
595 | update_ob_speed (op); |
526 | dst->set_speed (dst->speed); |
|
|
527 | } |
|
|
528 | |
|
|
529 | object * |
|
|
530 | object::clone () |
|
|
531 | { |
|
|
532 | object *neu = create (); |
|
|
533 | copy_to (neu); |
|
|
534 | return neu; |
596 | } |
535 | } |
597 | |
536 | |
598 | /* |
537 | /* |
599 | * If an object with the IS_TURNABLE() flag needs to be turned due |
538 | * If an object with the IS_TURNABLE() flag needs to be turned due |
600 | * to the closest player being on the other side, this function can |
539 | * to the closest player being on the other side, this function can |
601 | * be called to update the face variable, _and_ how it looks on the map. |
540 | * be called to update the face variable, _and_ how it looks on the map. |
602 | */ |
541 | */ |
603 | |
|
|
604 | void |
542 | void |
605 | update_turn_face (object *op) |
543 | update_turn_face (object *op) |
606 | { |
544 | { |
607 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL) |
545 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
608 | return; |
546 | return; |
|
|
547 | |
609 | SET_ANIMATION (op, op->direction); |
548 | SET_ANIMATION (op, op->direction); |
610 | update_object (op, UP_OBJ_FACE); |
549 | update_object (op, UP_OBJ_FACE); |
611 | } |
550 | } |
612 | |
551 | |
613 | /* |
552 | /* |
614 | * Updates the speed of an object. If the speed changes from 0 to another |
553 | * Updates the speed of an object. If the speed changes from 0 to another |
615 | * value, or vice versa, then add/remove the object from the active list. |
554 | * value, or vice versa, then add/remove the object from the active list. |
616 | * This function needs to be called whenever the speed of an object changes. |
555 | * This function needs to be called whenever the speed of an object changes. |
617 | */ |
556 | */ |
618 | void |
557 | void |
619 | update_ob_speed (object *op) |
558 | object::set_speed (float speed) |
620 | { |
559 | { |
621 | extern int arch_init; |
560 | if (flag [FLAG_FREED] && speed) |
622 | |
|
|
623 | /* No reason putting the archetypes objects on the speed list, |
|
|
624 | * since they never really need to be updated. |
|
|
625 | */ |
|
|
626 | |
|
|
627 | if (QUERY_FLAG (op, FLAG_FREED) && op->speed) |
|
|
628 | { |
561 | { |
629 | LOG (llevError, "Object %s is freed but has speed.\n", &op->name); |
562 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
630 | #ifdef MANY_CORES |
|
|
631 | abort (); |
|
|
632 | #else |
|
|
633 | op->speed = 0; |
563 | speed = 0; |
634 | #endif |
|
|
635 | } |
|
|
636 | |
|
|
637 | if (arch_init) |
|
|
638 | return; |
|
|
639 | |
|
|
640 | if (FABS (op->speed) > MIN_ACTIVE_SPEED) |
|
|
641 | { |
564 | } |
642 | /* If already on active list, don't do anything */ |
|
|
643 | if (op->active_next || op->active_prev || op == active_objects) |
|
|
644 | return; |
|
|
645 | |
565 | |
646 | /* process_events() expects us to insert the object at the beginning |
566 | this->speed = speed; |
647 | * of the list. */ |
|
|
648 | op->active_next = active_objects; |
|
|
649 | |
567 | |
650 | if (op->active_next != NULL) |
568 | if (has_active_speed ()) |
651 | op->active_next->active_prev = op; |
569 | activate (); |
652 | |
|
|
653 | active_objects = op; |
|
|
654 | } |
|
|
655 | else |
570 | else |
656 | { |
571 | deactivate (); |
657 | /* If not on the active list, nothing needs to be done */ |
|
|
658 | if (!op->active_next && !op->active_prev && op != active_objects) |
|
|
659 | return; |
|
|
660 | |
|
|
661 | if (op->active_prev == NULL) |
|
|
662 | { |
|
|
663 | active_objects = op->active_next; |
|
|
664 | |
|
|
665 | if (op->active_next != NULL) |
|
|
666 | op->active_next->active_prev = NULL; |
|
|
667 | } |
|
|
668 | else |
|
|
669 | { |
|
|
670 | op->active_prev->active_next = op->active_next; |
|
|
671 | |
|
|
672 | if (op->active_next) |
|
|
673 | op->active_next->active_prev = op->active_prev; |
|
|
674 | } |
|
|
675 | |
|
|
676 | op->active_next = NULL; |
|
|
677 | op->active_prev = NULL; |
|
|
678 | } |
|
|
679 | } |
572 | } |
680 | |
573 | |
681 | /* This function removes object 'op' from the list of active |
|
|
682 | * objects. |
|
|
683 | * This should only be used for style maps or other such |
|
|
684 | * reference maps where you don't want an object that isn't |
|
|
685 | * in play chewing up cpu time getting processed. |
|
|
686 | * The reverse of this is to call update_ob_speed, which |
|
|
687 | * will do the right thing based on the speed of the object. |
|
|
688 | */ |
|
|
689 | void |
|
|
690 | remove_from_active_list (object *op) |
|
|
691 | { |
|
|
692 | /* If not on the active list, nothing needs to be done */ |
|
|
693 | if (!op->active_next && !op->active_prev && op != active_objects) |
|
|
694 | return; |
|
|
695 | |
|
|
696 | if (op->active_prev == NULL) |
|
|
697 | { |
|
|
698 | active_objects = op->active_next; |
|
|
699 | if (op->active_next != NULL) |
|
|
700 | op->active_next->active_prev = NULL; |
|
|
701 | } |
|
|
702 | else |
|
|
703 | { |
|
|
704 | op->active_prev->active_next = op->active_next; |
|
|
705 | if (op->active_next) |
|
|
706 | op->active_next->active_prev = op->active_prev; |
|
|
707 | } |
|
|
708 | op->active_next = NULL; |
|
|
709 | op->active_prev = NULL; |
|
|
710 | } |
|
|
711 | |
|
|
712 | /* |
574 | /* |
713 | * update_object() updates the array which represents the map. |
575 | * update_object() updates the the map. |
714 | * It takes into account invisible objects (and represent squares covered |
576 | * It takes into account invisible objects (and represent squares covered |
715 | * by invisible objects by whatever is below them (unless it's another |
577 | * by invisible objects by whatever is below them (unless it's another |
716 | * invisible object, etc...) |
578 | * invisible object, etc...) |
717 | * If the object being updated is beneath a player, the look-window |
579 | * If the object being updated is beneath a player, the look-window |
718 | * of that player is updated (this might be a suboptimal way of |
580 | * of that player is updated (this might be a suboptimal way of |
719 | * updating that window, though, since update_object() is called _often_) |
581 | * updating that window, though, since update_object() is called _often_) |
720 | * |
582 | * |
721 | * action is a hint of what the caller believes need to be done. |
583 | * action is a hint of what the caller believes need to be done. |
722 | * For example, if the only thing that has changed is the face (due to |
|
|
723 | * an animation), we don't need to call update_position until that actually |
|
|
724 | * comes into view of a player. OTOH, many other things, like addition/removal |
|
|
725 | * of walls or living creatures may need us to update the flags now. |
|
|
726 | * current action are: |
584 | * current action are: |
727 | * UP_OBJ_INSERT: op was inserted |
585 | * UP_OBJ_INSERT: op was inserted |
728 | * UP_OBJ_REMOVE: op was removed |
586 | * UP_OBJ_REMOVE: op was removed |
729 | * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update |
587 | * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update |
730 | * as that is easier than trying to look at what may have changed. |
588 | * as that is easier than trying to look at what may have changed. |
731 | * UP_OBJ_FACE: only the objects face has changed. |
589 | * UP_OBJ_FACE: only the objects face has changed. |
732 | */ |
590 | */ |
733 | |
|
|
734 | void |
591 | void |
735 | update_object (object *op, int action) |
592 | update_object (object *op, int action) |
736 | { |
593 | { |
737 | int update_now = 0, flags; |
|
|
738 | MoveType move_on, move_off, move_block, move_slow; |
594 | MoveType move_on, move_off, move_block, move_slow; |
739 | |
595 | |
740 | if (op == NULL) |
596 | if (op == NULL) |
741 | { |
597 | { |
742 | /* this should never happen */ |
598 | /* this should never happen */ |
743 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
599 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
744 | return; |
600 | return; |
745 | } |
601 | } |
746 | |
602 | |
747 | if (op->env != NULL) |
603 | if (op->env) |
748 | { |
604 | { |
749 | /* Animation is currently handled by client, so nothing |
605 | /* Animation is currently handled by client, so nothing |
750 | * to do in this case. |
606 | * to do in this case. |
751 | */ |
607 | */ |
752 | return; |
608 | return; |
… | |
… | |
757 | */ |
613 | */ |
758 | if (!op->map || op->map->in_memory == MAP_SAVING) |
614 | if (!op->map || op->map->in_memory == MAP_SAVING) |
759 | return; |
615 | return; |
760 | |
616 | |
761 | /* make sure the object is within map boundaries */ |
617 | /* make sure the object is within map boundaries */ |
762 | if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map)) |
618 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
763 | { |
619 | { |
764 | LOG (llevError, "update_object() called for object out of map!\n"); |
620 | LOG (llevError, "update_object() called for object out of map!\n"); |
765 | #ifdef MANY_CORES |
621 | #ifdef MANY_CORES |
766 | abort (); |
622 | abort (); |
767 | #endif |
623 | #endif |
768 | return; |
624 | return; |
769 | } |
625 | } |
770 | |
626 | |
771 | flags = GET_MAP_FLAGS (op->map, op->x, op->y); |
627 | mapspace &m = op->ms (); |
772 | SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE); |
|
|
773 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
|
|
774 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
|
|
775 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
|
|
776 | move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y); |
|
|
777 | |
628 | |
|
|
629 | if (!(m.flags_ & P_UPTODATE)) |
|
|
630 | /* nop */; |
778 | if (action == UP_OBJ_INSERT) |
631 | else if (action == UP_OBJ_INSERT) |
779 | { |
632 | { |
|
|
633 | // this is likely overkill, TODO: revisit (schmorp) |
780 | if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW)) |
634 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
781 | update_now = 1; |
|
|
782 | |
|
|
783 | if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC)) |
635 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
784 | update_now = 1; |
636 | || (op->type == PLAYER && !(m.flags_ & P_PLAYER)) |
785 | |
637 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
|
|
638 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
786 | if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC)) |
639 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
787 | update_now = 1; |
|
|
788 | |
|
|
789 | if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE)) |
|
|
790 | update_now = 1; |
|
|
791 | |
|
|
792 | if (op->type == SAFE_GROUND && !(flags & P_SAFE)) |
|
|
793 | update_now = 1; |
|
|
794 | |
|
|
795 | if ((move_on | op->move_on) != move_on) |
640 | || (m.move_on | op->move_on ) != m.move_on |
796 | update_now = 1; |
|
|
797 | |
|
|
798 | if ((move_off | op->move_off) != move_off) |
641 | || (m.move_off | op->move_off ) != m.move_off |
799 | update_now = 1; |
642 | || (m.move_slow | op->move_slow) != m.move_slow |
800 | |
|
|
801 | /* This isn't perfect, but I don't expect a lot of objects to |
643 | /* This isn't perfect, but I don't expect a lot of objects to |
802 | * to have move_allow right now. |
644 | * to have move_allow right now. |
803 | */ |
645 | */ |
804 | if (((move_block | op->move_block) & ~op->move_allow) != move_block) |
646 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
805 | update_now = 1; |
647 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
806 | |
648 | m.flags_ = 0; |
807 | if ((move_slow | op->move_slow) != move_slow) |
|
|
808 | update_now = 1; |
|
|
809 | } |
649 | } |
810 | |
|
|
811 | /* if the object is being removed, we can't make intelligent |
650 | /* if the object is being removed, we can't make intelligent |
812 | * decisions, because remove_ob can't really pass the object |
651 | * decisions, because remove_ob can't really pass the object |
813 | * that is being removed. |
652 | * that is being removed. |
814 | */ |
653 | */ |
815 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
654 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
816 | update_now = 1; |
655 | m.flags_ = 0; |
817 | else if (action == UP_OBJ_FACE) |
656 | else if (action == UP_OBJ_FACE) |
818 | /* Nothing to do for that case */ ; |
657 | /* Nothing to do for that case */ ; |
819 | else |
658 | else |
820 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
659 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
821 | |
660 | |
822 | if (update_now) |
|
|
823 | { |
|
|
824 | SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE); |
|
|
825 | update_position (op->map, op->x, op->y); |
|
|
826 | } |
|
|
827 | |
|
|
828 | if (op->more != NULL) |
661 | if (op->more) |
829 | update_object (op->more, action); |
662 | update_object (op->more, action); |
830 | } |
|
|
831 | |
|
|
832 | object::vector object::mortals; |
|
|
833 | object::vector object::objects; // not yet used |
|
|
834 | object *object::first; |
|
|
835 | |
|
|
836 | void object::free_mortals () |
|
|
837 | { |
|
|
838 | for (AUTODECL (i, mortals.begin ()); i != mortals.end ();) |
|
|
839 | if ((*i)->refcnt) |
|
|
840 | ++i; // further delay freeing |
|
|
841 | else |
|
|
842 | { |
|
|
843 | delete *i; |
|
|
844 | mortals.erase (i); |
|
|
845 | } |
|
|
846 | } |
663 | } |
847 | |
664 | |
848 | object::object () |
665 | object::object () |
849 | { |
666 | { |
850 | SET_FLAG (this, FLAG_REMOVED); |
667 | SET_FLAG (this, FLAG_REMOVED); |
… | |
… | |
853 | face = blank_face; |
670 | face = blank_face; |
854 | } |
671 | } |
855 | |
672 | |
856 | object::~object () |
673 | object::~object () |
857 | { |
674 | { |
|
|
675 | unlink (); |
|
|
676 | |
858 | free_key_values (this); |
677 | free_key_values (this); |
859 | } |
678 | } |
860 | |
679 | |
|
|
680 | static int object_count; |
|
|
681 | |
861 | void object::link () |
682 | void object::link () |
862 | { |
683 | { |
863 | count = ++ob_count; |
684 | assert (!index);//D |
864 | uuid = gen_uuid (); |
685 | uuid = gen_uuid (); |
|
|
686 | count = ++object_count; |
865 | |
687 | |
866 | prev = 0; |
688 | refcnt_inc (); |
867 | next = object::first; |
689 | objects.insert (this); |
868 | |
|
|
869 | if (object::first) |
|
|
870 | object::first->prev = this; |
|
|
871 | |
|
|
872 | object::first = this; |
|
|
873 | } |
690 | } |
874 | |
691 | |
875 | void object::unlink () |
692 | void object::unlink () |
876 | { |
693 | { |
877 | if (this == object::first) |
694 | if (!index) |
878 | object::first = next; |
695 | return; |
879 | |
696 | |
880 | /* Remove this object from the list of used objects */ |
697 | objects.erase (this); |
881 | if (prev) prev->next = next; |
698 | refcnt_dec (); |
882 | if (next) next->prev = prev; |
699 | } |
883 | |
700 | |
884 | prev = 0; |
701 | void |
885 | next = 0; |
702 | object::activate () |
|
|
703 | { |
|
|
704 | /* If already on active list, don't do anything */ |
|
|
705 | if (active) |
|
|
706 | return; |
|
|
707 | |
|
|
708 | if (has_active_speed ()) |
|
|
709 | actives.insert (this); |
|
|
710 | } |
|
|
711 | |
|
|
712 | void |
|
|
713 | object::activate_recursive () |
|
|
714 | { |
|
|
715 | activate (); |
|
|
716 | |
|
|
717 | for (object *op = inv; op; op = op->below) |
|
|
718 | op->activate_recursive (); |
|
|
719 | } |
|
|
720 | |
|
|
721 | /* This function removes object 'op' from the list of active |
|
|
722 | * objects. |
|
|
723 | * This should only be used for style maps or other such |
|
|
724 | * reference maps where you don't want an object that isn't |
|
|
725 | * in play chewing up cpu time getting processed. |
|
|
726 | * The reverse of this is to call update_ob_speed, which |
|
|
727 | * will do the right thing based on the speed of the object. |
|
|
728 | */ |
|
|
729 | void |
|
|
730 | object::deactivate () |
|
|
731 | { |
|
|
732 | /* If not on the active list, nothing needs to be done */ |
|
|
733 | if (!active) |
|
|
734 | return; |
|
|
735 | |
|
|
736 | actives.erase (this); |
|
|
737 | } |
|
|
738 | |
|
|
739 | void |
|
|
740 | object::deactivate_recursive () |
|
|
741 | { |
|
|
742 | for (object *op = inv; op; op = op->below) |
|
|
743 | op->deactivate_recursive (); |
|
|
744 | |
|
|
745 | deactivate (); |
|
|
746 | } |
|
|
747 | |
|
|
748 | void |
|
|
749 | object::set_flag_inv (int flag, int value) |
|
|
750 | { |
|
|
751 | for (object *op = inv; op; op = op->below) |
|
|
752 | { |
|
|
753 | op->flag [flag] = value; |
|
|
754 | op->set_flag_inv (flag, value); |
|
|
755 | } |
|
|
756 | } |
|
|
757 | |
|
|
758 | /* |
|
|
759 | * Remove and free all objects in the inventory of the given object. |
|
|
760 | * object.c ? |
|
|
761 | */ |
|
|
762 | void |
|
|
763 | object::destroy_inv (bool drop_to_ground) |
|
|
764 | { |
|
|
765 | // need to check first, because the checks below might segfault |
|
|
766 | // as we might be on an invalid mapspace and crossfire code |
|
|
767 | // is too buggy to ensure that the inventory is empty. |
|
|
768 | // corollary: if you create arrows etc. with stuff in tis inventory, |
|
|
769 | // cf will crash below with off-map x and y |
|
|
770 | if (!inv) |
|
|
771 | return; |
|
|
772 | |
|
|
773 | /* Only if the space blocks everything do we not process - |
|
|
774 | * if some form of movement is allowed, let objects |
|
|
775 | * drop on that space. |
|
|
776 | */ |
|
|
777 | if (!drop_to_ground |
|
|
778 | || !map |
|
|
779 | || map->in_memory != MAP_IN_MEMORY |
|
|
780 | || map->nodrop |
|
|
781 | || ms ().move_block == MOVE_ALL) |
|
|
782 | { |
|
|
783 | while (inv) |
|
|
784 | { |
|
|
785 | inv->destroy_inv (drop_to_ground); |
|
|
786 | inv->destroy (); |
|
|
787 | } |
|
|
788 | } |
|
|
789 | else |
|
|
790 | { /* Put objects in inventory onto this space */ |
|
|
791 | while (inv) |
|
|
792 | { |
|
|
793 | object *op = inv; |
|
|
794 | |
|
|
795 | if (op->flag [FLAG_STARTEQUIP] |
|
|
796 | || op->flag [FLAG_NO_DROP] |
|
|
797 | || op->type == RUNE |
|
|
798 | || op->type == TRAP |
|
|
799 | || op->flag [FLAG_IS_A_TEMPLATE] |
|
|
800 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
|
|
801 | op->destroy (); |
|
|
802 | else |
|
|
803 | map->insert (op, x, y); |
|
|
804 | } |
|
|
805 | } |
886 | } |
806 | } |
887 | |
807 | |
888 | object *object::create () |
808 | object *object::create () |
889 | { |
809 | { |
890 | object *op = new object; |
810 | object *op = new object; |
891 | op->link (); |
811 | op->link (); |
892 | return op; |
812 | return op; |
893 | } |
813 | } |
894 | |
814 | |
895 | /* |
815 | void |
896 | * free_object() frees everything allocated by an object, removes |
816 | object::do_destroy () |
897 | * it from the list of used objects, and puts it on the list of |
|
|
898 | * free objects. The IS_FREED() flag is set in the object. |
|
|
899 | * The object must have been removed by remove_ob() first for |
|
|
900 | * this function to succeed. |
|
|
901 | * |
|
|
902 | * If destroy_inventory is set, free inventory as well. Else drop items in |
|
|
903 | * inventory to the ground. |
|
|
904 | */ |
|
|
905 | void object::destroy (bool destroy_inventory) |
|
|
906 | { |
817 | { |
907 | if (QUERY_FLAG (this, FLAG_FREED)) |
818 | attachable::do_destroy (); |
908 | return; |
|
|
909 | |
819 | |
910 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
820 | if (flag [FLAG_IS_LINKED]) |
|
|
821 | remove_button_link (this); |
|
|
822 | |
|
|
823 | if (flag [FLAG_FRIENDLY]) |
911 | remove_friendly_object (this); |
824 | remove_friendly_object (this); |
912 | |
825 | |
913 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
826 | if (!flag [FLAG_REMOVED]) |
914 | remove (); |
827 | remove (); |
915 | |
828 | |
916 | SET_FLAG (this, FLAG_FREED); |
829 | destroy_inv (true); |
917 | |
830 | |
918 | if (more) |
831 | deactivate (); |
919 | { |
832 | unlink (); |
920 | more->destroy (destroy_inventory); |
|
|
921 | more = 0; |
|
|
922 | } |
|
|
923 | |
833 | |
924 | if (inv) |
834 | flag [FLAG_FREED] = 1; |
925 | { |
|
|
926 | /* Only if the space blocks everything do we not process - |
|
|
927 | * if some form of movement is allowed, let objects |
|
|
928 | * drop on that space. |
|
|
929 | */ |
|
|
930 | if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
|
|
931 | { |
|
|
932 | object *op = inv; |
|
|
933 | |
|
|
934 | while (op) |
|
|
935 | { |
|
|
936 | object *tmp = op->below; |
|
|
937 | op->destroy (destroy_inventory); |
|
|
938 | op = tmp; |
|
|
939 | } |
|
|
940 | } |
|
|
941 | else |
|
|
942 | { /* Put objects in inventory onto this space */ |
|
|
943 | object *op = inv; |
|
|
944 | |
|
|
945 | while (op) |
|
|
946 | { |
|
|
947 | object *tmp = op->below; |
|
|
948 | |
|
|
949 | op->remove (); |
|
|
950 | |
|
|
951 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
|
|
952 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
|
|
953 | op->destroy (0); |
|
|
954 | else |
|
|
955 | { |
|
|
956 | op->x = x; |
|
|
957 | op->y = y; |
|
|
958 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
|
|
959 | } |
|
|
960 | |
|
|
961 | op = tmp; |
|
|
962 | } |
|
|
963 | } |
|
|
964 | } |
|
|
965 | |
835 | |
966 | // hack to ensure that freed objects still have a valid map |
836 | // hack to ensure that freed objects still have a valid map |
967 | { |
837 | { |
968 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
838 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
969 | |
839 | |
… | |
… | |
973 | |
843 | |
974 | freed_map->name = "/internal/freed_objects_map"; |
844 | freed_map->name = "/internal/freed_objects_map"; |
975 | freed_map->width = 3; |
845 | freed_map->width = 3; |
976 | freed_map->height = 3; |
846 | freed_map->height = 3; |
977 | |
847 | |
978 | freed_map->allocate (); |
848 | freed_map->alloc (); |
|
|
849 | freed_map->in_memory = MAP_IN_MEMORY; |
979 | } |
850 | } |
980 | |
851 | |
981 | map = freed_map; |
852 | map = freed_map; |
982 | x = 1; |
853 | x = 1; |
983 | y = 1; |
854 | y = 1; |
984 | } |
855 | } |
985 | |
856 | |
|
|
857 | head = 0; |
|
|
858 | |
|
|
859 | if (more) |
|
|
860 | { |
|
|
861 | more->destroy (); |
|
|
862 | more = 0; |
|
|
863 | } |
|
|
864 | |
986 | // clear those pointers that likely might have circular references to us |
865 | // clear those pointers that likely might have circular references to us |
987 | owner = 0; |
866 | owner = 0; |
988 | enemy = 0; |
867 | enemy = 0; |
989 | attacked_by = 0; |
868 | attacked_by = 0; |
|
|
869 | } |
990 | |
870 | |
991 | // only relevant for players(?), but make sure of it anyways |
871 | void |
992 | contr = 0; |
872 | object::destroy (bool destroy_inventory) |
|
|
873 | { |
|
|
874 | if (destroyed ()) |
|
|
875 | return; |
993 | |
876 | |
994 | /* Remove object from the active list */ |
877 | if (destroy_inventory) |
995 | speed = 0; |
878 | destroy_inv (false); |
996 | update_ob_speed (this); |
|
|
997 | |
879 | |
998 | unlink (); |
880 | attachable::destroy (); |
999 | |
|
|
1000 | mortals.push_back (this); |
|
|
1001 | } |
881 | } |
1002 | |
882 | |
1003 | /* |
883 | /* |
1004 | * sub_weight() recursively (outwards) subtracts a number from the |
884 | * sub_weight() recursively (outwards) subtracts a number from the |
1005 | * weight of an object (and what is carried by it's environment(s)). |
885 | * weight of an object (and what is carried by it's environment(s)). |
… | |
… | |
1024 | * environment, the x and y coordinates will be updated to |
904 | * environment, the x and y coordinates will be updated to |
1025 | * the previous environment. |
905 | * the previous environment. |
1026 | * Beware: This function is called from the editor as well! |
906 | * Beware: This function is called from the editor as well! |
1027 | */ |
907 | */ |
1028 | void |
908 | void |
1029 | object::remove () |
909 | object::remove_slow () |
1030 | { |
910 | { |
1031 | object *tmp, *last = 0; |
911 | object *tmp, *last = 0; |
1032 | object *otmp; |
912 | object *otmp; |
1033 | |
913 | |
1034 | int check_walk_off; |
|
|
1035 | |
|
|
1036 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
914 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1037 | return; |
915 | return; |
1038 | |
916 | |
1039 | SET_FLAG (this, FLAG_REMOVED); |
917 | SET_FLAG (this, FLAG_REMOVED); |
|
|
918 | INVOKE_OBJECT (REMOVE, this); |
1040 | |
919 | |
1041 | if (more) |
920 | if (more) |
1042 | more->remove (); |
921 | more->remove (); |
1043 | |
922 | |
1044 | /* |
923 | /* |
… | |
… | |
1054 | |
933 | |
1055 | /* NO_FIX_PLAYER is set when a great many changes are being |
934 | /* NO_FIX_PLAYER is set when a great many changes are being |
1056 | * made to players inventory. If set, avoiding the call |
935 | * made to players inventory. If set, avoiding the call |
1057 | * to save cpu time. |
936 | * to save cpu time. |
1058 | */ |
937 | */ |
1059 | if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
938 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1060 | fix_player (otmp); |
939 | otmp->update_stats (); |
1061 | |
940 | |
1062 | if (above != NULL) |
941 | if (above) |
1063 | above->below = below; |
942 | above->below = below; |
1064 | else |
943 | else |
1065 | env->inv = below; |
944 | env->inv = below; |
1066 | |
945 | |
1067 | if (below != NULL) |
946 | if (below) |
1068 | below->above = above; |
947 | below->above = above; |
1069 | |
948 | |
1070 | /* we set up values so that it could be inserted into |
949 | /* we set up values so that it could be inserted into |
1071 | * the map, but we don't actually do that - it is up |
950 | * the map, but we don't actually do that - it is up |
1072 | * to the caller to decide what we want to do. |
951 | * to the caller to decide what we want to do. |
… | |
… | |
1076 | above = 0, below = 0; |
955 | above = 0, below = 0; |
1077 | env = 0; |
956 | env = 0; |
1078 | } |
957 | } |
1079 | else if (map) |
958 | else if (map) |
1080 | { |
959 | { |
1081 | /* Re did the following section of code - it looks like it had |
960 | if (type == PLAYER) |
1082 | * lots of logic for things we no longer care about |
|
|
1083 | */ |
961 | { |
|
|
962 | --map->players; |
|
|
963 | map->touch (); |
|
|
964 | } |
|
|
965 | |
|
|
966 | map->dirty = true; |
|
|
967 | mapspace &ms = this->ms (); |
1084 | |
968 | |
1085 | /* link the object above us */ |
969 | /* link the object above us */ |
1086 | if (above) |
970 | if (above) |
1087 | above->below = below; |
971 | above->below = below; |
1088 | else |
972 | else |
1089 | SET_MAP_TOP (map, x, y, below); /* we were top, set new top */ |
973 | ms.top = below; /* we were top, set new top */ |
1090 | |
974 | |
1091 | /* Relink the object below us, if there is one */ |
975 | /* Relink the object below us, if there is one */ |
1092 | if (below) |
976 | if (below) |
1093 | below->above = above; |
977 | below->above = above; |
1094 | else |
978 | else |
… | |
… | |
1096 | /* Nothing below, which means we need to relink map object for this space |
980 | /* Nothing below, which means we need to relink map object for this space |
1097 | * use translated coordinates in case some oddness with map tiling is |
981 | * use translated coordinates in case some oddness with map tiling is |
1098 | * evident |
982 | * evident |
1099 | */ |
983 | */ |
1100 | if (GET_MAP_OB (map, x, y) != this) |
984 | if (GET_MAP_OB (map, x, y) != this) |
1101 | { |
|
|
1102 | char *dump = dump_object (this); |
|
|
1103 | LOG (llevError, |
|
|
1104 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump); |
985 | LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ()); |
1105 | free (dump); |
|
|
1106 | dump = dump_object (GET_MAP_OB (map, x, y)); |
|
|
1107 | LOG (llevError, "%s\n", dump); |
|
|
1108 | free (dump); |
|
|
1109 | } |
|
|
1110 | |
986 | |
1111 | SET_MAP_OB (map, x, y, above); /* goes on above it. */ |
987 | ms.bot = above; /* goes on above it. */ |
1112 | } |
988 | } |
1113 | |
989 | |
1114 | above = 0; |
990 | above = 0; |
1115 | below = 0; |
991 | below = 0; |
1116 | |
992 | |
1117 | if (map->in_memory == MAP_SAVING) |
993 | if (map->in_memory == MAP_SAVING) |
1118 | return; |
994 | return; |
1119 | |
995 | |
1120 | check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY); |
996 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1121 | |
997 | |
1122 | for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above) |
998 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1123 | { |
999 | { |
1124 | /* No point updating the players look faces if he is the object |
1000 | /* No point updating the players look faces if he is the object |
1125 | * being removed. |
1001 | * being removed. |
1126 | */ |
1002 | */ |
1127 | |
1003 | |
… | |
… | |
1131 | * removed (most likely destroyed), update the player view |
1007 | * removed (most likely destroyed), update the player view |
1132 | * appropriately. |
1008 | * appropriately. |
1133 | */ |
1009 | */ |
1134 | if (tmp->container == this) |
1010 | if (tmp->container == this) |
1135 | { |
1011 | { |
1136 | CLEAR_FLAG (this, FLAG_APPLIED); |
1012 | flag [FLAG_APPLIED] = 0; |
1137 | tmp->container = 0; |
1013 | tmp->container = 0; |
1138 | } |
1014 | } |
1139 | |
1015 | |
1140 | tmp->contr->socket.update_look = 1; |
1016 | if (tmp->contr->ns) |
|
|
1017 | tmp->contr->ns->floorbox_update (); |
1141 | } |
1018 | } |
1142 | |
1019 | |
1143 | /* See if player moving off should effect something */ |
1020 | /* See if object moving off should effect something */ |
1144 | if (check_walk_off |
1021 | if (check_walk_off |
1145 | && ((move_type & tmp->move_off) |
1022 | && ((move_type & tmp->move_off) |
1146 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1023 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1147 | { |
1024 | { |
1148 | move_apply (tmp, this, 0); |
1025 | move_apply (tmp, this, 0); |
… | |
… | |
1150 | if (destroyed ()) |
1027 | if (destroyed ()) |
1151 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1028 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1152 | } |
1029 | } |
1153 | |
1030 | |
1154 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1031 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1155 | |
1032 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
1156 | if (tmp->above == tmp) |
1033 | if (tmp->above == tmp) |
1157 | tmp->above = 0; |
1034 | tmp->above = 0; |
1158 | |
1035 | |
1159 | last = tmp; |
1036 | last = tmp; |
1160 | } |
1037 | } |
1161 | |
1038 | |
1162 | /* last == NULL of there are no objects on this space */ |
1039 | /* last == NULL if there are no objects on this space */ |
|
|
1040 | //TODO: this makes little sense, why only update the topmost object? |
1163 | if (!last) |
1041 | if (!last) |
1164 | { |
1042 | map->at (x, y).flags_ = 0; |
1165 | /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, |
|
|
1166 | * we could preserve the flags (GET_MAP_FLAGS), but update_position figures |
|
|
1167 | * those out anyways, and if there are any flags set right now, they won't |
|
|
1168 | * be correct anyways. |
|
|
1169 | */ |
|
|
1170 | SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE); |
|
|
1171 | update_position (map, x, y); |
|
|
1172 | } |
|
|
1173 | else |
1043 | else |
1174 | update_object (last, UP_OBJ_REMOVE); |
1044 | update_object (last, UP_OBJ_REMOVE); |
1175 | |
1045 | |
1176 | if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius) |
1046 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1177 | update_all_los (map, x, y); |
1047 | update_all_los (map, x, y); |
1178 | } |
1048 | } |
1179 | } |
1049 | } |
1180 | |
1050 | |
1181 | /* |
1051 | /* |
… | |
… | |
1190 | merge_ob (object *op, object *top) |
1060 | merge_ob (object *op, object *top) |
1191 | { |
1061 | { |
1192 | if (!op->nrof) |
1062 | if (!op->nrof) |
1193 | return 0; |
1063 | return 0; |
1194 | |
1064 | |
1195 | if (top == NULL) |
1065 | if (top) |
1196 | for (top = op; top != NULL && top->above != NULL; top = top->above); |
1066 | for (top = op; top && top->above; top = top->above) |
|
|
1067 | ; |
1197 | |
1068 | |
1198 | for (; top != NULL; top = top->below) |
1069 | for (; top; top = top->below) |
1199 | { |
1070 | { |
1200 | if (top == op) |
1071 | if (top == op) |
1201 | continue; |
1072 | continue; |
1202 | if (CAN_MERGE (op, top)) |
1073 | |
|
|
1074 | if (object::can_merge (op, top)) |
1203 | { |
1075 | { |
1204 | top->nrof += op->nrof; |
1076 | top->nrof += op->nrof; |
1205 | |
1077 | |
1206 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1078 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1207 | op->weight = 0; /* Don't want any adjustements now */ |
1079 | op->weight = 0; /* Don't want any adjustements now */ |
1208 | op->remove (); |
|
|
1209 | op->destroy (0); |
1080 | op->destroy (); |
1210 | return top; |
1081 | return top; |
1211 | } |
1082 | } |
1212 | } |
1083 | } |
1213 | |
1084 | |
1214 | return 0; |
1085 | return 0; |
1215 | } |
1086 | } |
1216 | |
1087 | |
1217 | /* |
1088 | /* |
1218 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1089 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1219 | * job preparing multi-part monsters |
1090 | * job preparing multi-part monsters. |
1220 | */ |
1091 | */ |
1221 | object * |
1092 | object * |
1222 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1093 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1223 | { |
1094 | { |
1224 | object *tmp; |
|
|
1225 | |
|
|
1226 | if (op->head) |
|
|
1227 | op = op->head; |
|
|
1228 | |
|
|
1229 | for (tmp = op; tmp; tmp = tmp->more) |
1095 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1230 | { |
1096 | { |
1231 | tmp->x = x + tmp->arch->clone.x; |
1097 | tmp->x = x + tmp->arch->clone.x; |
1232 | tmp->y = y + tmp->arch->clone.y; |
1098 | tmp->y = y + tmp->arch->clone.y; |
1233 | } |
1099 | } |
1234 | |
1100 | |
… | |
… | |
1253 | * Return value: |
1119 | * Return value: |
1254 | * new object if 'op' was merged with other object |
1120 | * new object if 'op' was merged with other object |
1255 | * NULL if 'op' was destroyed |
1121 | * NULL if 'op' was destroyed |
1256 | * just 'op' otherwise |
1122 | * just 'op' otherwise |
1257 | */ |
1123 | */ |
1258 | |
|
|
1259 | object * |
1124 | object * |
1260 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1125 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1261 | { |
1126 | { |
1262 | object *tmp, *top, *floor = NULL; |
1127 | object *tmp, *top, *floor = NULL; |
1263 | sint16 x, y; |
|
|
1264 | |
1128 | |
1265 | if (QUERY_FLAG (op, FLAG_FREED)) |
1129 | if (QUERY_FLAG (op, FLAG_FREED)) |
1266 | { |
1130 | { |
1267 | LOG (llevError, "Trying to insert freed object!\n"); |
1131 | LOG (llevError, "Trying to insert freed object!\n"); |
1268 | return NULL; |
1132 | return NULL; |
1269 | } |
1133 | } |
1270 | |
1134 | |
1271 | if (m == NULL) |
1135 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1136 | LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ()); |
|
|
1137 | |
|
|
1138 | op->remove (); |
|
|
1139 | |
|
|
1140 | if (!m) |
1272 | { |
1141 | { |
1273 | char *dump = dump_object (op); |
1142 | char *dump = dump_object (op); |
1274 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1143 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1275 | free (dump); |
1144 | free (dump); |
1276 | return op; |
1145 | return op; |
… | |
… | |
1289 | #endif |
1158 | #endif |
1290 | free (dump); |
1159 | free (dump); |
1291 | return op; |
1160 | return op; |
1292 | } |
1161 | } |
1293 | |
1162 | |
1294 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1295 | { |
|
|
1296 | char *dump = dump_object (op); |
|
|
1297 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1298 | free (dump); |
|
|
1299 | return op; |
|
|
1300 | } |
|
|
1301 | |
|
|
1302 | if (op->more != NULL) |
|
|
1303 | { |
|
|
1304 | /* The part may be on a different map. */ |
|
|
1305 | |
|
|
1306 | object *more = op->more; |
1163 | if (object *more = op->more) |
1307 | |
1164 | { |
1308 | /* We really need the caller to normalize coordinates - if |
|
|
1309 | * we set the map, that doesn't work if the location is within |
|
|
1310 | * a map and this is straddling an edge. So only if coordinate |
|
|
1311 | * is clear wrong do we normalize it. |
|
|
1312 | */ |
|
|
1313 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
|
|
1314 | more->map = get_map_from_coord (m, &more->x, &more->y); |
|
|
1315 | else if (!more->map) |
|
|
1316 | { |
|
|
1317 | /* For backwards compatibility - when not dealing with tiled maps, |
|
|
1318 | * more->map should always point to the parent. |
|
|
1319 | */ |
|
|
1320 | more->map = m; |
|
|
1321 | } |
|
|
1322 | |
|
|
1323 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
1165 | if (!insert_ob_in_map (more, m, originator, flag)) |
1324 | { |
1166 | { |
1325 | if (!op->head) |
1167 | if (!op->head) |
1326 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1168 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1327 | |
1169 | |
1328 | return NULL; |
1170 | return 0; |
1329 | } |
1171 | } |
1330 | } |
1172 | } |
1331 | |
1173 | |
1332 | CLEAR_FLAG (op, FLAG_REMOVED); |
1174 | CLEAR_FLAG (op, FLAG_REMOVED); |
1333 | |
1175 | |
1334 | /* Ideally, the caller figures this out. However, it complicates a lot |
1176 | /* Ideally, the caller figures this out. However, it complicates a lot |
1335 | * of areas of callers (eg, anything that uses find_free_spot would now |
1177 | * of areas of callers (eg, anything that uses find_free_spot would now |
1336 | * need extra work |
1178 | * need extra work |
1337 | */ |
1179 | */ |
1338 | op->map = get_map_from_coord (m, &op->x, &op->y); |
1180 | if (!xy_normalise (m, op->x, op->y)) |
1339 | x = op->x; |
1181 | return 0; |
1340 | y = op->y; |
1182 | |
|
|
1183 | op->map = m; |
|
|
1184 | mapspace &ms = op->ms (); |
1341 | |
1185 | |
1342 | /* this has to be done after we translate the coordinates. |
1186 | /* this has to be done after we translate the coordinates. |
1343 | */ |
1187 | */ |
1344 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1188 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1345 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1189 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1346 | if (CAN_MERGE (op, tmp)) |
1190 | if (object::can_merge (op, tmp)) |
1347 | { |
1191 | { |
1348 | op->nrof += tmp->nrof; |
1192 | op->nrof += tmp->nrof; |
1349 | tmp->remove (); |
|
|
1350 | tmp->destroy (0); |
1193 | tmp->destroy (); |
1351 | } |
1194 | } |
1352 | |
1195 | |
1353 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1196 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1354 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1197 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1355 | |
1198 | |
… | |
… | |
1368 | op->below = originator->below; |
1211 | op->below = originator->below; |
1369 | |
1212 | |
1370 | if (op->below) |
1213 | if (op->below) |
1371 | op->below->above = op; |
1214 | op->below->above = op; |
1372 | else |
1215 | else |
1373 | SET_MAP_OB (op->map, op->x, op->y, op); |
1216 | ms.bot = op; |
1374 | |
1217 | |
1375 | /* since *below* originator, no need to update top */ |
1218 | /* since *below* originator, no need to update top */ |
1376 | originator->below = op; |
1219 | originator->below = op; |
1377 | } |
1220 | } |
1378 | else |
1221 | else |
1379 | { |
1222 | { |
|
|
1223 | top = ms.bot; |
|
|
1224 | |
1380 | /* If there are other objects, then */ |
1225 | /* If there are other objects, then */ |
1381 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1226 | if ((!(flag & INS_MAP_LOAD)) && top) |
1382 | { |
1227 | { |
1383 | object *last = NULL; |
1228 | object *last = 0; |
1384 | |
1229 | |
1385 | /* |
1230 | /* |
1386 | * If there are multiple objects on this space, we do some trickier handling. |
1231 | * If there are multiple objects on this space, we do some trickier handling. |
1387 | * We've already dealt with merging if appropriate. |
1232 | * We've already dealt with merging if appropriate. |
1388 | * Generally, we want to put the new object on top. But if |
1233 | * Generally, we want to put the new object on top. But if |
… | |
… | |
1392 | * once we get to them. This reduces the need to traverse over all of |
1237 | * once we get to them. This reduces the need to traverse over all of |
1393 | * them when adding another one - this saves quite a bit of cpu time |
1238 | * them when adding another one - this saves quite a bit of cpu time |
1394 | * when lots of spells are cast in one area. Currently, it is presumed |
1239 | * when lots of spells are cast in one area. Currently, it is presumed |
1395 | * that flying non pickable objects are spell objects. |
1240 | * that flying non pickable objects are spell objects. |
1396 | */ |
1241 | */ |
1397 | |
1242 | for (top = ms.bot; top; top = top->above) |
1398 | while (top != NULL) |
|
|
1399 | { |
1243 | { |
1400 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1244 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1401 | floor = top; |
1245 | floor = top; |
1402 | |
1246 | |
1403 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1247 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1406 | top = top->below; |
1250 | top = top->below; |
1407 | break; |
1251 | break; |
1408 | } |
1252 | } |
1409 | |
1253 | |
1410 | last = top; |
1254 | last = top; |
1411 | top = top->above; |
|
|
1412 | } |
1255 | } |
1413 | |
1256 | |
1414 | /* Don't want top to be NULL, so set it to the last valid object */ |
1257 | /* Don't want top to be NULL, so set it to the last valid object */ |
1415 | top = last; |
1258 | top = last; |
1416 | |
1259 | |
… | |
… | |
1423 | * Unless those objects are exits, type 66 |
1266 | * Unless those objects are exits, type 66 |
1424 | * If INS_ON_TOP is used, don't do this processing |
1267 | * If INS_ON_TOP is used, don't do this processing |
1425 | * Need to find the object that in fact blocks view, otherwise |
1268 | * Need to find the object that in fact blocks view, otherwise |
1426 | * stacking is a bit odd. |
1269 | * stacking is a bit odd. |
1427 | */ |
1270 | */ |
1428 | if (!(flag & INS_ON_TOP) && |
1271 | if (!(flag & INS_ON_TOP) |
1429 | (get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1272 | && ms.flags () & P_BLOCKSVIEW |
|
|
1273 | && (op->face && !op->face->visibility)) |
1430 | { |
1274 | { |
1431 | for (last = top; last != floor; last = last->below) |
1275 | for (last = top; last != floor; last = last->below) |
1432 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1276 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1433 | break; |
1277 | break; |
|
|
1278 | |
1434 | /* Check to see if we found the object that blocks view, |
1279 | /* Check to see if we found the object that blocks view, |
1435 | * and make sure we have a below pointer for it so that |
1280 | * and make sure we have a below pointer for it so that |
1436 | * we can get inserted below this one, which requires we |
1281 | * we can get inserted below this one, which requires we |
1437 | * set top to the object below us. |
1282 | * set top to the object below us. |
1438 | */ |
1283 | */ |
… | |
… | |
1440 | top = last->below; |
1285 | top = last->below; |
1441 | } |
1286 | } |
1442 | } /* If objects on this space */ |
1287 | } /* If objects on this space */ |
1443 | |
1288 | |
1444 | if (flag & INS_MAP_LOAD) |
1289 | if (flag & INS_MAP_LOAD) |
1445 | top = GET_MAP_TOP (op->map, op->x, op->y); |
1290 | top = ms.top; |
1446 | |
1291 | |
1447 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1292 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1448 | top = floor; |
1293 | top = floor; |
1449 | |
1294 | |
1450 | /* Top is the object that our object (op) is going to get inserted above. |
1295 | /* Top is the object that our object (op) is going to get inserted above. |
1451 | */ |
1296 | */ |
1452 | |
1297 | |
1453 | /* First object on this space */ |
1298 | /* First object on this space */ |
1454 | if (!top) |
1299 | if (!top) |
1455 | { |
1300 | { |
1456 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1301 | op->above = ms.bot; |
1457 | |
1302 | |
1458 | if (op->above) |
1303 | if (op->above) |
1459 | op->above->below = op; |
1304 | op->above->below = op; |
1460 | |
1305 | |
1461 | op->below = NULL; |
1306 | op->below = 0; |
1462 | SET_MAP_OB (op->map, op->x, op->y, op); |
1307 | ms.bot = op; |
1463 | } |
1308 | } |
1464 | else |
1309 | else |
1465 | { /* get inserted into the stack above top */ |
1310 | { /* get inserted into the stack above top */ |
1466 | op->above = top->above; |
1311 | op->above = top->above; |
1467 | |
1312 | |
… | |
… | |
1470 | |
1315 | |
1471 | op->below = top; |
1316 | op->below = top; |
1472 | top->above = op; |
1317 | top->above = op; |
1473 | } |
1318 | } |
1474 | |
1319 | |
1475 | if (op->above == NULL) |
1320 | if (!op->above) |
1476 | SET_MAP_TOP (op->map, op->x, op->y, op); |
1321 | ms.top = op; |
1477 | } /* else not INS_BELOW_ORIGINATOR */ |
1322 | } /* else not INS_BELOW_ORIGINATOR */ |
1478 | |
1323 | |
1479 | if (op->type == PLAYER) |
1324 | if (op->type == PLAYER) |
|
|
1325 | { |
1480 | op->contr->do_los = 1; |
1326 | op->contr->do_los = 1; |
|
|
1327 | ++op->map->players; |
|
|
1328 | op->map->touch (); |
|
|
1329 | } |
|
|
1330 | |
|
|
1331 | op->map->dirty = true; |
1481 | |
1332 | |
1482 | /* If we have a floor, we know the player, if any, will be above |
1333 | /* If we have a floor, we know the player, if any, will be above |
1483 | * it, so save a few ticks and start from there. |
1334 | * it, so save a few ticks and start from there. |
1484 | */ |
1335 | */ |
1485 | if (!(flag & INS_MAP_LOAD)) |
1336 | if (!(flag & INS_MAP_LOAD)) |
1486 | for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1337 | if (object *pl = ms.player ()) |
1487 | if (tmp->type == PLAYER) |
1338 | if (pl->contr->ns) |
1488 | tmp->contr->socket.update_look = 1; |
1339 | pl->contr->ns->floorbox_update (); |
1489 | |
1340 | |
1490 | /* If this object glows, it may affect lighting conditions that are |
1341 | /* If this object glows, it may affect lighting conditions that are |
1491 | * visible to others on this map. But update_all_los is really |
1342 | * visible to others on this map. But update_all_los is really |
1492 | * an inefficient way to do this, as it means los for all players |
1343 | * an inefficient way to do this, as it means los for all players |
1493 | * on the map will get recalculated. The players could very well |
1344 | * on the map will get recalculated. The players could very well |
1494 | * be far away from this change and not affected in any way - |
1345 | * be far away from this change and not affected in any way - |
1495 | * this should get redone to only look for players within range, |
1346 | * this should get redone to only look for players within range, |
1496 | * or just updating the P_NEED_UPDATE for spaces within this area |
1347 | * or just updating the P_UPTODATE for spaces within this area |
1497 | * of effect may be sufficient. |
1348 | * of effect may be sufficient. |
1498 | */ |
1349 | */ |
1499 | if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) |
1350 | if (op->map->darkness && (op->glow_radius != 0)) |
1500 | update_all_los (op->map, op->x, op->y); |
1351 | update_all_los (op->map, op->x, op->y); |
1501 | |
1352 | |
1502 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1353 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1503 | update_object (op, UP_OBJ_INSERT); |
1354 | update_object (op, UP_OBJ_INSERT); |
1504 | |
1355 | |
|
|
1356 | INVOKE_OBJECT (INSERT, op); |
|
|
1357 | |
1505 | /* Don't know if moving this to the end will break anything. However, |
1358 | /* Don't know if moving this to the end will break anything. However, |
1506 | * we want to have update_look set above before calling this. |
1359 | * we want to have floorbox_update called before calling this. |
1507 | * |
1360 | * |
1508 | * check_move_on() must be after this because code called from |
1361 | * check_move_on() must be after this because code called from |
1509 | * check_move_on() depends on correct map flags (so functions like |
1362 | * check_move_on() depends on correct map flags (so functions like |
1510 | * blocked() and wall() work properly), and these flags are updated by |
1363 | * blocked() and wall() work properly), and these flags are updated by |
1511 | * update_object(). |
1364 | * update_object(). |
… | |
… | |
1513 | |
1366 | |
1514 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1367 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1515 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1368 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1516 | { |
1369 | { |
1517 | if (check_move_on (op, originator)) |
1370 | if (check_move_on (op, originator)) |
1518 | return NULL; |
1371 | return 0; |
1519 | |
1372 | |
1520 | /* If we are a multi part object, lets work our way through the check |
1373 | /* If we are a multi part object, lets work our way through the check |
1521 | * walk on's. |
1374 | * walk on's. |
1522 | */ |
1375 | */ |
1523 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1376 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1524 | if (check_move_on (tmp, originator)) |
1377 | if (check_move_on (tmp, originator)) |
1525 | return NULL; |
1378 | return 0; |
1526 | } |
1379 | } |
1527 | |
1380 | |
1528 | return op; |
1381 | return op; |
1529 | } |
1382 | } |
1530 | |
1383 | |
1531 | /* this function inserts an object in the map, but if it |
1384 | /* this function inserts an object in the map, but if it |
1532 | * finds an object of its own type, it'll remove that one first. |
1385 | * finds an object of its own type, it'll remove that one first. |
1533 | * op is the object to insert it under: supplies x and the map. |
1386 | * op is the object to insert it under: supplies x and the map. |
1534 | */ |
1387 | */ |
1535 | void |
1388 | void |
1536 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1389 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1537 | { |
1390 | { |
1538 | object * |
1391 | object *tmp, *tmp1; |
1539 | tmp; |
|
|
1540 | object * |
|
|
1541 | tmp1; |
|
|
1542 | |
1392 | |
1543 | /* first search for itself and remove any old instances */ |
1393 | /* first search for itself and remove any old instances */ |
1544 | |
1394 | |
1545 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1395 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1546 | { |
|
|
1547 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1396 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1548 | { |
|
|
1549 | tmp->remove (); |
|
|
1550 | tmp->destroy (0); |
1397 | tmp->destroy (); |
1551 | } |
|
|
1552 | } |
|
|
1553 | |
1398 | |
1554 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1399 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1555 | |
1400 | |
1556 | tmp1->x = op->x; |
1401 | tmp1->x = op->x; |
1557 | tmp1->y = op->y; |
1402 | tmp1->y = op->y; |
1558 | insert_ob_in_map (tmp1, op->map, op, 0); |
1403 | insert_ob_in_map (tmp1, op->map, op, 0); |
|
|
1404 | } |
|
|
1405 | |
|
|
1406 | object * |
|
|
1407 | object::insert_at (object *where, object *originator, int flags) |
|
|
1408 | { |
|
|
1409 | where->map->insert (this, where->x, where->y, originator, flags); |
1559 | } |
1410 | } |
1560 | |
1411 | |
1561 | /* |
1412 | /* |
1562 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1413 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1563 | * is returned contains nr objects, and the remaining parts contains |
1414 | * is returned contains nr objects, and the remaining parts contains |
1564 | * the rest (or is removed and freed if that number is 0). |
1415 | * the rest (or is removed and freed if that number is 0). |
1565 | * On failure, NULL is returned, and the reason put into the |
1416 | * On failure, NULL is returned, and the reason put into the |
1566 | * global static errmsg array. |
1417 | * global static errmsg array. |
1567 | */ |
1418 | */ |
1568 | |
|
|
1569 | object * |
1419 | object * |
1570 | get_split_ob (object *orig_ob, uint32 nr) |
1420 | get_split_ob (object *orig_ob, uint32 nr) |
1571 | { |
1421 | { |
1572 | object * |
1422 | object *newob; |
1573 | newob; |
|
|
1574 | int |
|
|
1575 | is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1423 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1576 | |
1424 | |
1577 | if (orig_ob->nrof < nr) |
1425 | if (orig_ob->nrof < nr) |
1578 | { |
1426 | { |
1579 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1427 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1580 | return NULL; |
1428 | return NULL; |
… | |
… | |
1611 | |
1459 | |
1612 | object * |
1460 | object * |
1613 | decrease_ob_nr (object *op, uint32 i) |
1461 | decrease_ob_nr (object *op, uint32 i) |
1614 | { |
1462 | { |
1615 | object *tmp; |
1463 | object *tmp; |
1616 | player *pl; |
|
|
1617 | |
1464 | |
1618 | if (i == 0) /* objects with op->nrof require this check */ |
1465 | if (i == 0) /* objects with op->nrof require this check */ |
1619 | return op; |
1466 | return op; |
1620 | |
1467 | |
1621 | if (i > op->nrof) |
1468 | if (i > op->nrof) |
1622 | i = op->nrof; |
1469 | i = op->nrof; |
1623 | |
1470 | |
1624 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1471 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1625 | op->nrof -= i; |
1472 | op->nrof -= i; |
1626 | else if (op->env != NULL) |
1473 | else if (op->env) |
1627 | { |
1474 | { |
1628 | /* is this object in the players inventory, or sub container |
1475 | /* is this object in the players inventory, or sub container |
1629 | * therein? |
1476 | * therein? |
1630 | */ |
1477 | */ |
1631 | tmp = is_player_inv (op->env); |
1478 | tmp = op->in_player (); |
1632 | /* nope. Is this a container the player has opened? |
1479 | /* nope. Is this a container the player has opened? |
1633 | * If so, set tmp to that player. |
1480 | * If so, set tmp to that player. |
1634 | * IMO, searching through all the players will mostly |
1481 | * IMO, searching through all the players will mostly |
1635 | * likely be quicker than following op->env to the map, |
1482 | * likely be quicker than following op->env to the map, |
1636 | * and then searching the map for a player. |
1483 | * and then searching the map for a player. |
1637 | */ |
1484 | */ |
1638 | if (!tmp) |
1485 | if (!tmp) |
1639 | { |
1486 | for_all_players (pl) |
1640 | for (pl = first_player; pl; pl = pl->next) |
|
|
1641 | if (pl->ob->container == op->env) |
1487 | if (pl->ob->container == op->env) |
|
|
1488 | { |
|
|
1489 | tmp = pl->ob; |
1642 | break; |
1490 | break; |
1643 | if (pl) |
|
|
1644 | tmp = pl->ob; |
|
|
1645 | else |
|
|
1646 | tmp = NULL; |
|
|
1647 | } |
1491 | } |
1648 | |
1492 | |
1649 | if (i < op->nrof) |
1493 | if (i < op->nrof) |
1650 | { |
1494 | { |
1651 | sub_weight (op->env, op->weight * i); |
1495 | sub_weight (op->env, op->weight * i); |
1652 | op->nrof -= i; |
1496 | op->nrof -= i; |
1653 | if (tmp) |
1497 | if (tmp) |
1654 | { |
|
|
1655 | esrv_send_item (tmp, op); |
1498 | esrv_send_item (tmp, op); |
1656 | } |
|
|
1657 | } |
1499 | } |
1658 | else |
1500 | else |
1659 | { |
1501 | { |
1660 | op->remove (); |
1502 | op->remove (); |
1661 | op->nrof = 0; |
1503 | op->nrof = 0; |
1662 | if (tmp) |
1504 | if (tmp) |
1663 | { |
|
|
1664 | esrv_del_item (tmp->contr, op->count); |
1505 | esrv_del_item (tmp->contr, op->count); |
1665 | } |
|
|
1666 | } |
1506 | } |
1667 | } |
1507 | } |
1668 | else |
1508 | else |
1669 | { |
1509 | { |
1670 | object *above = op->above; |
1510 | object *above = op->above; |
… | |
… | |
1676 | op->remove (); |
1516 | op->remove (); |
1677 | op->nrof = 0; |
1517 | op->nrof = 0; |
1678 | } |
1518 | } |
1679 | |
1519 | |
1680 | /* Since we just removed op, op->above is null */ |
1520 | /* Since we just removed op, op->above is null */ |
1681 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
1521 | for (tmp = above; tmp; tmp = tmp->above) |
1682 | if (tmp->type == PLAYER) |
1522 | if (tmp->type == PLAYER) |
1683 | { |
1523 | { |
1684 | if (op->nrof) |
1524 | if (op->nrof) |
1685 | esrv_send_item (tmp, op); |
1525 | esrv_send_item (tmp, op); |
1686 | else |
1526 | else |
… | |
… | |
1690 | |
1530 | |
1691 | if (op->nrof) |
1531 | if (op->nrof) |
1692 | return op; |
1532 | return op; |
1693 | else |
1533 | else |
1694 | { |
1534 | { |
1695 | op->destroy (0); |
1535 | op->destroy (); |
1696 | return NULL; |
1536 | return 0; |
1697 | } |
1537 | } |
1698 | } |
1538 | } |
1699 | |
1539 | |
1700 | /* |
1540 | /* |
1701 | * add_weight(object, weight) adds the specified weight to an object, |
1541 | * add_weight(object, weight) adds the specified weight to an object, |
… | |
… | |
1761 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1601 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1762 | CLEAR_FLAG (op, FLAG_REMOVED); |
1602 | CLEAR_FLAG (op, FLAG_REMOVED); |
1763 | if (op->nrof) |
1603 | if (op->nrof) |
1764 | { |
1604 | { |
1765 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1605 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1766 | if (CAN_MERGE (tmp, op)) |
1606 | if (object::can_merge (tmp, op)) |
1767 | { |
1607 | { |
1768 | /* return the original object and remove inserted object |
1608 | /* return the original object and remove inserted object |
1769 | (client needs the original object) */ |
1609 | (client needs the original object) */ |
1770 | tmp->nrof += op->nrof; |
1610 | tmp->nrof += op->nrof; |
1771 | /* Weight handling gets pretty funky. Since we are adding to |
1611 | /* Weight handling gets pretty funky. Since we are adding to |
… | |
… | |
1789 | add_weight (this, op->weight * op->nrof); |
1629 | add_weight (this, op->weight * op->nrof); |
1790 | } |
1630 | } |
1791 | else |
1631 | else |
1792 | add_weight (this, (op->weight + op->carrying)); |
1632 | add_weight (this, (op->weight + op->carrying)); |
1793 | |
1633 | |
1794 | otmp = is_player_inv (this); |
1634 | otmp = this->in_player (); |
1795 | if (otmp && otmp->contr) |
1635 | if (otmp && otmp->contr) |
1796 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1636 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1797 | fix_player (otmp); |
1637 | otmp->update_stats (); |
1798 | |
1638 | |
1799 | op->map = NULL; |
1639 | op->map = 0; |
1800 | op->env = this; |
1640 | op->env = this; |
1801 | op->above = NULL; |
1641 | op->above = 0; |
1802 | op->below = NULL; |
1642 | op->below = 0; |
1803 | op->x = 0, op->y = 0; |
1643 | op->x = 0, op->y = 0; |
1804 | |
1644 | |
1805 | /* reset the light list and los of the players on the map */ |
1645 | /* reset the light list and los of the players on the map */ |
1806 | if ((op->glow_radius != 0) && map) |
1646 | if ((op->glow_radius != 0) && map) |
1807 | { |
1647 | { |
1808 | #ifdef DEBUG_LIGHTS |
1648 | #ifdef DEBUG_LIGHTS |
1809 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1649 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1810 | #endif /* DEBUG_LIGHTS */ |
1650 | #endif /* DEBUG_LIGHTS */ |
1811 | if (MAP_DARKNESS (map)) |
1651 | if (map->darkness) |
1812 | update_all_los (map, x, y); |
1652 | update_all_los (map, x, y); |
1813 | } |
1653 | } |
1814 | |
1654 | |
1815 | /* Client has no idea of ordering so lets not bother ordering it here. |
1655 | /* Client has no idea of ordering so lets not bother ordering it here. |
1816 | * It sure simplifies this function... |
1656 | * It sure simplifies this function... |
… | |
… | |
1821 | { |
1661 | { |
1822 | op->below = inv; |
1662 | op->below = inv; |
1823 | op->below->above = op; |
1663 | op->below->above = op; |
1824 | inv = op; |
1664 | inv = op; |
1825 | } |
1665 | } |
|
|
1666 | |
|
|
1667 | INVOKE_OBJECT (INSERT, this); |
1826 | |
1668 | |
1827 | return op; |
1669 | return op; |
1828 | } |
1670 | } |
1829 | |
1671 | |
1830 | /* |
1672 | /* |
… | |
… | |
1845 | * |
1687 | * |
1846 | * MSW 2001-07-08: Check all objects on space, not just those below |
1688 | * MSW 2001-07-08: Check all objects on space, not just those below |
1847 | * object being inserted. insert_ob_in_map may not put new objects |
1689 | * object being inserted. insert_ob_in_map may not put new objects |
1848 | * on top. |
1690 | * on top. |
1849 | */ |
1691 | */ |
1850 | |
|
|
1851 | int |
1692 | int |
1852 | check_move_on (object *op, object *originator) |
1693 | check_move_on (object *op, object *originator) |
1853 | { |
1694 | { |
1854 | object *tmp; |
1695 | object *tmp; |
1855 | maptile *m = op->map; |
1696 | maptile *m = op->map; |
… | |
… | |
1882 | |
1723 | |
1883 | /* The objects have to be checked from top to bottom. |
1724 | /* The objects have to be checked from top to bottom. |
1884 | * Hence, we first go to the top: |
1725 | * Hence, we first go to the top: |
1885 | */ |
1726 | */ |
1886 | |
1727 | |
1887 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above) |
1728 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
1888 | { |
1729 | { |
1889 | /* Trim the search when we find the first other spell effect |
1730 | /* Trim the search when we find the first other spell effect |
1890 | * this helps performance so that if a space has 50 spell objects, |
1731 | * this helps performance so that if a space has 50 spell objects, |
1891 | * we don't need to check all of them. |
1732 | * we don't need to check all of them. |
1892 | */ |
1733 | */ |
… | |
… | |
1910 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1751 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1911 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1752 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1912 | { |
1753 | { |
1913 | |
1754 | |
1914 | float |
1755 | float |
1915 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1756 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1916 | |
1757 | |
1917 | if (op->type == PLAYER) |
1758 | if (op->type == PLAYER) |
1918 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1759 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1919 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1760 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1920 | diff /= 4.0; |
1761 | diff /= 4.0; |
… | |
… | |
1947 | /* |
1788 | /* |
1948 | * present_arch(arch, map, x, y) searches for any objects with |
1789 | * present_arch(arch, map, x, y) searches for any objects with |
1949 | * a matching archetype at the given map and coordinates. |
1790 | * a matching archetype at the given map and coordinates. |
1950 | * The first matching object is returned, or NULL if none. |
1791 | * The first matching object is returned, or NULL if none. |
1951 | */ |
1792 | */ |
1952 | |
|
|
1953 | object * |
1793 | object * |
1954 | present_arch (const archetype *at, maptile *m, int x, int y) |
1794 | present_arch (const archetype *at, maptile *m, int x, int y) |
1955 | { |
1795 | { |
1956 | object * |
|
|
1957 | tmp; |
|
|
1958 | |
|
|
1959 | if (m == NULL || out_of_map (m, x, y)) |
1796 | if (!m || out_of_map (m, x, y)) |
1960 | { |
1797 | { |
1961 | LOG (llevError, "Present_arch called outside map.\n"); |
1798 | LOG (llevError, "Present_arch called outside map.\n"); |
1962 | return NULL; |
1799 | return NULL; |
1963 | } |
1800 | } |
1964 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1801 | |
|
|
1802 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1965 | if (tmp->arch == at) |
1803 | if (tmp->arch == at) |
1966 | return tmp; |
1804 | return tmp; |
|
|
1805 | |
1967 | return NULL; |
1806 | return NULL; |
1968 | } |
1807 | } |
1969 | |
1808 | |
1970 | /* |
1809 | /* |
1971 | * present(type, map, x, y) searches for any objects with |
1810 | * present(type, map, x, y) searches for any objects with |
1972 | * a matching type variable at the given map and coordinates. |
1811 | * a matching type variable at the given map and coordinates. |
1973 | * The first matching object is returned, or NULL if none. |
1812 | * The first matching object is returned, or NULL if none. |
1974 | */ |
1813 | */ |
1975 | |
|
|
1976 | object * |
1814 | object * |
1977 | present (unsigned char type, maptile *m, int x, int y) |
1815 | present (unsigned char type, maptile *m, int x, int y) |
1978 | { |
1816 | { |
1979 | object * |
|
|
1980 | tmp; |
|
|
1981 | |
|
|
1982 | if (out_of_map (m, x, y)) |
1817 | if (out_of_map (m, x, y)) |
1983 | { |
1818 | { |
1984 | LOG (llevError, "Present called outside map.\n"); |
1819 | LOG (llevError, "Present called outside map.\n"); |
1985 | return NULL; |
1820 | return NULL; |
1986 | } |
1821 | } |
1987 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1822 | |
|
|
1823 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1988 | if (tmp->type == type) |
1824 | if (tmp->type == type) |
1989 | return tmp; |
1825 | return tmp; |
|
|
1826 | |
1990 | return NULL; |
1827 | return NULL; |
1991 | } |
1828 | } |
1992 | |
1829 | |
1993 | /* |
1830 | /* |
1994 | * present_in_ob(type, object) searches for any objects with |
1831 | * present_in_ob(type, object) searches for any objects with |
1995 | * a matching type variable in the inventory of the given object. |
1832 | * a matching type variable in the inventory of the given object. |
1996 | * The first matching object is returned, or NULL if none. |
1833 | * The first matching object is returned, or NULL if none. |
1997 | */ |
1834 | */ |
1998 | |
|
|
1999 | object * |
1835 | object * |
2000 | present_in_ob (unsigned char type, const object *op) |
1836 | present_in_ob (unsigned char type, const object *op) |
2001 | { |
1837 | { |
2002 | object * |
|
|
2003 | tmp; |
|
|
2004 | |
|
|
2005 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1838 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2006 | if (tmp->type == type) |
1839 | if (tmp->type == type) |
2007 | return tmp; |
1840 | return tmp; |
|
|
1841 | |
2008 | return NULL; |
1842 | return NULL; |
2009 | } |
1843 | } |
2010 | |
1844 | |
2011 | /* |
1845 | /* |
2012 | * present_in_ob (type, str, object) searches for any objects with |
1846 | * present_in_ob (type, str, object) searches for any objects with |
… | |
… | |
2020 | * str is the string to match against. Note that we match against |
1854 | * str is the string to match against. Note that we match against |
2021 | * the object name, not the archetype name. this is so that the |
1855 | * the object name, not the archetype name. this is so that the |
2022 | * spell code can use one object type (force), but change it's name |
1856 | * spell code can use one object type (force), but change it's name |
2023 | * to be unique. |
1857 | * to be unique. |
2024 | */ |
1858 | */ |
2025 | |
|
|
2026 | object * |
1859 | object * |
2027 | present_in_ob_by_name (int type, const char *str, const object *op) |
1860 | present_in_ob_by_name (int type, const char *str, const object *op) |
2028 | { |
1861 | { |
2029 | object * |
|
|
2030 | tmp; |
|
|
2031 | |
|
|
2032 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1862 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
2033 | { |
|
|
2034 | if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) |
1863 | if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) |
2035 | return tmp; |
1864 | return tmp; |
2036 | } |
1865 | |
2037 | return NULL; |
1866 | return 0; |
2038 | } |
1867 | } |
2039 | |
1868 | |
2040 | /* |
1869 | /* |
2041 | * present_arch_in_ob(archetype, object) searches for any objects with |
1870 | * present_arch_in_ob(archetype, object) searches for any objects with |
2042 | * a matching archetype in the inventory of the given object. |
1871 | * a matching archetype in the inventory of the given object. |
2043 | * The first matching object is returned, or NULL if none. |
1872 | * The first matching object is returned, or NULL if none. |
2044 | */ |
1873 | */ |
2045 | |
|
|
2046 | object * |
1874 | object * |
2047 | present_arch_in_ob (const archetype *at, const object *op) |
1875 | present_arch_in_ob (const archetype *at, const object *op) |
2048 | { |
1876 | { |
2049 | object * |
|
|
2050 | tmp; |
|
|
2051 | |
|
|
2052 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1877 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2053 | if (tmp->arch == at) |
1878 | if (tmp->arch == at) |
2054 | return tmp; |
1879 | return tmp; |
|
|
1880 | |
2055 | return NULL; |
1881 | return NULL; |
2056 | } |
1882 | } |
2057 | |
1883 | |
2058 | /* |
1884 | /* |
2059 | * activate recursively a flag on an object inventory |
1885 | * activate recursively a flag on an object inventory |
2060 | */ |
1886 | */ |
2061 | void |
1887 | void |
2062 | flag_inv (object *op, int flag) |
1888 | flag_inv (object *op, int flag) |
2063 | { |
1889 | { |
2064 | object * |
|
|
2065 | tmp; |
|
|
2066 | |
|
|
2067 | if (op->inv) |
1890 | if (op->inv) |
2068 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1891 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2069 | { |
1892 | { |
2070 | SET_FLAG (tmp, flag); |
1893 | SET_FLAG (tmp, flag); |
2071 | flag_inv (tmp, flag); |
1894 | flag_inv (tmp, flag); |
2072 | } |
1895 | } |
2073 | } /* |
1896 | } |
|
|
1897 | |
|
|
1898 | /* |
2074 | * desactivate recursively a flag on an object inventory |
1899 | * deactivate recursively a flag on an object inventory |
2075 | */ |
1900 | */ |
2076 | void |
1901 | void |
2077 | unflag_inv (object *op, int flag) |
1902 | unflag_inv (object *op, int flag) |
2078 | { |
1903 | { |
2079 | object * |
|
|
2080 | tmp; |
|
|
2081 | |
|
|
2082 | if (op->inv) |
1904 | if (op->inv) |
2083 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1905 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2084 | { |
1906 | { |
2085 | CLEAR_FLAG (tmp, flag); |
1907 | CLEAR_FLAG (tmp, flag); |
2086 | unflag_inv (tmp, flag); |
1908 | unflag_inv (tmp, flag); |
2087 | } |
1909 | } |
2088 | } |
1910 | } |
… | |
… | |
2091 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
1913 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
2092 | * all it's inventory (recursively). |
1914 | * all it's inventory (recursively). |
2093 | * If checksums are used, a player will get set_cheat called for |
1915 | * If checksums are used, a player will get set_cheat called for |
2094 | * him/her-self and all object carried by a call to this function. |
1916 | * him/her-self and all object carried by a call to this function. |
2095 | */ |
1917 | */ |
2096 | |
|
|
2097 | void |
1918 | void |
2098 | set_cheat (object *op) |
1919 | set_cheat (object *op) |
2099 | { |
1920 | { |
2100 | SET_FLAG (op, FLAG_WAS_WIZ); |
1921 | SET_FLAG (op, FLAG_WAS_WIZ); |
2101 | flag_inv (op, FLAG_WAS_WIZ); |
1922 | flag_inv (op, FLAG_WAS_WIZ); |
… | |
… | |
2120 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1941 | * because arch_blocked (now ob_blocked) needs to know the movement type |
2121 | * to know if the space in question will block the object. We can't use |
1942 | * to know if the space in question will block the object. We can't use |
2122 | * the archetype because that isn't correct if the monster has been |
1943 | * the archetype because that isn't correct if the monster has been |
2123 | * customized, changed states, etc. |
1944 | * customized, changed states, etc. |
2124 | */ |
1945 | */ |
2125 | |
|
|
2126 | int |
1946 | int |
2127 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1947 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2128 | { |
1948 | { |
2129 | int |
|
|
2130 | i, |
|
|
2131 | index = 0, flag; |
1949 | int index = 0, flag; |
2132 | static int |
|
|
2133 | altern[SIZEOFFREE]; |
1950 | int altern[SIZEOFFREE]; |
2134 | |
1951 | |
2135 | for (i = start; i < stop; i++) |
1952 | for (int i = start; i < stop; i++) |
2136 | { |
1953 | { |
2137 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
1954 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
2138 | if (!flag) |
1955 | if (!flag) |
2139 | altern[index++] = i; |
1956 | altern [index++] = i; |
2140 | |
1957 | |
2141 | /* Basically, if we find a wall on a space, we cut down the search size. |
1958 | /* Basically, if we find a wall on a space, we cut down the search size. |
2142 | * In this way, we won't return spaces that are on another side of a wall. |
1959 | * In this way, we won't return spaces that are on another side of a wall. |
2143 | * This mostly work, but it cuts down the search size in all directions - |
1960 | * This mostly work, but it cuts down the search size in all directions - |
2144 | * if the space being examined only has a wall to the north and empty |
1961 | * if the space being examined only has a wall to the north and empty |
2145 | * spaces in all the other directions, this will reduce the search space |
1962 | * spaces in all the other directions, this will reduce the search space |
2146 | * to only the spaces immediately surrounding the target area, and |
1963 | * to only the spaces immediately surrounding the target area, and |
2147 | * won't look 2 spaces south of the target space. |
1964 | * won't look 2 spaces south of the target space. |
2148 | */ |
1965 | */ |
2149 | else if ((flag & AB_NO_PASS) && maxfree[i] < stop) |
1966 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
2150 | stop = maxfree[i]; |
1967 | stop = maxfree[i]; |
2151 | } |
1968 | } |
|
|
1969 | |
2152 | if (!index) |
1970 | if (!index) |
2153 | return -1; |
1971 | return -1; |
|
|
1972 | |
2154 | return altern[RANDOM () % index]; |
1973 | return altern[RANDOM () % index]; |
2155 | } |
1974 | } |
2156 | |
1975 | |
2157 | /* |
1976 | /* |
2158 | * find_first_free_spot(archetype, maptile, x, y) works like |
1977 | * find_first_free_spot(archetype, maptile, x, y) works like |
2159 | * find_free_spot(), but it will search max number of squares. |
1978 | * find_free_spot(), but it will search max number of squares. |
2160 | * But it will return the first available spot, not a random choice. |
1979 | * But it will return the first available spot, not a random choice. |
2161 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
1980 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2162 | */ |
1981 | */ |
2163 | |
|
|
2164 | int |
1982 | int |
2165 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
1983 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2166 | { |
1984 | { |
2167 | int |
|
|
2168 | i; |
|
|
2169 | |
|
|
2170 | for (i = 0; i < SIZEOFFREE; i++) |
1985 | for (int i = 0; i < SIZEOFFREE; i++) |
2171 | { |
|
|
2172 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
1986 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2173 | return i; |
1987 | return i; |
2174 | } |
1988 | |
2175 | return -1; |
1989 | return -1; |
2176 | } |
1990 | } |
2177 | |
1991 | |
2178 | /* |
1992 | /* |
2179 | * The function permute(arr, begin, end) randomly reorders the array |
1993 | * The function permute(arr, begin, end) randomly reorders the array |
2180 | * arr[begin..end-1]. |
1994 | * arr[begin..end-1]. |
|
|
1995 | * now uses a fisher-yates shuffle, old permute was broken |
2181 | */ |
1996 | */ |
2182 | static void |
1997 | static void |
2183 | permute (int *arr, int begin, int end) |
1998 | permute (int *arr, int begin, int end) |
2184 | { |
1999 | { |
2185 | int |
2000 | arr += begin; |
2186 | i, |
|
|
2187 | j, |
|
|
2188 | tmp, |
|
|
2189 | len; |
|
|
2190 | |
|
|
2191 | len = end - begin; |
2001 | end -= begin; |
2192 | for (i = begin; i < end; i++) |
|
|
2193 | { |
|
|
2194 | j = begin + RANDOM () % len; |
|
|
2195 | |
2002 | |
2196 | tmp = arr[i]; |
2003 | while (--end) |
2197 | arr[i] = arr[j]; |
2004 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2198 | arr[j] = tmp; |
|
|
2199 | } |
|
|
2200 | } |
2005 | } |
2201 | |
2006 | |
2202 | /* new function to make monster searching more efficient, and effective! |
2007 | /* new function to make monster searching more efficient, and effective! |
2203 | * This basically returns a randomized array (in the passed pointer) of |
2008 | * This basically returns a randomized array (in the passed pointer) of |
2204 | * the spaces to find monsters. In this way, it won't always look for |
2009 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2207 | * the 3x3 area will be searched, just not in a predictable order. |
2012 | * the 3x3 area will be searched, just not in a predictable order. |
2208 | */ |
2013 | */ |
2209 | void |
2014 | void |
2210 | get_search_arr (int *search_arr) |
2015 | get_search_arr (int *search_arr) |
2211 | { |
2016 | { |
2212 | int |
2017 | int i; |
2213 | i; |
|
|
2214 | |
2018 | |
2215 | for (i = 0; i < SIZEOFFREE; i++) |
2019 | for (i = 0; i < SIZEOFFREE; i++) |
2216 | { |
|
|
2217 | search_arr[i] = i; |
2020 | search_arr[i] = i; |
2218 | } |
|
|
2219 | |
2021 | |
2220 | permute (search_arr, 1, SIZEOFFREE1 + 1); |
2022 | permute (search_arr, 1, SIZEOFFREE1 + 1); |
2221 | permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); |
2023 | permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); |
2222 | permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); |
2024 | permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); |
2223 | } |
2025 | } |
… | |
… | |
2232 | * Perhaps incorrectly, but I'm making the assumption that exclude |
2034 | * Perhaps incorrectly, but I'm making the assumption that exclude |
2233 | * is actually want is going to try and move there. We need this info |
2035 | * is actually want is going to try and move there. We need this info |
2234 | * because we have to know what movement the thing looking to move |
2036 | * because we have to know what movement the thing looking to move |
2235 | * there is capable of. |
2037 | * there is capable of. |
2236 | */ |
2038 | */ |
2237 | |
|
|
2238 | int |
2039 | int |
2239 | find_dir (maptile *m, int x, int y, object *exclude) |
2040 | find_dir (maptile *m, int x, int y, object *exclude) |
2240 | { |
2041 | { |
2241 | int |
|
|
2242 | i, |
|
|
2243 | max = SIZEOFFREE, mflags; |
2042 | int i, max = SIZEOFFREE, mflags; |
2244 | |
2043 | |
2245 | sint16 nx, ny; |
2044 | sint16 nx, ny; |
2246 | object * |
2045 | object *tmp; |
2247 | tmp; |
|
|
2248 | maptile * |
2046 | maptile *mp; |
2249 | mp; |
|
|
2250 | |
2047 | |
2251 | MoveType blocked, move_type; |
2048 | MoveType blocked, move_type; |
2252 | |
2049 | |
2253 | if (exclude && exclude->head) |
2050 | if (exclude && exclude->head) |
2254 | { |
2051 | { |
… | |
… | |
2266 | mp = m; |
2063 | mp = m; |
2267 | nx = x + freearr_x[i]; |
2064 | nx = x + freearr_x[i]; |
2268 | ny = y + freearr_y[i]; |
2065 | ny = y + freearr_y[i]; |
2269 | |
2066 | |
2270 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
2067 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
|
|
2068 | |
2271 | if (mflags & P_OUT_OF_MAP) |
2069 | if (mflags & P_OUT_OF_MAP) |
2272 | { |
|
|
2273 | max = maxfree[i]; |
2070 | max = maxfree[i]; |
2274 | } |
|
|
2275 | else |
2071 | else |
2276 | { |
2072 | { |
2277 | blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); |
2073 | mapspace &ms = mp->at (nx, ny); |
|
|
2074 | |
|
|
2075 | blocked = ms.move_block; |
2278 | |
2076 | |
2279 | if ((move_type & blocked) == move_type) |
2077 | if ((move_type & blocked) == move_type) |
2280 | { |
|
|
2281 | max = maxfree[i]; |
2078 | max = maxfree[i]; |
2282 | } |
|
|
2283 | else if (mflags & P_IS_ALIVE) |
2079 | else if (mflags & P_IS_ALIVE) |
2284 | { |
2080 | { |
2285 | for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above) |
2081 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2286 | { |
2082 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2287 | if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2083 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2288 | { |
|
|
2289 | break; |
2084 | break; |
2290 | } |
2085 | |
2291 | } |
|
|
2292 | if (tmp) |
2086 | if (tmp) |
2293 | { |
|
|
2294 | return freedir[i]; |
2087 | return freedir[i]; |
2295 | } |
|
|
2296 | } |
2088 | } |
2297 | } |
2089 | } |
2298 | } |
2090 | } |
|
|
2091 | |
2299 | return 0; |
2092 | return 0; |
2300 | } |
2093 | } |
2301 | |
2094 | |
2302 | /* |
2095 | /* |
2303 | * distance(object 1, object 2) will return the square of the |
2096 | * distance(object 1, object 2) will return the square of the |
2304 | * distance between the two given objects. |
2097 | * distance between the two given objects. |
2305 | */ |
2098 | */ |
2306 | |
|
|
2307 | int |
2099 | int |
2308 | distance (const object *ob1, const object *ob2) |
2100 | distance (const object *ob1, const object *ob2) |
2309 | { |
2101 | { |
2310 | int |
|
|
2311 | i; |
|
|
2312 | |
|
|
2313 | i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2102 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2314 | return i; |
|
|
2315 | } |
2103 | } |
2316 | |
2104 | |
2317 | /* |
2105 | /* |
2318 | * find_dir_2(delta-x,delta-y) will return a direction in which |
2106 | * find_dir_2(delta-x,delta-y) will return a direction in which |
2319 | * an object which has subtracted the x and y coordinates of another |
2107 | * an object which has subtracted the x and y coordinates of another |
2320 | * object, needs to travel toward it. |
2108 | * object, needs to travel toward it. |
2321 | */ |
2109 | */ |
2322 | |
|
|
2323 | int |
2110 | int |
2324 | find_dir_2 (int x, int y) |
2111 | find_dir_2 (int x, int y) |
2325 | { |
2112 | { |
2326 | int |
2113 | int q; |
2327 | q; |
|
|
2328 | |
2114 | |
2329 | if (y) |
2115 | if (y) |
2330 | q = x * 100 / y; |
2116 | q = x * 100 / y; |
2331 | else if (x) |
2117 | else if (x) |
2332 | q = -300 * x; |
2118 | q = -300 * x; |
… | |
… | |
2357 | |
2143 | |
2358 | return 3; |
2144 | return 3; |
2359 | } |
2145 | } |
2360 | |
2146 | |
2361 | /* |
2147 | /* |
2362 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
2363 | * the "absolute" direction of a number (it actually takes care of |
|
|
2364 | * "overflow" in previous calculations of a direction). |
|
|
2365 | */ |
|
|
2366 | |
|
|
2367 | int |
|
|
2368 | absdir (int d) |
|
|
2369 | { |
|
|
2370 | while (d < 1) |
|
|
2371 | d += 8; |
|
|
2372 | while (d > 8) |
|
|
2373 | d -= 8; |
|
|
2374 | return d; |
|
|
2375 | } |
|
|
2376 | |
|
|
2377 | /* |
|
|
2378 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2148 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2379 | * between two directions (which are expected to be absolute (see absdir()) |
2149 | * between two directions (which are expected to be absolute (see absdir()) |
2380 | */ |
2150 | */ |
2381 | |
|
|
2382 | int |
2151 | int |
2383 | dirdiff (int dir1, int dir2) |
2152 | dirdiff (int dir1, int dir2) |
2384 | { |
2153 | { |
2385 | int |
2154 | int d; |
2386 | d; |
|
|
2387 | |
2155 | |
2388 | d = abs (dir1 - dir2); |
2156 | d = abs (dir1 - dir2); |
2389 | if (d > 4) |
2157 | if (d > 4) |
2390 | d = 8 - d; |
2158 | d = 8 - d; |
|
|
2159 | |
2391 | return d; |
2160 | return d; |
2392 | } |
2161 | } |
2393 | |
2162 | |
2394 | /* peterm: |
2163 | /* peterm: |
2395 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2164 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
… | |
… | |
2398 | * This basically means that if direction is 15, then it could either go |
2167 | * This basically means that if direction is 15, then it could either go |
2399 | * direction 4, 14, or 16 to get back to where we are. |
2168 | * direction 4, 14, or 16 to get back to where we are. |
2400 | * Moved from spell_util.c to object.c with the other related direction |
2169 | * Moved from spell_util.c to object.c with the other related direction |
2401 | * functions. |
2170 | * functions. |
2402 | */ |
2171 | */ |
2403 | |
|
|
2404 | int |
|
|
2405 | reduction_dir[SIZEOFFREE][3] = { |
2172 | int reduction_dir[SIZEOFFREE][3] = { |
2406 | {0, 0, 0}, /* 0 */ |
2173 | {0, 0, 0}, /* 0 */ |
2407 | {0, 0, 0}, /* 1 */ |
2174 | {0, 0, 0}, /* 1 */ |
2408 | {0, 0, 0}, /* 2 */ |
2175 | {0, 0, 0}, /* 2 */ |
2409 | {0, 0, 0}, /* 3 */ |
2176 | {0, 0, 0}, /* 3 */ |
2410 | {0, 0, 0}, /* 4 */ |
2177 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2458 | * find a path to that monster that we found. If not, |
2225 | * find a path to that monster that we found. If not, |
2459 | * we don't bother going toward it. Returns 1 if we |
2226 | * we don't bother going toward it. Returns 1 if we |
2460 | * can see a direct way to get it |
2227 | * can see a direct way to get it |
2461 | * Modified to be map tile aware -.MSW |
2228 | * Modified to be map tile aware -.MSW |
2462 | */ |
2229 | */ |
2463 | |
|
|
2464 | |
|
|
2465 | int |
2230 | int |
2466 | can_see_monsterP (maptile *m, int x, int y, int dir) |
2231 | can_see_monsterP (maptile *m, int x, int y, int dir) |
2467 | { |
2232 | { |
2468 | sint16 dx, dy; |
2233 | sint16 dx, dy; |
2469 | int |
|
|
2470 | mflags; |
2234 | int mflags; |
2471 | |
2235 | |
2472 | if (dir < 0) |
2236 | if (dir < 0) |
2473 | return 0; /* exit condition: invalid direction */ |
2237 | return 0; /* exit condition: invalid direction */ |
2474 | |
2238 | |
2475 | dx = x + freearr_x[dir]; |
2239 | dx = x + freearr_x[dir]; |
… | |
… | |
2488 | return 0; |
2252 | return 0; |
2489 | |
2253 | |
2490 | /* yes, can see. */ |
2254 | /* yes, can see. */ |
2491 | if (dir < 9) |
2255 | if (dir < 9) |
2492 | return 1; |
2256 | return 1; |
|
|
2257 | |
2493 | return can_see_monsterP (m, x, y, reduction_dir[dir][0]) | |
2258 | return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |
2494 | can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]); |
2259 | | can_see_monsterP (m, x, y, reduction_dir[dir][1]) |
|
|
2260 | | can_see_monsterP (m, x, y, reduction_dir[dir][2]); |
2495 | } |
2261 | } |
2496 | |
|
|
2497 | |
|
|
2498 | |
2262 | |
2499 | /* |
2263 | /* |
2500 | * can_pick(picker, item): finds out if an object is possible to be |
2264 | * can_pick(picker, item): finds out if an object is possible to be |
2501 | * picked up by the picker. Returnes 1 if it can be |
2265 | * picked up by the picker. Returnes 1 if it can be |
2502 | * picked up, otherwise 0. |
2266 | * picked up, otherwise 0. |
… | |
… | |
2513 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2277 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2514 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2278 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2515 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); |
2279 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); |
2516 | } |
2280 | } |
2517 | |
2281 | |
2518 | |
|
|
2519 | /* |
2282 | /* |
2520 | * create clone from object to another |
2283 | * create clone from object to another |
2521 | */ |
2284 | */ |
2522 | object * |
2285 | object * |
2523 | object_create_clone (object *asrc) |
2286 | object_create_clone (object *asrc) |
… | |
… | |
2532 | src = src->head; |
2295 | src = src->head; |
2533 | |
2296 | |
2534 | prev = 0; |
2297 | prev = 0; |
2535 | for (part = src; part; part = part->more) |
2298 | for (part = src; part; part = part->more) |
2536 | { |
2299 | { |
2537 | tmp = get_object (); |
2300 | tmp = part->clone (); |
2538 | copy_object (part, tmp); |
|
|
2539 | tmp->x -= src->x; |
2301 | tmp->x -= src->x; |
2540 | tmp->y -= src->y; |
2302 | tmp->y -= src->y; |
2541 | |
2303 | |
2542 | if (!part->head) |
2304 | if (!part->head) |
2543 | { |
2305 | { |
2544 | dst = tmp; |
2306 | dst = tmp; |
2545 | tmp->head = 0; |
2307 | tmp->head = 0; |
2546 | } |
2308 | } |
2547 | else |
2309 | else |
2548 | { |
|
|
2549 | tmp->head = dst; |
2310 | tmp->head = dst; |
2550 | } |
|
|
2551 | |
2311 | |
2552 | tmp->more = 0; |
2312 | tmp->more = 0; |
2553 | |
2313 | |
2554 | if (prev) |
2314 | if (prev) |
2555 | prev->more = tmp; |
2315 | prev->more = tmp; |
… | |
… | |
2567 | /* Basically, we save the content of the string to a temp file, then call */ |
2327 | /* Basically, we save the content of the string to a temp file, then call */ |
2568 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
2328 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
2569 | /* but it was simple to make and allows reusing the load_object function. */ |
2329 | /* but it was simple to make and allows reusing the load_object function. */ |
2570 | /* Remember not to use load_object_str in a time-critical situation. */ |
2330 | /* Remember not to use load_object_str in a time-critical situation. */ |
2571 | /* Also remember that multiparts objects are not supported for now. */ |
2331 | /* Also remember that multiparts objects are not supported for now. */ |
2572 | |
|
|
2573 | object * |
2332 | object * |
2574 | load_object_str (const char *obstr) |
2333 | load_object_str (const char *obstr) |
2575 | { |
2334 | { |
2576 | object *op; |
2335 | object *op; |
2577 | char filename[MAX_BUF]; |
2336 | char filename[MAX_BUF]; |
… | |
… | |
2587 | } |
2346 | } |
2588 | |
2347 | |
2589 | fprintf (tempfile, obstr); |
2348 | fprintf (tempfile, obstr); |
2590 | fclose (tempfile); |
2349 | fclose (tempfile); |
2591 | |
2350 | |
2592 | op = get_object (); |
2351 | op = object::create (); |
2593 | |
2352 | |
2594 | object_thawer thawer (filename); |
2353 | object_thawer thawer (filename); |
2595 | |
2354 | |
2596 | if (thawer) |
2355 | if (thawer) |
2597 | load_object (thawer, op, 0); |
2356 | load_object (thawer, op, 0); |
… | |
… | |
2607 | * returns NULL if no match. |
2366 | * returns NULL if no match. |
2608 | */ |
2367 | */ |
2609 | object * |
2368 | object * |
2610 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2369 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2611 | { |
2370 | { |
2612 | object *tmp; |
|
|
2613 | |
|
|
2614 | for (tmp = who->inv; tmp; tmp = tmp->below) |
2371 | for (object *tmp = who->inv; tmp; tmp = tmp->below) |
2615 | if (tmp->type == type && tmp->subtype == subtype) |
2372 | if (tmp->type == type && tmp->subtype == subtype) |
2616 | return tmp; |
2373 | return tmp; |
2617 | |
2374 | |
2618 | return NULL; |
2375 | return 0; |
2619 | } |
2376 | } |
2620 | |
2377 | |
2621 | /* If ob has a field named key, return the link from the list, |
2378 | /* If ob has a field named key, return the link from the list, |
2622 | * otherwise return NULL. |
2379 | * otherwise return NULL. |
2623 | * |
2380 | * |
… | |
… | |
2625 | * do the desired thing. |
2382 | * do the desired thing. |
2626 | */ |
2383 | */ |
2627 | key_value * |
2384 | key_value * |
2628 | get_ob_key_link (const object *ob, const char *key) |
2385 | get_ob_key_link (const object *ob, const char *key) |
2629 | { |
2386 | { |
2630 | key_value *link; |
|
|
2631 | |
|
|
2632 | for (link = ob->key_values; link != NULL; link = link->next) |
2387 | for (key_value *link = ob->key_values; link; link = link->next) |
2633 | if (link->key == key) |
2388 | if (link->key == key) |
2634 | return link; |
2389 | return link; |
2635 | |
2390 | |
2636 | return NULL; |
2391 | return 0; |
2637 | } |
2392 | } |
2638 | |
2393 | |
2639 | /* |
2394 | /* |
2640 | * Returns the value of op has an extra_field for key, or NULL. |
2395 | * Returns the value of op has an extra_field for key, or NULL. |
2641 | * |
2396 | * |
… | |
… | |
2681 | * Returns TRUE on success. |
2436 | * Returns TRUE on success. |
2682 | */ |
2437 | */ |
2683 | int |
2438 | int |
2684 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
2439 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
2685 | { |
2440 | { |
2686 | key_value * |
|
|
2687 | field = NULL, *last = NULL; |
2441 | key_value *field = NULL, *last = NULL; |
2688 | |
2442 | |
2689 | for (field = op->key_values; field != NULL; field = field->next) |
2443 | for (field = op->key_values; field != NULL; field = field->next) |
2690 | { |
2444 | { |
2691 | if (field->key != canonical_key) |
2445 | if (field->key != canonical_key) |
2692 | { |
2446 | { |
… | |
… | |
2720 | /* IF we get here, key doesn't exist */ |
2474 | /* IF we get here, key doesn't exist */ |
2721 | |
2475 | |
2722 | /* No field, we'll have to add it. */ |
2476 | /* No field, we'll have to add it. */ |
2723 | |
2477 | |
2724 | if (!add_key) |
2478 | if (!add_key) |
2725 | { |
|
|
2726 | return FALSE; |
2479 | return FALSE; |
2727 | } |
2480 | |
2728 | /* There isn't any good reason to store a null |
2481 | /* There isn't any good reason to store a null |
2729 | * value in the key/value list. If the archetype has |
2482 | * value in the key/value list. If the archetype has |
2730 | * this key, then we should also have it, so shouldn't |
2483 | * this key, then we should also have it, so shouldn't |
2731 | * be here. If user wants to store empty strings, |
2484 | * be here. If user wants to store empty strings, |
2732 | * should pass in "" |
2485 | * should pass in "" |
… | |
… | |
2781 | } |
2534 | } |
2782 | else |
2535 | else |
2783 | item = item->env; |
2536 | item = item->env; |
2784 | } |
2537 | } |
2785 | |
2538 | |
|
|
2539 | |
|
|
2540 | const char * |
|
|
2541 | object::flag_desc (char *desc, int len) const |
|
|
2542 | { |
|
|
2543 | char *p = desc; |
|
|
2544 | bool first = true; |
|
|
2545 | |
|
|
2546 | *p = 0; |
|
|
2547 | |
|
|
2548 | for (int i = 0; i < NUM_FLAGS; i++) |
|
|
2549 | { |
|
|
2550 | if (len <= 10) // magic constant! |
|
|
2551 | { |
|
|
2552 | snprintf (p, len, ",..."); |
|
|
2553 | break; |
|
|
2554 | } |
|
|
2555 | |
|
|
2556 | if (flag [i]) |
|
|
2557 | { |
|
|
2558 | int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
|
|
2559 | len -= cnt; |
|
|
2560 | p += cnt; |
|
|
2561 | first = false; |
|
|
2562 | } |
|
|
2563 | } |
|
|
2564 | |
|
|
2565 | return desc; |
|
|
2566 | } |
|
|
2567 | |
2786 | // return a suitable string describing an objetc in enough detail to find it |
2568 | // return a suitable string describing an object in enough detail to find it |
2787 | const char * |
2569 | const char * |
2788 | object::debug_desc (char *info) const |
2570 | object::debug_desc (char *info) const |
2789 | { |
2571 | { |
|
|
2572 | char flagdesc[512]; |
2790 | char info2[256 * 3]; |
2573 | char info2[256 * 4]; |
2791 | char *p = info; |
2574 | char *p = info; |
2792 | |
2575 | |
2793 | p += snprintf (p, 256, "%d=\"%s%s%s\"", |
2576 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2794 | count, |
2577 | count, uuid.seq, |
2795 | &name, |
2578 | &name, |
2796 | title ? " " : "", |
2579 | title ? "\",title:\"" : "", |
2797 | title ? (const char *)title : ""); |
2580 | title ? (const char *)title : "", |
|
|
2581 | flag_desc (flagdesc, 512), type); |
2798 | |
2582 | |
2799 | if (env) |
2583 | if (env) |
2800 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2584 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2801 | |
2585 | |
2802 | if (map) |
2586 | if (map) |
2803 | p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); |
2587 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2804 | |
2588 | |
2805 | return info; |
2589 | return info; |
2806 | } |
2590 | } |
2807 | |
2591 | |
2808 | const char * |
2592 | const char * |
2809 | object::debug_desc () const |
2593 | object::debug_desc () const |
2810 | { |
2594 | { |
2811 | static char info[256 * 3]; |
2595 | static char info[256 * 4]; |
2812 | return debug_desc (info); |
2596 | return debug_desc (info); |
2813 | } |
2597 | } |
2814 | |
2598 | |
|
|
2599 | const char * |
|
|
2600 | object::debug_desc2 () const |
|
|
2601 | { |
|
|
2602 | static char info[256 * 4]; |
|
|
2603 | return debug_desc (info); |
|
|
2604 | } |
|
|
2605 | |