1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game |
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> |
28 | #include <stdio.h> |
29 | #include <stdio.h> |
29 | #include <sys/types.h> |
30 | #include <sys/types.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> |
|
|
34 | #include <sproto.h> |
33 | #include <loader.h> |
35 | #include <loader.h> |
34 | |
36 | |
35 | #include <bitset> |
37 | #include <bitset> |
36 | |
38 | |
37 | int nrofallocobjects = 0; |
39 | int nrofallocobjects = 0; |
38 | static UUID uuid; |
40 | static UUID uuid; |
39 | const uint64 UUID_SKIP = 1<<19; |
41 | const uint64 UUID_SKIP = 1<<19; |
40 | |
42 | |
41 | object *active_objects; /* List of active objects that need to be processed */ |
43 | objectvec objects; |
|
|
44 | activevec actives; |
42 | |
45 | |
43 | 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, |
46 | 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, |
44 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
47 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
45 | }; |
48 | }; |
46 | 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, |
49 | 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, |
… | |
… | |
141 | * objects with lists are rare, and lists stay short. If not, use a |
144 | * objects with lists are rare, and lists stay short. If not, use a |
142 | * different structure or at least keep the lists sorted... |
145 | * different structure or at least keep the lists sorted... |
143 | */ |
146 | */ |
144 | |
147 | |
145 | /* For each field in wants, */ |
148 | /* For each field in wants, */ |
146 | for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next) |
149 | for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next) |
147 | { |
150 | { |
148 | key_value *has_field; |
151 | key_value *has_field; |
149 | |
152 | |
150 | /* Look for a field in has with the same key. */ |
153 | /* Look for a field in has with the same key. */ |
151 | has_field = get_ob_key_link (has, wants_field->key); |
154 | has_field = get_ob_key_link (has, wants_field->key); |
… | |
… | |
190 | * Check nrof variable *before* calling can_merge() |
193 | * Check nrof variable *before* calling can_merge() |
191 | * |
194 | * |
192 | * Improvements made with merge: Better checking on potion, and also |
195 | * Improvements made with merge: Better checking on potion, and also |
193 | * check weight |
196 | * check weight |
194 | */ |
197 | */ |
195 | |
|
|
196 | bool object::can_merge_slow (object *ob1, object *ob2) |
198 | bool object::can_merge_slow (object *ob1, object *ob2) |
197 | { |
199 | { |
198 | /* A couple quicksanity checks */ |
200 | /* A couple quicksanity checks */ |
199 | if (ob1 == ob2 |
201 | if (ob1 == ob2 |
200 | || ob1->type != ob2->type |
202 | || ob1->type != ob2->type |
… | |
… | |
277 | |
279 | |
278 | /* Note sure why the following is the case - either the object has to |
280 | /* Note sure why the following is the case - either the object has to |
279 | * be animated or have a very low speed. Is this an attempted monster |
281 | * be animated or have a very low speed. Is this an attempted monster |
280 | * check? |
282 | * check? |
281 | */ |
283 | */ |
282 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) |
284 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
283 | return 0; |
285 | return 0; |
284 | |
286 | |
285 | switch (ob1->type) |
287 | switch (ob1->type) |
286 | { |
288 | { |
287 | case SCROLL: |
289 | case SCROLL: |
… | |
… | |
323 | sum_weight (object *op) |
325 | sum_weight (object *op) |
324 | { |
326 | { |
325 | long sum; |
327 | long sum; |
326 | object *inv; |
328 | object *inv; |
327 | |
329 | |
328 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
330 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
329 | { |
331 | { |
330 | if (inv->inv) |
332 | if (inv->inv) |
331 | sum_weight (inv); |
333 | sum_weight (inv); |
|
|
334 | |
332 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
335 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
333 | } |
336 | } |
334 | |
337 | |
335 | if (op->type == CONTAINER && op->stats.Str) |
338 | if (op->type == CONTAINER && op->stats.Str) |
336 | sum = (sum * (100 - op->stats.Str)) / 100; |
339 | sum = (sum * (100 - op->stats.Str)) / 100; |
… | |
… | |
356 | /* |
359 | /* |
357 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
360 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
358 | * Some error messages. |
361 | * Some error messages. |
359 | * The result of the dump is stored in the static global errmsg array. |
362 | * The result of the dump is stored in the static global errmsg array. |
360 | */ |
363 | */ |
361 | |
|
|
362 | char * |
364 | char * |
363 | dump_object (object *op) |
365 | dump_object (object *op) |
364 | { |
366 | { |
365 | if (!op) |
367 | if (!op) |
366 | return strdup ("[NULLOBJ]"); |
368 | return strdup ("[NULLOBJ]"); |
367 | |
369 | |
368 | object_freezer freezer; |
370 | object_freezer freezer; |
369 | save_object (freezer, op, 3); |
371 | op->write (freezer); |
370 | return freezer.as_string (); |
372 | return freezer.as_string (); |
371 | } |
373 | } |
372 | |
374 | |
373 | /* |
375 | /* |
374 | * get_nearest_part(multi-object, object 2) returns the part of the |
376 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
391 | } |
393 | } |
392 | |
394 | |
393 | /* |
395 | /* |
394 | * Returns the object which has the count-variable equal to the argument. |
396 | * Returns the object which has the count-variable equal to the argument. |
395 | */ |
397 | */ |
396 | |
|
|
397 | object * |
398 | object * |
398 | find_object (tag_t i) |
399 | find_object (tag_t i) |
399 | { |
400 | { |
400 | for (object *op = object::first; op; op = op->next) |
401 | for_all_objects (op) |
401 | if (op->count == i) |
402 | if (op->count == i) |
402 | return op; |
403 | return op; |
403 | |
404 | |
404 | return 0; |
405 | return 0; |
405 | } |
406 | } |
406 | |
407 | |
407 | /* |
408 | /* |
408 | * Returns the first object which has a name equal to the argument. |
409 | * Returns the first object which has a name equal to the argument. |
409 | * Used only by the patch command, but not all that useful. |
410 | * Used only by the patch command, but not all that useful. |
410 | * Enables features like "patch <name-of-other-player> food 999" |
411 | * Enables features like "patch <name-of-other-player> food 999" |
411 | */ |
412 | */ |
412 | |
|
|
413 | object * |
413 | object * |
414 | find_object_name (const char *str) |
414 | find_object_name (const char *str) |
415 | { |
415 | { |
416 | shstr_cmp str_ (str); |
416 | shstr_cmp str_ (str); |
417 | object *op; |
417 | object *op; |
418 | |
418 | |
419 | for (op = object::first; op != NULL; op = op->next) |
419 | for_all_objects (op) |
420 | if (op->name == str_) |
420 | if (op->name == str_) |
421 | break; |
421 | break; |
422 | |
422 | |
423 | return op; |
423 | return op; |
424 | } |
424 | } |
… | |
… | |
450 | owner = owner->owner; |
450 | owner = owner->owner; |
451 | |
451 | |
452 | this->owner = owner; |
452 | this->owner = owner; |
453 | } |
453 | } |
454 | |
454 | |
|
|
455 | int |
|
|
456 | object::slottype () const |
|
|
457 | { |
|
|
458 | if (type == SKILL) |
|
|
459 | { |
|
|
460 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
461 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
462 | } |
|
|
463 | else |
|
|
464 | { |
|
|
465 | if (slot [body_combat].info) return slot_combat; |
|
|
466 | if (slot [body_range ].info) return slot_ranged; |
|
|
467 | } |
|
|
468 | |
|
|
469 | return slot_none; |
|
|
470 | } |
|
|
471 | |
|
|
472 | bool |
|
|
473 | object::change_weapon (object *ob) |
|
|
474 | { |
|
|
475 | if (current_weapon == ob) |
|
|
476 | return true; |
|
|
477 | |
|
|
478 | if (chosen_skill) |
|
|
479 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
480 | |
|
|
481 | current_weapon = ob; |
|
|
482 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
483 | |
|
|
484 | if (chosen_skill) |
|
|
485 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
486 | |
|
|
487 | if (ob && !ob->flag [FLAG_APPLIED]) |
|
|
488 | { |
|
|
489 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
490 | &name, ob->debug_desc ()); |
|
|
491 | return false; |
|
|
492 | } |
|
|
493 | |
|
|
494 | update_stats (); |
|
|
495 | |
|
|
496 | if (ob) |
|
|
497 | { |
|
|
498 | // now check wether any body locations became invalid, in which case |
|
|
499 | // we cannot apply the weapon at the moment. |
|
|
500 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
501 | if (slot[i].used < 0) |
|
|
502 | { |
|
|
503 | current_weapon = chosen_skill = 0; |
|
|
504 | update_stats (); |
|
|
505 | |
|
|
506 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
507 | "You try to balance your applied items all at once, but the %s is too much. " |
|
|
508 | "You need to unapply some items first.", &ob->name); |
|
|
509 | return false; |
|
|
510 | } |
|
|
511 | |
|
|
512 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
513 | } |
|
|
514 | else |
|
|
515 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
516 | |
|
|
517 | return true; |
|
|
518 | } |
|
|
519 | |
455 | /* Zero the key_values on op, decrementing the shared-string |
520 | /* Zero the key_values on op, decrementing the shared-string |
456 | * refcounts and freeing the links. |
521 | * refcounts and freeing the links. |
457 | */ |
522 | */ |
458 | static void |
523 | static void |
459 | free_key_values (object *op) |
524 | free_key_values (object *op) |
460 | { |
525 | { |
461 | for (key_value *i = op->key_values; i != 0;) |
526 | for (key_value *i = op->key_values; i; ) |
462 | { |
527 | { |
463 | key_value *next = i->next; |
528 | key_value *next = i->next; |
464 | delete i; |
529 | delete i; |
465 | |
530 | |
466 | i = next; |
531 | i = next; |
467 | } |
532 | } |
468 | |
533 | |
469 | op->key_values = 0; |
534 | op->key_values = 0; |
470 | } |
535 | } |
471 | |
536 | |
472 | /* |
537 | object & |
473 | * copy_to first frees everything allocated by the dst object, |
538 | object::operator =(const object &src) |
474 | * and then copies the contents of itself into the second |
|
|
475 | * object, allocating what needs to be allocated. Basically, any |
|
|
476 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
477 | * if the first object is freed, the pointers in the new object |
|
|
478 | * will point at garbage. |
|
|
479 | */ |
|
|
480 | void |
|
|
481 | object::copy_to (object *dst) |
|
|
482 | { |
539 | { |
483 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
540 | bool is_freed = flag [FLAG_FREED]; |
484 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
541 | bool is_removed = flag [FLAG_REMOVED]; |
485 | |
542 | |
486 | *(object_copy *)dst = *this; |
543 | *(object_copy *)this = src; |
487 | |
544 | |
488 | if (self || cb) |
545 | flag [FLAG_FREED] = is_freed; |
489 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst)); |
546 | flag [FLAG_REMOVED] = is_removed; |
490 | |
|
|
491 | if (is_freed) |
|
|
492 | SET_FLAG (dst, FLAG_FREED); |
|
|
493 | |
|
|
494 | if (is_removed) |
|
|
495 | SET_FLAG (dst, FLAG_REMOVED); |
|
|
496 | |
|
|
497 | if (speed < 0) |
|
|
498 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
|
|
499 | |
547 | |
500 | /* Copy over key_values, if any. */ |
548 | /* Copy over key_values, if any. */ |
501 | if (key_values) |
549 | if (src.key_values) |
502 | { |
550 | { |
503 | key_value *tail = 0; |
551 | key_value *tail = 0; |
504 | key_value *i; |
|
|
505 | |
|
|
506 | dst->key_values = 0; |
552 | key_values = 0; |
507 | |
553 | |
508 | for (i = key_values; i; i = i->next) |
554 | for (key_value *i = src.key_values; i; i = i->next) |
509 | { |
555 | { |
510 | key_value *new_link = new key_value; |
556 | key_value *new_link = new key_value; |
511 | |
557 | |
512 | new_link->next = 0; |
558 | new_link->next = 0; |
513 | new_link->key = i->key; |
559 | new_link->key = i->key; |
514 | new_link->value = i->value; |
560 | new_link->value = i->value; |
515 | |
561 | |
516 | /* Try and be clever here, too. */ |
562 | /* Try and be clever here, too. */ |
517 | if (!dst->key_values) |
563 | if (!key_values) |
518 | { |
564 | { |
519 | dst->key_values = new_link; |
565 | key_values = new_link; |
520 | tail = new_link; |
566 | tail = new_link; |
521 | } |
567 | } |
522 | else |
568 | else |
523 | { |
569 | { |
524 | tail->next = new_link; |
570 | tail->next = new_link; |
525 | tail = new_link; |
571 | tail = new_link; |
526 | } |
572 | } |
527 | } |
573 | } |
528 | } |
574 | } |
|
|
575 | } |
529 | |
576 | |
530 | update_ob_speed (dst); |
577 | /* |
|
|
578 | * copy_to first frees everything allocated by the dst object, |
|
|
579 | * and then copies the contents of itself into the second |
|
|
580 | * object, allocating what needs to be allocated. Basically, any |
|
|
581 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
582 | * if the first object is freed, the pointers in the new object |
|
|
583 | * will point at garbage. |
|
|
584 | */ |
|
|
585 | void |
|
|
586 | object::copy_to (object *dst) |
|
|
587 | { |
|
|
588 | *dst = *this; |
|
|
589 | |
|
|
590 | if (speed < 0) |
|
|
591 | dst->speed_left = speed_left - rndm (); |
|
|
592 | |
|
|
593 | dst->set_speed (dst->speed); |
|
|
594 | } |
|
|
595 | |
|
|
596 | void |
|
|
597 | object::instantiate () |
|
|
598 | { |
|
|
599 | if (!uuid.seq) // HACK |
|
|
600 | uuid = gen_uuid (); |
|
|
601 | |
|
|
602 | speed_left = -0.1f; |
|
|
603 | /* copy the body_info to the body_used - this is only really |
|
|
604 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
605 | * by doing so, when a monster is created, it has good starting |
|
|
606 | * values for the body_used info, so when items are created |
|
|
607 | * for it, they can be properly equipped. |
|
|
608 | */ |
|
|
609 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
610 | slot[i].used = slot[i].info; |
|
|
611 | |
|
|
612 | attachable::instantiate (); |
531 | } |
613 | } |
532 | |
614 | |
533 | object * |
615 | object * |
534 | object::clone () |
616 | object::clone () |
535 | { |
617 | { |
… | |
… | |
541 | /* |
623 | /* |
542 | * If an object with the IS_TURNABLE() flag needs to be turned due |
624 | * If an object with the IS_TURNABLE() flag needs to be turned due |
543 | * to the closest player being on the other side, this function can |
625 | * to the closest player being on the other side, this function can |
544 | * be called to update the face variable, _and_ how it looks on the map. |
626 | * be called to update the face variable, _and_ how it looks on the map. |
545 | */ |
627 | */ |
546 | |
|
|
547 | void |
628 | void |
548 | update_turn_face (object *op) |
629 | update_turn_face (object *op) |
549 | { |
630 | { |
550 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL) |
631 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
551 | return; |
632 | return; |
|
|
633 | |
552 | SET_ANIMATION (op, op->direction); |
634 | SET_ANIMATION (op, op->direction); |
553 | update_object (op, UP_OBJ_FACE); |
635 | update_object (op, UP_OBJ_FACE); |
554 | } |
636 | } |
555 | |
637 | |
556 | /* |
638 | /* |
557 | * Updates the speed of an object. If the speed changes from 0 to another |
639 | * Updates the speed of an object. If the speed changes from 0 to another |
558 | * value, or vice versa, then add/remove the object from the active list. |
640 | * value, or vice versa, then add/remove the object from the active list. |
559 | * This function needs to be called whenever the speed of an object changes. |
641 | * This function needs to be called whenever the speed of an object changes. |
560 | */ |
642 | */ |
561 | void |
643 | void |
562 | update_ob_speed (object *op) |
644 | object::set_speed (float speed) |
563 | { |
645 | { |
564 | extern int arch_init; |
646 | if (flag [FLAG_FREED] && speed) |
565 | |
|
|
566 | /* No reason putting the archetypes objects on the speed list, |
|
|
567 | * since they never really need to be updated. |
|
|
568 | */ |
|
|
569 | |
|
|
570 | if (QUERY_FLAG (op, FLAG_FREED) && op->speed) |
|
|
571 | { |
647 | { |
572 | LOG (llevError, "Object %s is freed but has speed.\n", &op->name); |
648 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
573 | #ifdef MANY_CORES |
|
|
574 | abort (); |
|
|
575 | #else |
|
|
576 | op->speed = 0; |
649 | speed = 0; |
577 | #endif |
|
|
578 | } |
|
|
579 | |
|
|
580 | if (arch_init) |
|
|
581 | return; |
|
|
582 | |
|
|
583 | if (FABS (op->speed) > MIN_ACTIVE_SPEED) |
|
|
584 | { |
650 | } |
585 | /* If already on active list, don't do anything */ |
|
|
586 | if (op->active_next || op->active_prev || op == active_objects) |
|
|
587 | return; |
|
|
588 | |
651 | |
589 | /* process_events() expects us to insert the object at the beginning |
652 | this->speed = speed; |
590 | * of the list. */ |
|
|
591 | op->active_next = active_objects; |
|
|
592 | |
653 | |
593 | if (op->active_next != NULL) |
654 | if (has_active_speed ()) |
594 | op->active_next->active_prev = op; |
655 | activate (); |
595 | |
|
|
596 | active_objects = op; |
|
|
597 | } |
|
|
598 | else |
656 | else |
599 | { |
657 | deactivate (); |
600 | /* If not on the active list, nothing needs to be done */ |
|
|
601 | if (!op->active_next && !op->active_prev && op != active_objects) |
|
|
602 | return; |
|
|
603 | |
|
|
604 | if (op->active_prev == NULL) |
|
|
605 | { |
|
|
606 | active_objects = op->active_next; |
|
|
607 | |
|
|
608 | if (op->active_next != NULL) |
|
|
609 | op->active_next->active_prev = NULL; |
|
|
610 | } |
|
|
611 | else |
|
|
612 | { |
|
|
613 | op->active_prev->active_next = op->active_next; |
|
|
614 | |
|
|
615 | if (op->active_next) |
|
|
616 | op->active_next->active_prev = op->active_prev; |
|
|
617 | } |
|
|
618 | |
|
|
619 | op->active_next = NULL; |
|
|
620 | op->active_prev = NULL; |
|
|
621 | } |
|
|
622 | } |
|
|
623 | |
|
|
624 | /* This function removes object 'op' from the list of active |
|
|
625 | * objects. |
|
|
626 | * This should only be used for style maps or other such |
|
|
627 | * reference maps where you don't want an object that isn't |
|
|
628 | * in play chewing up cpu time getting processed. |
|
|
629 | * The reverse of this is to call update_ob_speed, which |
|
|
630 | * will do the right thing based on the speed of the object. |
|
|
631 | */ |
|
|
632 | void |
|
|
633 | remove_from_active_list (object *op) |
|
|
634 | { |
|
|
635 | /* If not on the active list, nothing needs to be done */ |
|
|
636 | if (!op->active_next && !op->active_prev && op != active_objects) |
|
|
637 | return; |
|
|
638 | |
|
|
639 | if (op->active_prev == NULL) |
|
|
640 | { |
|
|
641 | active_objects = op->active_next; |
|
|
642 | if (op->active_next != NULL) |
|
|
643 | op->active_next->active_prev = NULL; |
|
|
644 | } |
|
|
645 | else |
|
|
646 | { |
|
|
647 | op->active_prev->active_next = op->active_next; |
|
|
648 | if (op->active_next) |
|
|
649 | op->active_next->active_prev = op->active_prev; |
|
|
650 | } |
|
|
651 | op->active_next = NULL; |
|
|
652 | op->active_prev = NULL; |
|
|
653 | } |
658 | } |
654 | |
659 | |
655 | /* |
660 | /* |
656 | * update_object() updates the the map. |
661 | * update_object() updates the the map. |
657 | * It takes into account invisible objects (and represent squares covered |
662 | * It takes into account invisible objects (and represent squares covered |
… | |
… | |
670 | * UP_OBJ_FACE: only the objects face has changed. |
675 | * UP_OBJ_FACE: only the objects face has changed. |
671 | */ |
676 | */ |
672 | void |
677 | void |
673 | update_object (object *op, int action) |
678 | update_object (object *op, int action) |
674 | { |
679 | { |
675 | MoveType move_on, move_off, move_block, move_slow; |
|
|
676 | |
|
|
677 | if (op == NULL) |
680 | if (op == NULL) |
678 | { |
681 | { |
679 | /* this should never happen */ |
682 | /* this should never happen */ |
680 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
683 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
681 | return; |
684 | return; |
… | |
… | |
694 | */ |
697 | */ |
695 | if (!op->map || op->map->in_memory == MAP_SAVING) |
698 | if (!op->map || op->map->in_memory == MAP_SAVING) |
696 | return; |
699 | return; |
697 | |
700 | |
698 | /* make sure the object is within map boundaries */ |
701 | /* make sure the object is within map boundaries */ |
699 | if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map)) |
702 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
700 | { |
703 | { |
701 | LOG (llevError, "update_object() called for object out of map!\n"); |
704 | LOG (llevError, "update_object() called for object out of map!\n"); |
702 | #ifdef MANY_CORES |
705 | #ifdef MANY_CORES |
703 | abort (); |
706 | abort (); |
704 | #endif |
707 | #endif |
705 | return; |
708 | return; |
706 | } |
709 | } |
707 | |
710 | |
708 | mapspace &m = op->ms (); |
711 | mapspace &m = op->ms (); |
709 | |
712 | |
710 | if (m.flags_ & P_NEED_UPDATE) |
713 | if (!(m.flags_ & P_UPTODATE)) |
711 | /* nop */; |
714 | /* nop */; |
712 | else if (action == UP_OBJ_INSERT) |
715 | else if (action == UP_OBJ_INSERT) |
713 | { |
716 | { |
714 | // this is likely overkill, TODO: revisit (schmorp) |
717 | // this is likely overkill, TODO: revisit (schmorp) |
715 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
718 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
… | |
… | |
724 | /* This isn't perfect, but I don't expect a lot of objects to |
727 | /* This isn't perfect, but I don't expect a lot of objects to |
725 | * to have move_allow right now. |
728 | * to have move_allow right now. |
726 | */ |
729 | */ |
727 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
730 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
728 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
731 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
729 | m.flags_ = P_NEED_UPDATE; |
732 | m.flags_ = 0; |
730 | } |
733 | } |
731 | /* if the object is being removed, we can't make intelligent |
734 | /* if the object is being removed, we can't make intelligent |
732 | * decisions, because remove_ob can't really pass the object |
735 | * decisions, because remove_ob can't really pass the object |
733 | * that is being removed. |
736 | * that is being removed. |
734 | */ |
737 | */ |
735 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
738 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
736 | m.flags_ = P_NEED_UPDATE; |
739 | m.flags_ = 0; |
737 | else if (action == UP_OBJ_FACE) |
740 | else if (action == UP_OBJ_FACE) |
738 | /* Nothing to do for that case */ ; |
741 | /* Nothing to do for that case */ ; |
739 | else |
742 | else |
740 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
743 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
741 | |
744 | |
742 | if (op->more) |
745 | if (op->more) |
743 | update_object (op->more, action); |
746 | update_object (op->more, action); |
744 | } |
747 | } |
745 | |
748 | |
746 | object::vector object::mortals; |
|
|
747 | object::vector object::objects; // not yet used |
|
|
748 | object *object::first; |
|
|
749 | |
|
|
750 | void object::free_mortals () |
|
|
751 | { |
|
|
752 | for (AUTODECL (i, mortals.begin ()); i != mortals.end ();) |
|
|
753 | if ((*i)->refcnt) |
|
|
754 | ++i; // further delay freeing |
|
|
755 | else |
|
|
756 | { |
|
|
757 | delete *i; |
|
|
758 | mortals.erase (i); |
|
|
759 | } |
|
|
760 | } |
|
|
761 | |
|
|
762 | object::object () |
749 | object::object () |
763 | { |
750 | { |
764 | SET_FLAG (this, FLAG_REMOVED); |
751 | SET_FLAG (this, FLAG_REMOVED); |
765 | |
752 | |
766 | expmul = 1.0; |
753 | expmul = 1.0; |
767 | face = blank_face; |
754 | face = blank_face; |
768 | } |
755 | } |
769 | |
756 | |
770 | object::~object () |
757 | object::~object () |
771 | { |
758 | { |
|
|
759 | unlink (); |
|
|
760 | |
772 | free_key_values (this); |
761 | free_key_values (this); |
773 | } |
762 | } |
774 | |
763 | |
|
|
764 | static int object_count; |
|
|
765 | |
775 | void object::link () |
766 | void object::link () |
776 | { |
767 | { |
777 | count = ++ob_count; |
768 | assert (!index);//D |
778 | uuid = gen_uuid (); |
769 | uuid = gen_uuid (); |
|
|
770 | count = ++object_count; |
779 | |
771 | |
780 | prev = 0; |
772 | refcnt_inc (); |
781 | next = object::first; |
773 | objects.insert (this); |
782 | |
|
|
783 | if (object::first) |
|
|
784 | object::first->prev = this; |
|
|
785 | |
|
|
786 | object::first = this; |
|
|
787 | } |
774 | } |
788 | |
775 | |
789 | void object::unlink () |
776 | void object::unlink () |
790 | { |
777 | { |
791 | if (this == object::first) |
778 | if (!index) |
792 | object::first = next; |
779 | return; |
793 | |
780 | |
794 | /* Remove this object from the list of used objects */ |
781 | objects.erase (this); |
795 | if (prev) prev->next = next; |
782 | refcnt_dec (); |
796 | if (next) next->prev = prev; |
783 | } |
797 | |
784 | |
798 | prev = 0; |
785 | void |
799 | next = 0; |
786 | object::activate () |
|
|
787 | { |
|
|
788 | /* If already on active list, don't do anything */ |
|
|
789 | if (active) |
|
|
790 | return; |
|
|
791 | |
|
|
792 | if (has_active_speed ()) |
|
|
793 | actives.insert (this); |
|
|
794 | } |
|
|
795 | |
|
|
796 | void |
|
|
797 | object::activate_recursive () |
|
|
798 | { |
|
|
799 | activate (); |
|
|
800 | |
|
|
801 | for (object *op = inv; op; op = op->below) |
|
|
802 | op->activate_recursive (); |
|
|
803 | } |
|
|
804 | |
|
|
805 | /* This function removes object 'op' from the list of active |
|
|
806 | * objects. |
|
|
807 | * This should only be used for style maps or other such |
|
|
808 | * reference maps where you don't want an object that isn't |
|
|
809 | * in play chewing up cpu time getting processed. |
|
|
810 | * The reverse of this is to call update_ob_speed, which |
|
|
811 | * will do the right thing based on the speed of the object. |
|
|
812 | */ |
|
|
813 | void |
|
|
814 | object::deactivate () |
|
|
815 | { |
|
|
816 | /* If not on the active list, nothing needs to be done */ |
|
|
817 | if (!active) |
|
|
818 | return; |
|
|
819 | |
|
|
820 | actives.erase (this); |
|
|
821 | } |
|
|
822 | |
|
|
823 | void |
|
|
824 | object::deactivate_recursive () |
|
|
825 | { |
|
|
826 | for (object *op = inv; op; op = op->below) |
|
|
827 | op->deactivate_recursive (); |
|
|
828 | |
|
|
829 | deactivate (); |
|
|
830 | } |
|
|
831 | |
|
|
832 | void |
|
|
833 | object::set_flag_inv (int flag, int value) |
|
|
834 | { |
|
|
835 | for (object *op = inv; op; op = op->below) |
|
|
836 | { |
|
|
837 | op->flag [flag] = value; |
|
|
838 | op->set_flag_inv (flag, value); |
|
|
839 | } |
|
|
840 | } |
|
|
841 | |
|
|
842 | /* |
|
|
843 | * Remove and free all objects in the inventory of the given object. |
|
|
844 | * object.c ? |
|
|
845 | */ |
|
|
846 | void |
|
|
847 | object::destroy_inv (bool drop_to_ground) |
|
|
848 | { |
|
|
849 | // need to check first, because the checks below might segfault |
|
|
850 | // as we might be on an invalid mapspace and crossfire code |
|
|
851 | // is too buggy to ensure that the inventory is empty. |
|
|
852 | // corollary: if you create arrows etc. with stuff in tis inventory, |
|
|
853 | // cf will crash below with off-map x and y |
|
|
854 | if (!inv) |
|
|
855 | return; |
|
|
856 | |
|
|
857 | /* Only if the space blocks everything do we not process - |
|
|
858 | * if some form of movement is allowed, let objects |
|
|
859 | * drop on that space. |
|
|
860 | */ |
|
|
861 | if (!drop_to_ground |
|
|
862 | || !map |
|
|
863 | || map->in_memory != MAP_IN_MEMORY |
|
|
864 | || map->nodrop |
|
|
865 | || ms ().move_block == MOVE_ALL) |
|
|
866 | { |
|
|
867 | while (inv) |
|
|
868 | { |
|
|
869 | inv->destroy_inv (drop_to_ground); |
|
|
870 | inv->destroy (); |
|
|
871 | } |
|
|
872 | } |
|
|
873 | else |
|
|
874 | { /* Put objects in inventory onto this space */ |
|
|
875 | while (inv) |
|
|
876 | { |
|
|
877 | object *op = inv; |
|
|
878 | |
|
|
879 | if (op->flag [FLAG_STARTEQUIP] |
|
|
880 | || op->flag [FLAG_NO_DROP] |
|
|
881 | || op->type == RUNE |
|
|
882 | || op->type == TRAP |
|
|
883 | || op->flag [FLAG_IS_A_TEMPLATE] |
|
|
884 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
|
|
885 | op->destroy (); |
|
|
886 | else |
|
|
887 | map->insert (op, x, y); |
|
|
888 | } |
|
|
889 | } |
800 | } |
890 | } |
801 | |
891 | |
802 | object *object::create () |
892 | object *object::create () |
803 | { |
893 | { |
804 | object *op = new object; |
894 | object *op = new object; |
805 | op->link (); |
895 | op->link (); |
806 | return op; |
896 | return op; |
807 | } |
897 | } |
808 | |
898 | |
809 | /* |
899 | void |
810 | * free_object() frees everything allocated by an object, removes |
900 | object::do_destroy () |
811 | * it from the list of used objects, and puts it on the list of |
|
|
812 | * free objects. The IS_FREED() flag is set in the object. |
|
|
813 | * The object must have been removed by remove_ob() first for |
|
|
814 | * this function to succeed. |
|
|
815 | * |
|
|
816 | * If destroy_inventory is set, free inventory as well. Else drop items in |
|
|
817 | * inventory to the ground. |
|
|
818 | */ |
|
|
819 | void object::destroy (bool destroy_inventory) |
|
|
820 | { |
901 | { |
821 | if (QUERY_FLAG (this, FLAG_FREED)) |
902 | attachable::do_destroy (); |
822 | return; |
|
|
823 | |
903 | |
824 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
904 | if (flag [FLAG_IS_LINKED]) |
|
|
905 | remove_button_link (this); |
|
|
906 | |
|
|
907 | if (flag [FLAG_FRIENDLY]) |
825 | remove_friendly_object (this); |
908 | remove_friendly_object (this); |
826 | |
909 | |
827 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
910 | if (!flag [FLAG_REMOVED]) |
828 | remove (); |
911 | remove (); |
829 | |
912 | |
830 | SET_FLAG (this, FLAG_FREED); |
913 | destroy_inv (true); |
831 | |
914 | |
832 | if (more) |
915 | deactivate (); |
833 | { |
916 | unlink (); |
834 | more->destroy (destroy_inventory); |
|
|
835 | more = 0; |
|
|
836 | } |
|
|
837 | |
917 | |
838 | if (inv) |
918 | flag [FLAG_FREED] = 1; |
839 | { |
|
|
840 | /* Only if the space blocks everything do we not process - |
|
|
841 | * if some form of movement is allowed, let objects |
|
|
842 | * drop on that space. |
|
|
843 | */ |
|
|
844 | if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
|
|
845 | { |
|
|
846 | object *op = inv; |
|
|
847 | |
|
|
848 | while (op) |
|
|
849 | { |
|
|
850 | object *tmp = op->below; |
|
|
851 | op->destroy (destroy_inventory); |
|
|
852 | op = tmp; |
|
|
853 | } |
|
|
854 | } |
|
|
855 | else |
|
|
856 | { /* Put objects in inventory onto this space */ |
|
|
857 | object *op = inv; |
|
|
858 | |
|
|
859 | while (op) |
|
|
860 | { |
|
|
861 | object *tmp = op->below; |
|
|
862 | |
|
|
863 | op->remove (); |
|
|
864 | |
|
|
865 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
|
|
866 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
|
|
867 | op->destroy (); |
|
|
868 | else |
|
|
869 | { |
|
|
870 | op->x = x; |
|
|
871 | op->y = y; |
|
|
872 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
|
|
873 | } |
|
|
874 | |
|
|
875 | op = tmp; |
|
|
876 | } |
|
|
877 | } |
|
|
878 | } |
|
|
879 | |
919 | |
880 | // hack to ensure that freed objects still have a valid map |
920 | // hack to ensure that freed objects still have a valid map |
881 | { |
921 | { |
882 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
922 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
883 | |
923 | |
… | |
… | |
887 | |
927 | |
888 | freed_map->name = "/internal/freed_objects_map"; |
928 | freed_map->name = "/internal/freed_objects_map"; |
889 | freed_map->width = 3; |
929 | freed_map->width = 3; |
890 | freed_map->height = 3; |
930 | freed_map->height = 3; |
891 | |
931 | |
892 | freed_map->allocate (); |
932 | freed_map->alloc (); |
|
|
933 | freed_map->in_memory = MAP_IN_MEMORY; |
893 | } |
934 | } |
894 | |
935 | |
895 | map = freed_map; |
936 | map = freed_map; |
896 | x = 1; |
937 | x = 1; |
897 | y = 1; |
938 | y = 1; |
898 | } |
939 | } |
899 | |
940 | |
|
|
941 | head = 0; |
|
|
942 | |
|
|
943 | if (more) |
|
|
944 | { |
|
|
945 | more->destroy (); |
|
|
946 | more = 0; |
|
|
947 | } |
|
|
948 | |
900 | // clear those pointers that likely might have circular references to us |
949 | // clear those pointers that likely might have circular references to us |
901 | owner = 0; |
950 | owner = 0; |
902 | enemy = 0; |
951 | enemy = 0; |
903 | attacked_by = 0; |
952 | attacked_by = 0; |
|
|
953 | } |
904 | |
954 | |
905 | // only relevant for players(?), but make sure of it anyways |
955 | void |
906 | contr = 0; |
956 | object::destroy (bool destroy_inventory) |
|
|
957 | { |
|
|
958 | if (destroyed ()) |
|
|
959 | return; |
907 | |
960 | |
908 | /* Remove object from the active list */ |
961 | if (destroy_inventory) |
909 | speed = 0; |
962 | destroy_inv (false); |
910 | update_ob_speed (this); |
|
|
911 | |
963 | |
912 | unlink (); |
964 | attachable::destroy (); |
913 | |
|
|
914 | mortals.push_back (this); |
|
|
915 | } |
965 | } |
916 | |
966 | |
917 | /* |
967 | /* |
918 | * sub_weight() recursively (outwards) subtracts a number from the |
968 | * sub_weight() recursively (outwards) subtracts a number from the |
919 | * weight of an object (and what is carried by it's environment(s)). |
969 | * weight of an object (and what is carried by it's environment(s)). |
… | |
… | |
935 | * This function removes the object op from the linked list of objects |
985 | * This function removes the object op from the linked list of objects |
936 | * which it is currently tied to. When this function is done, the |
986 | * which it is currently tied to. When this function is done, the |
937 | * object will have no environment. If the object previously had an |
987 | * object will have no environment. If the object previously had an |
938 | * environment, the x and y coordinates will be updated to |
988 | * environment, the x and y coordinates will be updated to |
939 | * the previous environment. |
989 | * the previous environment. |
940 | * Beware: This function is called from the editor as well! |
|
|
941 | */ |
990 | */ |
942 | void |
991 | void |
943 | object::remove () |
992 | object::do_remove () |
944 | { |
993 | { |
945 | object *tmp, *last = 0; |
994 | object *tmp, *last = 0; |
946 | object *otmp; |
995 | object *otmp; |
947 | |
996 | |
948 | int check_walk_off; |
|
|
949 | |
|
|
950 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
997 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
951 | return; |
998 | return; |
952 | |
999 | |
953 | SET_FLAG (this, FLAG_REMOVED); |
1000 | SET_FLAG (this, FLAG_REMOVED); |
|
|
1001 | INVOKE_OBJECT (REMOVE, this); |
954 | |
1002 | |
955 | if (more) |
1003 | if (more) |
956 | more->remove (); |
1004 | more->remove (); |
957 | |
1005 | |
958 | /* |
1006 | /* |
… | |
… | |
971 | * to save cpu time. |
1019 | * to save cpu time. |
972 | */ |
1020 | */ |
973 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1021 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
974 | otmp->update_stats (); |
1022 | otmp->update_stats (); |
975 | |
1023 | |
976 | if (above != NULL) |
1024 | if (above) |
977 | above->below = below; |
1025 | above->below = below; |
978 | else |
1026 | else |
979 | env->inv = below; |
1027 | env->inv = below; |
980 | |
1028 | |
981 | if (below != NULL) |
1029 | if (below) |
982 | below->above = above; |
1030 | below->above = above; |
983 | |
1031 | |
984 | /* we set up values so that it could be inserted into |
1032 | /* we set up values so that it could be inserted into |
985 | * the map, but we don't actually do that - it is up |
1033 | * the map, but we don't actually do that - it is up |
986 | * to the caller to decide what we want to do. |
1034 | * to the caller to decide what we want to do. |
… | |
… | |
990 | above = 0, below = 0; |
1038 | above = 0, below = 0; |
991 | env = 0; |
1039 | env = 0; |
992 | } |
1040 | } |
993 | else if (map) |
1041 | else if (map) |
994 | { |
1042 | { |
995 | /* Re did the following section of code - it looks like it had |
1043 | if (type == PLAYER) |
996 | * lots of logic for things we no longer care about |
|
|
997 | */ |
1044 | { |
|
|
1045 | // leaving a spot always closes any open container on the ground |
|
|
1046 | if (container && !container->env) |
|
|
1047 | // this causes spurious floorbox updates, but it ensures |
|
|
1048 | // that the CLOSE event is being sent. |
|
|
1049 | close_container (); |
|
|
1050 | |
|
|
1051 | --map->players; |
|
|
1052 | map->touch (); |
|
|
1053 | } |
|
|
1054 | |
|
|
1055 | map->dirty = true; |
|
|
1056 | mapspace &ms = this->ms (); |
998 | |
1057 | |
999 | /* link the object above us */ |
1058 | /* link the object above us */ |
1000 | if (above) |
1059 | if (above) |
1001 | above->below = below; |
1060 | above->below = below; |
1002 | else |
1061 | else |
1003 | map->at (x, y).top = below; /* we were top, set new top */ |
1062 | ms.top = below; /* we were top, set new top */ |
1004 | |
1063 | |
1005 | /* Relink the object below us, if there is one */ |
1064 | /* Relink the object below us, if there is one */ |
1006 | if (below) |
1065 | if (below) |
1007 | below->above = above; |
1066 | below->above = above; |
1008 | else |
1067 | else |
… | |
… | |
1010 | /* Nothing below, which means we need to relink map object for this space |
1069 | /* Nothing below, which means we need to relink map object for this space |
1011 | * use translated coordinates in case some oddness with map tiling is |
1070 | * use translated coordinates in case some oddness with map tiling is |
1012 | * evident |
1071 | * evident |
1013 | */ |
1072 | */ |
1014 | if (GET_MAP_OB (map, x, y) != this) |
1073 | if (GET_MAP_OB (map, x, y) != this) |
1015 | { |
|
|
1016 | char *dump = dump_object (this); |
|
|
1017 | LOG (llevError, |
|
|
1018 | "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); |
1074 | 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 ()); |
1019 | free (dump); |
|
|
1020 | dump = dump_object (GET_MAP_OB (map, x, y)); |
|
|
1021 | LOG (llevError, "%s\n", dump); |
|
|
1022 | free (dump); |
|
|
1023 | } |
|
|
1024 | |
1075 | |
1025 | map->at (x, y).bottom = above; /* goes on above it. */ |
1076 | ms.bot = above; /* goes on above it. */ |
1026 | } |
1077 | } |
1027 | |
1078 | |
1028 | above = 0; |
1079 | above = 0; |
1029 | below = 0; |
1080 | below = 0; |
1030 | |
1081 | |
1031 | if (map->in_memory == MAP_SAVING) |
1082 | if (map->in_memory == MAP_SAVING) |
1032 | return; |
1083 | return; |
1033 | |
1084 | |
1034 | check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY); |
1085 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1035 | |
1086 | |
1036 | for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above) |
1087 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1037 | { |
1088 | { |
1038 | /* No point updating the players look faces if he is the object |
1089 | /* No point updating the players look faces if he is the object |
1039 | * being removed. |
1090 | * being removed. |
1040 | */ |
1091 | */ |
1041 | |
1092 | |
… | |
… | |
1045 | * removed (most likely destroyed), update the player view |
1096 | * removed (most likely destroyed), update the player view |
1046 | * appropriately. |
1097 | * appropriately. |
1047 | */ |
1098 | */ |
1048 | if (tmp->container == this) |
1099 | if (tmp->container == this) |
1049 | { |
1100 | { |
1050 | CLEAR_FLAG (this, FLAG_APPLIED); |
1101 | flag [FLAG_APPLIED] = 0; |
1051 | tmp->container = 0; |
1102 | tmp->container = 0; |
1052 | } |
1103 | } |
1053 | |
1104 | |
|
|
1105 | if (tmp->contr->ns) |
1054 | tmp->contr->ns->floorbox_update (); |
1106 | tmp->contr->ns->floorbox_update (); |
1055 | } |
1107 | } |
1056 | |
1108 | |
1057 | /* See if player moving off should effect something */ |
1109 | /* See if object moving off should effect something */ |
1058 | if (check_walk_off |
1110 | if (check_walk_off |
1059 | && ((move_type & tmp->move_off) |
1111 | && ((move_type & tmp->move_off) |
1060 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1112 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1061 | { |
1113 | { |
1062 | move_apply (tmp, this, 0); |
1114 | move_apply (tmp, this, 0); |
… | |
… | |
1064 | if (destroyed ()) |
1116 | if (destroyed ()) |
1065 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1117 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1066 | } |
1118 | } |
1067 | |
1119 | |
1068 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1120 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1069 | |
1121 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
1070 | if (tmp->above == tmp) |
1122 | if (tmp->above == tmp) |
1071 | tmp->above = 0; |
1123 | tmp->above = 0; |
1072 | |
1124 | |
1073 | last = tmp; |
1125 | last = tmp; |
1074 | } |
1126 | } |
1075 | |
1127 | |
1076 | /* last == NULL of there are no objects on this space */ |
1128 | /* last == NULL if there are no objects on this space */ |
|
|
1129 | //TODO: this makes little sense, why only update the topmost object? |
1077 | if (!last) |
1130 | if (!last) |
1078 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1131 | map->at (x, y).flags_ = 0; |
1079 | else |
1132 | else |
1080 | update_object (last, UP_OBJ_REMOVE); |
1133 | update_object (last, UP_OBJ_REMOVE); |
1081 | |
1134 | |
1082 | if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius) |
1135 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1083 | update_all_los (map, x, y); |
1136 | update_all_los (map, x, y); |
1084 | } |
1137 | } |
1085 | } |
1138 | } |
1086 | |
1139 | |
1087 | /* |
1140 | /* |
… | |
… | |
1096 | merge_ob (object *op, object *top) |
1149 | merge_ob (object *op, object *top) |
1097 | { |
1150 | { |
1098 | if (!op->nrof) |
1151 | if (!op->nrof) |
1099 | return 0; |
1152 | return 0; |
1100 | |
1153 | |
1101 | if (top == NULL) |
1154 | if (top) |
1102 | for (top = op; top != NULL && top->above != NULL; top = top->above); |
1155 | for (top = op; top && top->above; top = top->above) |
|
|
1156 | ; |
1103 | |
1157 | |
1104 | for (; top != NULL; top = top->below) |
1158 | for (; top; top = top->below) |
1105 | { |
1159 | { |
1106 | if (top == op) |
1160 | if (top == op) |
1107 | continue; |
1161 | continue; |
1108 | |
1162 | |
1109 | if (object::can_merge (op, top)) |
1163 | if (object::can_merge (op, top)) |
… | |
… | |
1118 | } |
1172 | } |
1119 | |
1173 | |
1120 | return 0; |
1174 | return 0; |
1121 | } |
1175 | } |
1122 | |
1176 | |
|
|
1177 | void |
|
|
1178 | object::expand_tail () |
|
|
1179 | { |
|
|
1180 | if (more) |
|
|
1181 | return; |
|
|
1182 | |
|
|
1183 | object *prev = this; |
|
|
1184 | |
|
|
1185 | for (archetype *at = arch->more; at; at = at->more) |
|
|
1186 | { |
|
|
1187 | object *op = arch_to_object (at); |
|
|
1188 | |
|
|
1189 | op->name = name; |
|
|
1190 | op->name_pl = name_pl; |
|
|
1191 | op->title = title; |
|
|
1192 | |
|
|
1193 | op->head = this; |
|
|
1194 | prev->more = op; |
|
|
1195 | |
|
|
1196 | prev = op; |
|
|
1197 | } |
|
|
1198 | } |
|
|
1199 | |
1123 | /* |
1200 | /* |
1124 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1201 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1125 | * job preparing multi-part monsters |
1202 | * job preparing multi-part monsters. |
1126 | */ |
1203 | */ |
1127 | object * |
1204 | object * |
1128 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1205 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1129 | { |
1206 | { |
1130 | object *tmp; |
|
|
1131 | |
|
|
1132 | if (op->head) |
|
|
1133 | op = op->head; |
|
|
1134 | |
|
|
1135 | for (tmp = op; tmp; tmp = tmp->more) |
1207 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1136 | { |
1208 | { |
1137 | tmp->x = x + tmp->arch->clone.x; |
1209 | tmp->x = x + tmp->arch->clone.x; |
1138 | tmp->y = y + tmp->arch->clone.y; |
1210 | tmp->y = y + tmp->arch->clone.y; |
1139 | } |
1211 | } |
1140 | |
1212 | |
… | |
… | |
1159 | * Return value: |
1231 | * Return value: |
1160 | * new object if 'op' was merged with other object |
1232 | * new object if 'op' was merged with other object |
1161 | * NULL if 'op' was destroyed |
1233 | * NULL if 'op' was destroyed |
1162 | * just 'op' otherwise |
1234 | * just 'op' otherwise |
1163 | */ |
1235 | */ |
1164 | |
|
|
1165 | object * |
1236 | object * |
1166 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1237 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1167 | { |
1238 | { |
|
|
1239 | assert (!op->flag [FLAG_FREED]); |
|
|
1240 | |
1168 | object *tmp, *top, *floor = NULL; |
1241 | object *tmp, *top, *floor = NULL; |
1169 | sint16 x, y; |
|
|
1170 | |
1242 | |
1171 | if (QUERY_FLAG (op, FLAG_FREED)) |
1243 | op->remove (); |
1172 | { |
|
|
1173 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1174 | return NULL; |
|
|
1175 | } |
|
|
1176 | |
1244 | |
1177 | if (m == NULL) |
1245 | #if 0 |
1178 | { |
1246 | if (!m->active != !op->active) |
1179 | char *dump = dump_object (op); |
1247 | if (m->active) |
1180 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1248 | op->activate_recursive (); |
1181 | free (dump); |
1249 | else |
1182 | return op; |
1250 | op->deactivate_recursive (); |
1183 | } |
1251 | #endif |
1184 | |
1252 | |
1185 | if (out_of_map (m, op->x, op->y)) |
1253 | if (out_of_map (m, op->x, op->y)) |
1186 | { |
1254 | { |
1187 | char *dump = dump_object (op); |
|
|
1188 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1255 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1189 | #ifdef MANY_CORES |
1256 | #ifdef MANY_CORES |
1190 | /* Better to catch this here, as otherwise the next use of this object |
1257 | /* Better to catch this here, as otherwise the next use of this object |
1191 | * is likely to cause a crash. Better to find out where it is getting |
1258 | * is likely to cause a crash. Better to find out where it is getting |
1192 | * improperly inserted. |
1259 | * improperly inserted. |
1193 | */ |
1260 | */ |
1194 | abort (); |
1261 | abort (); |
1195 | #endif |
1262 | #endif |
1196 | free (dump); |
|
|
1197 | return op; |
1263 | return op; |
1198 | } |
1264 | } |
1199 | |
1265 | |
1200 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1201 | { |
|
|
1202 | char *dump = dump_object (op); |
|
|
1203 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1204 | free (dump); |
|
|
1205 | return op; |
|
|
1206 | } |
|
|
1207 | |
|
|
1208 | if (op->more != NULL) |
|
|
1209 | { |
|
|
1210 | /* The part may be on a different map. */ |
|
|
1211 | |
|
|
1212 | object *more = op->more; |
1266 | if (object *more = op->more) |
1213 | |
1267 | { |
1214 | /* We really need the caller to normalize coordinates - if |
|
|
1215 | * we set the map, that doesn't work if the location is within |
|
|
1216 | * a map and this is straddling an edge. So only if coordinate |
|
|
1217 | * is clear wrong do we normalize it. |
|
|
1218 | */ |
|
|
1219 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
|
|
1220 | more->map = get_map_from_coord (m, &more->x, &more->y); |
|
|
1221 | else if (!more->map) |
|
|
1222 | { |
|
|
1223 | /* For backwards compatibility - when not dealing with tiled maps, |
|
|
1224 | * more->map should always point to the parent. |
|
|
1225 | */ |
|
|
1226 | more->map = m; |
|
|
1227 | } |
|
|
1228 | |
|
|
1229 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
1268 | if (!insert_ob_in_map (more, m, originator, flag)) |
1230 | { |
1269 | { |
1231 | if (!op->head) |
1270 | if (!op->head) |
1232 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1271 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1233 | |
1272 | |
1234 | return NULL; |
1273 | return 0; |
1235 | } |
1274 | } |
1236 | } |
1275 | } |
1237 | |
1276 | |
1238 | CLEAR_FLAG (op, FLAG_REMOVED); |
1277 | CLEAR_FLAG (op, FLAG_REMOVED); |
1239 | |
1278 | |
1240 | /* Ideally, the caller figures this out. However, it complicates a lot |
1279 | /* Ideally, the caller figures this out. However, it complicates a lot |
1241 | * of areas of callers (eg, anything that uses find_free_spot would now |
1280 | * of areas of callers (eg, anything that uses find_free_spot would now |
1242 | * need extra work |
1281 | * need extra work |
1243 | */ |
1282 | */ |
1244 | op->map = get_map_from_coord (m, &op->x, &op->y); |
1283 | if (!xy_normalise (m, op->x, op->y)) |
1245 | x = op->x; |
1284 | return 0; |
1246 | y = op->y; |
1285 | |
|
|
1286 | op->map = m; |
|
|
1287 | mapspace &ms = op->ms (); |
1247 | |
1288 | |
1248 | /* this has to be done after we translate the coordinates. |
1289 | /* this has to be done after we translate the coordinates. |
1249 | */ |
1290 | */ |
1250 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1291 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1251 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1292 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1252 | if (object::can_merge (op, tmp)) |
1293 | if (object::can_merge (op, tmp)) |
1253 | { |
1294 | { |
1254 | op->nrof += tmp->nrof; |
1295 | op->nrof += tmp->nrof; |
1255 | tmp->destroy (); |
1296 | tmp->destroy (); |
1256 | } |
1297 | } |
… | |
… | |
1273 | op->below = originator->below; |
1314 | op->below = originator->below; |
1274 | |
1315 | |
1275 | if (op->below) |
1316 | if (op->below) |
1276 | op->below->above = op; |
1317 | op->below->above = op; |
1277 | else |
1318 | else |
1278 | op->ms ().bottom = op; |
1319 | ms.bot = op; |
1279 | |
1320 | |
1280 | /* since *below* originator, no need to update top */ |
1321 | /* since *below* originator, no need to update top */ |
1281 | originator->below = op; |
1322 | originator->below = op; |
1282 | } |
1323 | } |
1283 | else |
1324 | else |
1284 | { |
1325 | { |
|
|
1326 | top = ms.bot; |
|
|
1327 | |
1285 | /* If there are other objects, then */ |
1328 | /* If there are other objects, then */ |
1286 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1329 | if ((!(flag & INS_MAP_LOAD)) && top) |
1287 | { |
1330 | { |
1288 | object *last = NULL; |
1331 | object *last = 0; |
1289 | |
1332 | |
1290 | /* |
1333 | /* |
1291 | * If there are multiple objects on this space, we do some trickier handling. |
1334 | * If there are multiple objects on this space, we do some trickier handling. |
1292 | * We've already dealt with merging if appropriate. |
1335 | * We've already dealt with merging if appropriate. |
1293 | * Generally, we want to put the new object on top. But if |
1336 | * Generally, we want to put the new object on top. But if |
… | |
… | |
1297 | * once we get to them. This reduces the need to traverse over all of |
1340 | * once we get to them. This reduces the need to traverse over all of |
1298 | * them when adding another one - this saves quite a bit of cpu time |
1341 | * them when adding another one - this saves quite a bit of cpu time |
1299 | * when lots of spells are cast in one area. Currently, it is presumed |
1342 | * when lots of spells are cast in one area. Currently, it is presumed |
1300 | * that flying non pickable objects are spell objects. |
1343 | * that flying non pickable objects are spell objects. |
1301 | */ |
1344 | */ |
1302 | |
1345 | for (top = ms.bot; top; top = top->above) |
1303 | while (top != NULL) |
|
|
1304 | { |
1346 | { |
1305 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1347 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1306 | floor = top; |
1348 | floor = top; |
1307 | |
1349 | |
1308 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1350 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1311 | top = top->below; |
1353 | top = top->below; |
1312 | break; |
1354 | break; |
1313 | } |
1355 | } |
1314 | |
1356 | |
1315 | last = top; |
1357 | last = top; |
1316 | top = top->above; |
|
|
1317 | } |
1358 | } |
1318 | |
1359 | |
1319 | /* Don't want top to be NULL, so set it to the last valid object */ |
1360 | /* Don't want top to be NULL, so set it to the last valid object */ |
1320 | top = last; |
1361 | top = last; |
1321 | |
1362 | |
… | |
… | |
1323 | * looks like instead of lots of conditions here. |
1364 | * looks like instead of lots of conditions here. |
1324 | * makes things faster, and effectively the same result. |
1365 | * makes things faster, and effectively the same result. |
1325 | */ |
1366 | */ |
1326 | |
1367 | |
1327 | /* Have object 'fall below' other objects that block view. |
1368 | /* Have object 'fall below' other objects that block view. |
1328 | * Unless those objects are exits, type 66 |
1369 | * Unless those objects are exits. |
1329 | * If INS_ON_TOP is used, don't do this processing |
1370 | * If INS_ON_TOP is used, don't do this processing |
1330 | * Need to find the object that in fact blocks view, otherwise |
1371 | * Need to find the object that in fact blocks view, otherwise |
1331 | * stacking is a bit odd. |
1372 | * stacking is a bit odd. |
1332 | */ |
1373 | */ |
1333 | if (!(flag & INS_ON_TOP) && |
1374 | if (!(flag & INS_ON_TOP) |
1334 | (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1375 | && ms.flags () & P_BLOCKSVIEW |
|
|
1376 | && (op->face && !faces [op->face].visibility)) |
1335 | { |
1377 | { |
1336 | for (last = top; last != floor; last = last->below) |
1378 | for (last = top; last != floor; last = last->below) |
1337 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1379 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1338 | break; |
1380 | break; |
|
|
1381 | |
1339 | /* Check to see if we found the object that blocks view, |
1382 | /* Check to see if we found the object that blocks view, |
1340 | * and make sure we have a below pointer for it so that |
1383 | * and make sure we have a below pointer for it so that |
1341 | * we can get inserted below this one, which requires we |
1384 | * we can get inserted below this one, which requires we |
1342 | * set top to the object below us. |
1385 | * set top to the object below us. |
1343 | */ |
1386 | */ |
… | |
… | |
1345 | top = last->below; |
1388 | top = last->below; |
1346 | } |
1389 | } |
1347 | } /* If objects on this space */ |
1390 | } /* If objects on this space */ |
1348 | |
1391 | |
1349 | if (flag & INS_MAP_LOAD) |
1392 | if (flag & INS_MAP_LOAD) |
1350 | top = GET_MAP_TOP (op->map, op->x, op->y); |
1393 | top = ms.top; |
1351 | |
1394 | |
1352 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1395 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1353 | top = floor; |
1396 | top = floor; |
1354 | |
1397 | |
1355 | /* Top is the object that our object (op) is going to get inserted above. |
1398 | /* Top is the object that our object (op) is going to get inserted above. |
1356 | */ |
1399 | */ |
1357 | |
1400 | |
1358 | /* First object on this space */ |
1401 | /* First object on this space */ |
1359 | if (!top) |
1402 | if (!top) |
1360 | { |
1403 | { |
1361 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1404 | op->above = ms.bot; |
1362 | |
1405 | |
1363 | if (op->above) |
1406 | if (op->above) |
1364 | op->above->below = op; |
1407 | op->above->below = op; |
1365 | |
1408 | |
1366 | op->below = NULL; |
1409 | op->below = 0; |
1367 | op->ms ().bottom = op; |
1410 | ms.bot = op; |
1368 | } |
1411 | } |
1369 | else |
1412 | else |
1370 | { /* get inserted into the stack above top */ |
1413 | { /* get inserted into the stack above top */ |
1371 | op->above = top->above; |
1414 | op->above = top->above; |
1372 | |
1415 | |
… | |
… | |
1375 | |
1418 | |
1376 | op->below = top; |
1419 | op->below = top; |
1377 | top->above = op; |
1420 | top->above = op; |
1378 | } |
1421 | } |
1379 | |
1422 | |
1380 | if (op->above == NULL) |
1423 | if (!op->above) |
1381 | op->ms ().top = op; |
1424 | ms.top = op; |
1382 | } /* else not INS_BELOW_ORIGINATOR */ |
1425 | } /* else not INS_BELOW_ORIGINATOR */ |
1383 | |
1426 | |
1384 | if (op->type == PLAYER) |
1427 | if (op->type == PLAYER) |
|
|
1428 | { |
1385 | op->contr->do_los = 1; |
1429 | op->contr->do_los = 1; |
|
|
1430 | ++op->map->players; |
|
|
1431 | op->map->touch (); |
|
|
1432 | } |
|
|
1433 | |
|
|
1434 | op->map->dirty = true; |
1386 | |
1435 | |
1387 | /* If we have a floor, we know the player, if any, will be above |
1436 | /* If we have a floor, we know the player, if any, will be above |
1388 | * it, so save a few ticks and start from there. |
1437 | * it, so save a few ticks and start from there. |
1389 | */ |
1438 | */ |
1390 | if (!(flag & INS_MAP_LOAD)) |
1439 | if (!(flag & INS_MAP_LOAD)) |
1391 | if (object *pl = op->ms ().player ()) |
1440 | if (object *pl = ms.player ()) |
|
|
1441 | if (pl->contr->ns) |
1392 | pl->contr->ns->floorbox_update (); |
1442 | pl->contr->ns->floorbox_update (); |
1393 | |
1443 | |
1394 | /* If this object glows, it may affect lighting conditions that are |
1444 | /* If this object glows, it may affect lighting conditions that are |
1395 | * visible to others on this map. But update_all_los is really |
1445 | * visible to others on this map. But update_all_los is really |
1396 | * an inefficient way to do this, as it means los for all players |
1446 | * an inefficient way to do this, as it means los for all players |
1397 | * on the map will get recalculated. The players could very well |
1447 | * on the map will get recalculated. The players could very well |
1398 | * be far away from this change and not affected in any way - |
1448 | * be far away from this change and not affected in any way - |
1399 | * this should get redone to only look for players within range, |
1449 | * this should get redone to only look for players within range, |
1400 | * or just updating the P_NEED_UPDATE for spaces within this area |
1450 | * or just updating the P_UPTODATE for spaces within this area |
1401 | * of effect may be sufficient. |
1451 | * of effect may be sufficient. |
1402 | */ |
1452 | */ |
1403 | if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) |
1453 | if (op->map->darkness && (op->glow_radius != 0)) |
1404 | update_all_los (op->map, op->x, op->y); |
1454 | update_all_los (op->map, op->x, op->y); |
1405 | |
1455 | |
1406 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1456 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1407 | update_object (op, UP_OBJ_INSERT); |
1457 | update_object (op, UP_OBJ_INSERT); |
|
|
1458 | |
|
|
1459 | INVOKE_OBJECT (INSERT, op); |
1408 | |
1460 | |
1409 | /* Don't know if moving this to the end will break anything. However, |
1461 | /* Don't know if moving this to the end will break anything. However, |
1410 | * we want to have floorbox_update called before calling this. |
1462 | * we want to have floorbox_update called before calling this. |
1411 | * |
1463 | * |
1412 | * check_move_on() must be after this because code called from |
1464 | * check_move_on() must be after this because code called from |
… | |
… | |
1417 | |
1469 | |
1418 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1470 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1419 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1471 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1420 | { |
1472 | { |
1421 | if (check_move_on (op, originator)) |
1473 | if (check_move_on (op, originator)) |
1422 | return NULL; |
1474 | return 0; |
1423 | |
1475 | |
1424 | /* If we are a multi part object, lets work our way through the check |
1476 | /* If we are a multi part object, lets work our way through the check |
1425 | * walk on's. |
1477 | * walk on's. |
1426 | */ |
1478 | */ |
1427 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1479 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1428 | if (check_move_on (tmp, originator)) |
1480 | if (check_move_on (tmp, originator)) |
1429 | return NULL; |
1481 | return 0; |
1430 | } |
1482 | } |
1431 | |
1483 | |
1432 | return op; |
1484 | return op; |
1433 | } |
1485 | } |
1434 | |
1486 | |
… | |
… | |
1441 | { |
1493 | { |
1442 | object *tmp, *tmp1; |
1494 | object *tmp, *tmp1; |
1443 | |
1495 | |
1444 | /* first search for itself and remove any old instances */ |
1496 | /* first search for itself and remove any old instances */ |
1445 | |
1497 | |
1446 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1498 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1447 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1499 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1448 | tmp->destroy (); |
1500 | tmp->destroy (); |
1449 | |
1501 | |
1450 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1502 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1451 | |
1503 | |
1452 | tmp1->x = op->x; |
1504 | tmp1->x = op->x; |
1453 | tmp1->y = op->y; |
1505 | tmp1->y = op->y; |
1454 | insert_ob_in_map (tmp1, op->map, op, 0); |
1506 | insert_ob_in_map (tmp1, op->map, op, 0); |
|
|
1507 | } |
|
|
1508 | |
|
|
1509 | object * |
|
|
1510 | object::insert_at (object *where, object *originator, int flags) |
|
|
1511 | { |
|
|
1512 | return where->map->insert (this, where->x, where->y, originator, flags); |
1455 | } |
1513 | } |
1456 | |
1514 | |
1457 | /* |
1515 | /* |
1458 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1516 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1459 | * is returned contains nr objects, and the remaining parts contains |
1517 | * is returned contains nr objects, and the remaining parts contains |
1460 | * the rest (or is removed and freed if that number is 0). |
1518 | * the rest (or is removed and freed if that number is 0). |
1461 | * On failure, NULL is returned, and the reason put into the |
1519 | * On failure, NULL is returned, and the reason put into the |
1462 | * global static errmsg array. |
1520 | * global static errmsg array. |
1463 | */ |
1521 | */ |
1464 | |
|
|
1465 | object * |
1522 | object * |
1466 | get_split_ob (object *orig_ob, uint32 nr) |
1523 | get_split_ob (object *orig_ob, uint32 nr) |
1467 | { |
1524 | { |
1468 | object *newob; |
1525 | object *newob; |
1469 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1526 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
… | |
… | |
1500 | * the amount of an object. If the amount reaches 0, the object |
1557 | * the amount of an object. If the amount reaches 0, the object |
1501 | * is subsequently removed and freed. |
1558 | * is subsequently removed and freed. |
1502 | * |
1559 | * |
1503 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1560 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1504 | */ |
1561 | */ |
1505 | |
|
|
1506 | object * |
1562 | object * |
1507 | decrease_ob_nr (object *op, uint32 i) |
1563 | decrease_ob_nr (object *op, uint32 i) |
1508 | { |
1564 | { |
1509 | object *tmp; |
1565 | object *tmp; |
1510 | player *pl; |
|
|
1511 | |
1566 | |
1512 | if (i == 0) /* objects with op->nrof require this check */ |
1567 | if (i == 0) /* objects with op->nrof require this check */ |
1513 | return op; |
1568 | return op; |
1514 | |
1569 | |
1515 | if (i > op->nrof) |
1570 | if (i > op->nrof) |
… | |
… | |
1528 | * IMO, searching through all the players will mostly |
1583 | * IMO, searching through all the players will mostly |
1529 | * likely be quicker than following op->env to the map, |
1584 | * likely be quicker than following op->env to the map, |
1530 | * and then searching the map for a player. |
1585 | * and then searching the map for a player. |
1531 | */ |
1586 | */ |
1532 | if (!tmp) |
1587 | if (!tmp) |
1533 | { |
1588 | for_all_players (pl) |
1534 | for (pl = first_player; pl; pl = pl->next) |
|
|
1535 | if (pl->ob->container == op->env) |
1589 | if (pl->ob->container == op->env) |
1536 | { |
1590 | { |
1537 | tmp = pl->ob; |
1591 | tmp = pl->ob; |
1538 | break; |
1592 | break; |
1539 | } |
1593 | } |
1540 | } |
|
|
1541 | |
1594 | |
1542 | if (i < op->nrof) |
1595 | if (i < op->nrof) |
1543 | { |
1596 | { |
1544 | sub_weight (op->env, op->weight * i); |
1597 | sub_weight (op->env, op->weight * i); |
1545 | op->nrof -= i; |
1598 | op->nrof -= i; |
… | |
… | |
1588 | |
1641 | |
1589 | /* |
1642 | /* |
1590 | * add_weight(object, weight) adds the specified weight to an object, |
1643 | * add_weight(object, weight) adds the specified weight to an object, |
1591 | * and also updates how much the environment(s) is/are carrying. |
1644 | * and also updates how much the environment(s) is/are carrying. |
1592 | */ |
1645 | */ |
1593 | |
|
|
1594 | void |
1646 | void |
1595 | add_weight (object *op, signed long weight) |
1647 | add_weight (object *op, signed long weight) |
1596 | { |
1648 | { |
1597 | while (op != NULL) |
1649 | while (op != NULL) |
1598 | { |
1650 | { |
… | |
… | |
1630 | * inside the object environment. |
1682 | * inside the object environment. |
1631 | * |
1683 | * |
1632 | * The function returns now pointer to inserted item, and return value can |
1684 | * The function returns now pointer to inserted item, and return value can |
1633 | * be != op, if items are merged. -Tero |
1685 | * be != op, if items are merged. -Tero |
1634 | */ |
1686 | */ |
1635 | |
|
|
1636 | object * |
1687 | object * |
1637 | object::insert (object *op) |
1688 | object::insert (object *op) |
1638 | { |
1689 | { |
1639 | object *tmp, *otmp; |
1690 | object *tmp, *otmp; |
1640 | |
1691 | |
… | |
… | |
1695 | if ((op->glow_radius != 0) && map) |
1746 | if ((op->glow_radius != 0) && map) |
1696 | { |
1747 | { |
1697 | #ifdef DEBUG_LIGHTS |
1748 | #ifdef DEBUG_LIGHTS |
1698 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1749 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1699 | #endif /* DEBUG_LIGHTS */ |
1750 | #endif /* DEBUG_LIGHTS */ |
1700 | if (MAP_DARKNESS (map)) |
1751 | if (map->darkness) |
1701 | update_all_los (map, x, y); |
1752 | update_all_los (map, x, y); |
1702 | } |
1753 | } |
1703 | |
1754 | |
1704 | /* Client has no idea of ordering so lets not bother ordering it here. |
1755 | /* Client has no idea of ordering so lets not bother ordering it here. |
1705 | * It sure simplifies this function... |
1756 | * It sure simplifies this function... |
… | |
… | |
1710 | { |
1761 | { |
1711 | op->below = inv; |
1762 | op->below = inv; |
1712 | op->below->above = op; |
1763 | op->below->above = op; |
1713 | inv = op; |
1764 | inv = op; |
1714 | } |
1765 | } |
|
|
1766 | |
|
|
1767 | INVOKE_OBJECT (INSERT, this); |
1715 | |
1768 | |
1716 | return op; |
1769 | return op; |
1717 | } |
1770 | } |
1718 | |
1771 | |
1719 | /* |
1772 | /* |
… | |
… | |
1734 | * |
1787 | * |
1735 | * MSW 2001-07-08: Check all objects on space, not just those below |
1788 | * MSW 2001-07-08: Check all objects on space, not just those below |
1736 | * object being inserted. insert_ob_in_map may not put new objects |
1789 | * object being inserted. insert_ob_in_map may not put new objects |
1737 | * on top. |
1790 | * on top. |
1738 | */ |
1791 | */ |
1739 | |
|
|
1740 | int |
1792 | int |
1741 | check_move_on (object *op, object *originator) |
1793 | check_move_on (object *op, object *originator) |
1742 | { |
1794 | { |
1743 | object *tmp; |
1795 | object *tmp; |
1744 | maptile *m = op->map; |
1796 | maptile *m = op->map; |
… | |
… | |
1771 | |
1823 | |
1772 | /* The objects have to be checked from top to bottom. |
1824 | /* The objects have to be checked from top to bottom. |
1773 | * Hence, we first go to the top: |
1825 | * Hence, we first go to the top: |
1774 | */ |
1826 | */ |
1775 | |
1827 | |
1776 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above) |
1828 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
1777 | { |
1829 | { |
1778 | /* Trim the search when we find the first other spell effect |
1830 | /* Trim the search when we find the first other spell effect |
1779 | * this helps performance so that if a space has 50 spell objects, |
1831 | * this helps performance so that if a space has 50 spell objects, |
1780 | * we don't need to check all of them. |
1832 | * we don't need to check all of them. |
1781 | */ |
1833 | */ |
… | |
… | |
1799 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1851 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1800 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1852 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1801 | { |
1853 | { |
1802 | |
1854 | |
1803 | float |
1855 | float |
1804 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1856 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1805 | |
1857 | |
1806 | if (op->type == PLAYER) |
1858 | if (op->type == PLAYER) |
1807 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1859 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1808 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1860 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1809 | diff /= 4.0; |
1861 | diff /= 4.0; |
… | |
… | |
1836 | /* |
1888 | /* |
1837 | * present_arch(arch, map, x, y) searches for any objects with |
1889 | * present_arch(arch, map, x, y) searches for any objects with |
1838 | * a matching archetype at the given map and coordinates. |
1890 | * a matching archetype at the given map and coordinates. |
1839 | * The first matching object is returned, or NULL if none. |
1891 | * The first matching object is returned, or NULL if none. |
1840 | */ |
1892 | */ |
1841 | |
|
|
1842 | object * |
1893 | object * |
1843 | present_arch (const archetype *at, maptile *m, int x, int y) |
1894 | present_arch (const archetype *at, maptile *m, int x, int y) |
1844 | { |
1895 | { |
1845 | object * |
|
|
1846 | tmp; |
|
|
1847 | |
|
|
1848 | if (m == NULL || out_of_map (m, x, y)) |
1896 | if (!m || out_of_map (m, x, y)) |
1849 | { |
1897 | { |
1850 | LOG (llevError, "Present_arch called outside map.\n"); |
1898 | LOG (llevError, "Present_arch called outside map.\n"); |
1851 | return NULL; |
1899 | return NULL; |
1852 | } |
1900 | } |
1853 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1901 | |
|
|
1902 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1854 | if (tmp->arch == at) |
1903 | if (tmp->arch == at) |
1855 | return tmp; |
1904 | return tmp; |
|
|
1905 | |
1856 | return NULL; |
1906 | return NULL; |
1857 | } |
1907 | } |
1858 | |
1908 | |
1859 | /* |
1909 | /* |
1860 | * present(type, map, x, y) searches for any objects with |
1910 | * present(type, map, x, y) searches for any objects with |
1861 | * a matching type variable at the given map and coordinates. |
1911 | * a matching type variable at the given map and coordinates. |
1862 | * The first matching object is returned, or NULL if none. |
1912 | * The first matching object is returned, or NULL if none. |
1863 | */ |
1913 | */ |
1864 | |
|
|
1865 | object * |
1914 | object * |
1866 | present (unsigned char type, maptile *m, int x, int y) |
1915 | present (unsigned char type, maptile *m, int x, int y) |
1867 | { |
1916 | { |
1868 | object * |
|
|
1869 | tmp; |
|
|
1870 | |
|
|
1871 | if (out_of_map (m, x, y)) |
1917 | if (out_of_map (m, x, y)) |
1872 | { |
1918 | { |
1873 | LOG (llevError, "Present called outside map.\n"); |
1919 | LOG (llevError, "Present called outside map.\n"); |
1874 | return NULL; |
1920 | return NULL; |
1875 | } |
1921 | } |
1876 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1922 | |
|
|
1923 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1877 | if (tmp->type == type) |
1924 | if (tmp->type == type) |
1878 | return tmp; |
1925 | return tmp; |
|
|
1926 | |
1879 | return NULL; |
1927 | return NULL; |
1880 | } |
1928 | } |
1881 | |
1929 | |
1882 | /* |
1930 | /* |
1883 | * present_in_ob(type, object) searches for any objects with |
1931 | * present_in_ob(type, object) searches for any objects with |
1884 | * a matching type variable in the inventory of the given object. |
1932 | * a matching type variable in the inventory of the given object. |
1885 | * The first matching object is returned, or NULL if none. |
1933 | * The first matching object is returned, or NULL if none. |
1886 | */ |
1934 | */ |
1887 | |
|
|
1888 | object * |
1935 | object * |
1889 | present_in_ob (unsigned char type, const object *op) |
1936 | present_in_ob (unsigned char type, const object *op) |
1890 | { |
1937 | { |
1891 | object * |
|
|
1892 | tmp; |
|
|
1893 | |
|
|
1894 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1938 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1895 | if (tmp->type == type) |
1939 | if (tmp->type == type) |
1896 | return tmp; |
1940 | return tmp; |
|
|
1941 | |
1897 | return NULL; |
1942 | return NULL; |
1898 | } |
1943 | } |
1899 | |
1944 | |
1900 | /* |
1945 | /* |
1901 | * present_in_ob (type, str, object) searches for any objects with |
1946 | * present_in_ob (type, str, object) searches for any objects with |
… | |
… | |
1909 | * str is the string to match against. Note that we match against |
1954 | * str is the string to match against. Note that we match against |
1910 | * the object name, not the archetype name. this is so that the |
1955 | * the object name, not the archetype name. this is so that the |
1911 | * spell code can use one object type (force), but change it's name |
1956 | * spell code can use one object type (force), but change it's name |
1912 | * to be unique. |
1957 | * to be unique. |
1913 | */ |
1958 | */ |
1914 | |
|
|
1915 | object * |
1959 | object * |
1916 | present_in_ob_by_name (int type, const char *str, const object *op) |
1960 | present_in_ob_by_name (int type, const char *str, const object *op) |
1917 | { |
1961 | { |
1918 | object * |
|
|
1919 | tmp; |
|
|
1920 | |
|
|
1921 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1962 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1922 | { |
|
|
1923 | if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) |
1963 | if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) |
1924 | return tmp; |
1964 | return tmp; |
1925 | } |
1965 | |
1926 | return NULL; |
1966 | return 0; |
1927 | } |
1967 | } |
1928 | |
1968 | |
1929 | /* |
1969 | /* |
1930 | * present_arch_in_ob(archetype, object) searches for any objects with |
1970 | * present_arch_in_ob(archetype, object) searches for any objects with |
1931 | * a matching archetype in the inventory of the given object. |
1971 | * a matching archetype in the inventory of the given object. |
1932 | * The first matching object is returned, or NULL if none. |
1972 | * The first matching object is returned, or NULL if none. |
1933 | */ |
1973 | */ |
1934 | |
|
|
1935 | object * |
1974 | object * |
1936 | present_arch_in_ob (const archetype *at, const object *op) |
1975 | present_arch_in_ob (const archetype *at, const object *op) |
1937 | { |
1976 | { |
1938 | object * |
|
|
1939 | tmp; |
|
|
1940 | |
|
|
1941 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1977 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1942 | if (tmp->arch == at) |
1978 | if (tmp->arch == at) |
1943 | return tmp; |
1979 | return tmp; |
|
|
1980 | |
1944 | return NULL; |
1981 | return NULL; |
1945 | } |
1982 | } |
1946 | |
1983 | |
1947 | /* |
1984 | /* |
1948 | * activate recursively a flag on an object inventory |
1985 | * activate recursively a flag on an object inventory |
1949 | */ |
1986 | */ |
1950 | void |
1987 | void |
1951 | flag_inv (object *op, int flag) |
1988 | flag_inv (object *op, int flag) |
1952 | { |
1989 | { |
1953 | object * |
|
|
1954 | tmp; |
|
|
1955 | |
|
|
1956 | if (op->inv) |
1990 | if (op->inv) |
1957 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1991 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1958 | { |
1992 | { |
1959 | SET_FLAG (tmp, flag); |
1993 | SET_FLAG (tmp, flag); |
1960 | flag_inv (tmp, flag); |
1994 | flag_inv (tmp, flag); |
1961 | } |
1995 | } |
1962 | } /* |
1996 | } |
|
|
1997 | |
|
|
1998 | /* |
1963 | * desactivate recursively a flag on an object inventory |
1999 | * deactivate recursively a flag on an object inventory |
1964 | */ |
2000 | */ |
1965 | void |
2001 | void |
1966 | unflag_inv (object *op, int flag) |
2002 | unflag_inv (object *op, int flag) |
1967 | { |
2003 | { |
1968 | object * |
|
|
1969 | tmp; |
|
|
1970 | |
|
|
1971 | if (op->inv) |
2004 | if (op->inv) |
1972 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2005 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1973 | { |
2006 | { |
1974 | CLEAR_FLAG (tmp, flag); |
2007 | CLEAR_FLAG (tmp, flag); |
1975 | unflag_inv (tmp, flag); |
2008 | unflag_inv (tmp, flag); |
1976 | } |
2009 | } |
1977 | } |
2010 | } |
… | |
… | |
1980 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
2013 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
1981 | * all it's inventory (recursively). |
2014 | * all it's inventory (recursively). |
1982 | * If checksums are used, a player will get set_cheat called for |
2015 | * If checksums are used, a player will get set_cheat called for |
1983 | * him/her-self and all object carried by a call to this function. |
2016 | * him/her-self and all object carried by a call to this function. |
1984 | */ |
2017 | */ |
1985 | |
|
|
1986 | void |
2018 | void |
1987 | set_cheat (object *op) |
2019 | set_cheat (object *op) |
1988 | { |
2020 | { |
1989 | SET_FLAG (op, FLAG_WAS_WIZ); |
2021 | SET_FLAG (op, FLAG_WAS_WIZ); |
1990 | flag_inv (op, FLAG_WAS_WIZ); |
2022 | flag_inv (op, FLAG_WAS_WIZ); |
… | |
… | |
2009 | * because arch_blocked (now ob_blocked) needs to know the movement type |
2041 | * because arch_blocked (now ob_blocked) needs to know the movement type |
2010 | * to know if the space in question will block the object. We can't use |
2042 | * to know if the space in question will block the object. We can't use |
2011 | * the archetype because that isn't correct if the monster has been |
2043 | * the archetype because that isn't correct if the monster has been |
2012 | * customized, changed states, etc. |
2044 | * customized, changed states, etc. |
2013 | */ |
2045 | */ |
2014 | |
|
|
2015 | int |
2046 | int |
2016 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2047 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2017 | { |
2048 | { |
2018 | int |
|
|
2019 | i, |
|
|
2020 | index = 0, flag; |
2049 | int index = 0, flag; |
2021 | static int |
|
|
2022 | altern[SIZEOFFREE]; |
2050 | int altern[SIZEOFFREE]; |
2023 | |
2051 | |
2024 | for (i = start; i < stop; i++) |
2052 | for (int i = start; i < stop; i++) |
2025 | { |
2053 | { |
2026 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
2054 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
2027 | if (!flag) |
2055 | if (!flag) |
2028 | altern[index++] = i; |
2056 | altern [index++] = i; |
2029 | |
2057 | |
2030 | /* Basically, if we find a wall on a space, we cut down the search size. |
2058 | /* Basically, if we find a wall on a space, we cut down the search size. |
2031 | * In this way, we won't return spaces that are on another side of a wall. |
2059 | * In this way, we won't return spaces that are on another side of a wall. |
2032 | * This mostly work, but it cuts down the search size in all directions - |
2060 | * This mostly work, but it cuts down the search size in all directions - |
2033 | * if the space being examined only has a wall to the north and empty |
2061 | * if the space being examined only has a wall to the north and empty |
… | |
… | |
2040 | } |
2068 | } |
2041 | |
2069 | |
2042 | if (!index) |
2070 | if (!index) |
2043 | return -1; |
2071 | return -1; |
2044 | |
2072 | |
2045 | return altern[RANDOM () % index]; |
2073 | return altern [rndm (index)]; |
2046 | } |
2074 | } |
2047 | |
2075 | |
2048 | /* |
2076 | /* |
2049 | * find_first_free_spot(archetype, maptile, x, y) works like |
2077 | * find_first_free_spot(archetype, maptile, x, y) works like |
2050 | * find_free_spot(), but it will search max number of squares. |
2078 | * find_free_spot(), but it will search max number of squares. |
2051 | * But it will return the first available spot, not a random choice. |
2079 | * But it will return the first available spot, not a random choice. |
2052 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2080 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2053 | */ |
2081 | */ |
2054 | |
|
|
2055 | int |
2082 | int |
2056 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2083 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2057 | { |
2084 | { |
2058 | int |
|
|
2059 | i; |
|
|
2060 | |
|
|
2061 | for (i = 0; i < SIZEOFFREE; i++) |
2085 | for (int i = 0; i < SIZEOFFREE; i++) |
2062 | { |
|
|
2063 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2086 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2064 | return i; |
2087 | return i; |
2065 | } |
2088 | |
2066 | return -1; |
2089 | return -1; |
2067 | } |
2090 | } |
2068 | |
2091 | |
2069 | /* |
2092 | /* |
2070 | * The function permute(arr, begin, end) randomly reorders the array |
2093 | * The function permute(arr, begin, end) randomly reorders the array |
2071 | * arr[begin..end-1]. |
2094 | * arr[begin..end-1]. |
|
|
2095 | * now uses a fisher-yates shuffle, old permute was broken |
2072 | */ |
2096 | */ |
2073 | static void |
2097 | static void |
2074 | permute (int *arr, int begin, int end) |
2098 | permute (int *arr, int begin, int end) |
2075 | { |
2099 | { |
2076 | int |
2100 | arr += begin; |
2077 | i, |
|
|
2078 | j, |
|
|
2079 | tmp, |
|
|
2080 | len; |
|
|
2081 | |
|
|
2082 | len = end - begin; |
2101 | end -= begin; |
2083 | for (i = begin; i < end; i++) |
|
|
2084 | { |
|
|
2085 | j = begin + RANDOM () % len; |
|
|
2086 | |
2102 | |
2087 | tmp = arr[i]; |
2103 | while (--end) |
2088 | arr[i] = arr[j]; |
2104 | swap (arr [end], arr [rndm (end + 1)]); |
2089 | arr[j] = tmp; |
|
|
2090 | } |
|
|
2091 | } |
2105 | } |
2092 | |
2106 | |
2093 | /* new function to make monster searching more efficient, and effective! |
2107 | /* new function to make monster searching more efficient, and effective! |
2094 | * This basically returns a randomized array (in the passed pointer) of |
2108 | * This basically returns a randomized array (in the passed pointer) of |
2095 | * the spaces to find monsters. In this way, it won't always look for |
2109 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2098 | * the 3x3 area will be searched, just not in a predictable order. |
2112 | * the 3x3 area will be searched, just not in a predictable order. |
2099 | */ |
2113 | */ |
2100 | void |
2114 | void |
2101 | get_search_arr (int *search_arr) |
2115 | get_search_arr (int *search_arr) |
2102 | { |
2116 | { |
2103 | int |
2117 | int i; |
2104 | i; |
|
|
2105 | |
2118 | |
2106 | for (i = 0; i < SIZEOFFREE; i++) |
2119 | for (i = 0; i < SIZEOFFREE; i++) |
2107 | { |
|
|
2108 | search_arr[i] = i; |
2120 | search_arr[i] = i; |
2109 | } |
|
|
2110 | |
2121 | |
2111 | permute (search_arr, 1, SIZEOFFREE1 + 1); |
2122 | permute (search_arr, 1, SIZEOFFREE1 + 1); |
2112 | permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); |
2123 | permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); |
2113 | permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); |
2124 | permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); |
2114 | } |
2125 | } |
… | |
… | |
2123 | * Perhaps incorrectly, but I'm making the assumption that exclude |
2134 | * Perhaps incorrectly, but I'm making the assumption that exclude |
2124 | * is actually want is going to try and move there. We need this info |
2135 | * is actually want is going to try and move there. We need this info |
2125 | * because we have to know what movement the thing looking to move |
2136 | * because we have to know what movement the thing looking to move |
2126 | * there is capable of. |
2137 | * there is capable of. |
2127 | */ |
2138 | */ |
2128 | |
|
|
2129 | int |
2139 | int |
2130 | find_dir (maptile *m, int x, int y, object *exclude) |
2140 | find_dir (maptile *m, int x, int y, object *exclude) |
2131 | { |
2141 | { |
2132 | int |
|
|
2133 | i, |
|
|
2134 | max = SIZEOFFREE, mflags; |
2142 | int i, max = SIZEOFFREE, mflags; |
2135 | |
2143 | |
2136 | sint16 nx, ny; |
2144 | sint16 nx, ny; |
2137 | object * |
2145 | object *tmp; |
2138 | tmp; |
|
|
2139 | maptile * |
2146 | maptile *mp; |
2140 | mp; |
|
|
2141 | |
2147 | |
2142 | MoveType blocked, move_type; |
2148 | MoveType blocked, move_type; |
2143 | |
2149 | |
2144 | if (exclude && exclude->head) |
2150 | if (exclude && exclude->head) |
2145 | { |
2151 | { |
… | |
… | |
2162 | |
2168 | |
2163 | if (mflags & P_OUT_OF_MAP) |
2169 | if (mflags & P_OUT_OF_MAP) |
2164 | max = maxfree[i]; |
2170 | max = maxfree[i]; |
2165 | else |
2171 | else |
2166 | { |
2172 | { |
2167 | blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); |
2173 | mapspace &ms = mp->at (nx, ny); |
|
|
2174 | |
|
|
2175 | blocked = ms.move_block; |
2168 | |
2176 | |
2169 | if ((move_type & blocked) == move_type) |
2177 | if ((move_type & blocked) == move_type) |
2170 | max = maxfree[i]; |
2178 | max = maxfree[i]; |
2171 | else if (mflags & P_IS_ALIVE) |
2179 | else if (mflags & P_IS_ALIVE) |
2172 | { |
2180 | { |
2173 | for (tmp = GET_MAP_OB (mp, nx, ny); tmp; tmp = tmp->above) |
2181 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2174 | if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2182 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
|
|
2183 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2175 | break; |
2184 | break; |
2176 | |
2185 | |
2177 | if (tmp) |
2186 | if (tmp) |
2178 | return freedir[i]; |
2187 | return freedir[i]; |
2179 | } |
2188 | } |
… | |
… | |
2185 | |
2194 | |
2186 | /* |
2195 | /* |
2187 | * distance(object 1, object 2) will return the square of the |
2196 | * distance(object 1, object 2) will return the square of the |
2188 | * distance between the two given objects. |
2197 | * distance between the two given objects. |
2189 | */ |
2198 | */ |
2190 | |
|
|
2191 | int |
2199 | int |
2192 | distance (const object *ob1, const object *ob2) |
2200 | distance (const object *ob1, const object *ob2) |
2193 | { |
2201 | { |
2194 | int i; |
|
|
2195 | |
|
|
2196 | i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2202 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2197 | return i; |
|
|
2198 | } |
2203 | } |
2199 | |
2204 | |
2200 | /* |
2205 | /* |
2201 | * find_dir_2(delta-x,delta-y) will return a direction in which |
2206 | * find_dir_2(delta-x,delta-y) will return a direction in which |
2202 | * an object which has subtracted the x and y coordinates of another |
2207 | * an object which has subtracted the x and y coordinates of another |
2203 | * object, needs to travel toward it. |
2208 | * object, needs to travel toward it. |
2204 | */ |
2209 | */ |
2205 | |
|
|
2206 | int |
2210 | int |
2207 | find_dir_2 (int x, int y) |
2211 | find_dir_2 (int x, int y) |
2208 | { |
2212 | { |
2209 | int q; |
2213 | int q; |
2210 | |
2214 | |
… | |
… | |
2239 | |
2243 | |
2240 | return 3; |
2244 | return 3; |
2241 | } |
2245 | } |
2242 | |
2246 | |
2243 | /* |
2247 | /* |
2244 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
2245 | * the "absolute" direction of a number (it actually takes care of |
|
|
2246 | * "overflow" in previous calculations of a direction). |
|
|
2247 | */ |
|
|
2248 | |
|
|
2249 | int |
|
|
2250 | absdir (int d) |
|
|
2251 | { |
|
|
2252 | while (d < 1) |
|
|
2253 | d += 8; |
|
|
2254 | while (d > 8) |
|
|
2255 | d -= 8; |
|
|
2256 | return d; |
|
|
2257 | } |
|
|
2258 | |
|
|
2259 | /* |
|
|
2260 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2248 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2261 | * between two directions (which are expected to be absolute (see absdir()) |
2249 | * between two directions (which are expected to be absolute (see absdir()) |
2262 | */ |
2250 | */ |
2263 | |
|
|
2264 | int |
2251 | int |
2265 | dirdiff (int dir1, int dir2) |
2252 | dirdiff (int dir1, int dir2) |
2266 | { |
2253 | { |
2267 | int |
2254 | int d; |
2268 | d; |
|
|
2269 | |
2255 | |
2270 | d = abs (dir1 - dir2); |
2256 | d = abs (dir1 - dir2); |
2271 | if (d > 4) |
2257 | if (d > 4) |
2272 | d = 8 - d; |
2258 | d = 8 - d; |
|
|
2259 | |
2273 | return d; |
2260 | return d; |
2274 | } |
2261 | } |
2275 | |
2262 | |
2276 | /* peterm: |
2263 | /* peterm: |
2277 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2264 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
… | |
… | |
2280 | * This basically means that if direction is 15, then it could either go |
2267 | * This basically means that if direction is 15, then it could either go |
2281 | * direction 4, 14, or 16 to get back to where we are. |
2268 | * direction 4, 14, or 16 to get back to where we are. |
2282 | * Moved from spell_util.c to object.c with the other related direction |
2269 | * Moved from spell_util.c to object.c with the other related direction |
2283 | * functions. |
2270 | * functions. |
2284 | */ |
2271 | */ |
2285 | |
|
|
2286 | int |
|
|
2287 | reduction_dir[SIZEOFFREE][3] = { |
2272 | int reduction_dir[SIZEOFFREE][3] = { |
2288 | {0, 0, 0}, /* 0 */ |
2273 | {0, 0, 0}, /* 0 */ |
2289 | {0, 0, 0}, /* 1 */ |
2274 | {0, 0, 0}, /* 1 */ |
2290 | {0, 0, 0}, /* 2 */ |
2275 | {0, 0, 0}, /* 2 */ |
2291 | {0, 0, 0}, /* 3 */ |
2276 | {0, 0, 0}, /* 3 */ |
2292 | {0, 0, 0}, /* 4 */ |
2277 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2436 | insert_ob_in_ob (object_create_clone (item), dst); |
2421 | insert_ob_in_ob (object_create_clone (item), dst); |
2437 | |
2422 | |
2438 | return dst; |
2423 | return dst; |
2439 | } |
2424 | } |
2440 | |
2425 | |
2441 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2442 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2443 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2444 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2445 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2446 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2447 | |
|
|
2448 | object * |
|
|
2449 | load_object_str (const char *obstr) |
|
|
2450 | { |
|
|
2451 | object *op; |
|
|
2452 | char filename[MAX_BUF]; |
|
|
2453 | |
|
|
2454 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2455 | |
|
|
2456 | FILE *tempfile = fopen (filename, "w"); |
|
|
2457 | |
|
|
2458 | if (tempfile == NULL) |
|
|
2459 | { |
|
|
2460 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2461 | return NULL; |
|
|
2462 | } |
|
|
2463 | |
|
|
2464 | fprintf (tempfile, obstr); |
|
|
2465 | fclose (tempfile); |
|
|
2466 | |
|
|
2467 | op = object::create (); |
|
|
2468 | |
|
|
2469 | object_thawer thawer (filename); |
|
|
2470 | |
|
|
2471 | if (thawer) |
|
|
2472 | load_object (thawer, op, 0); |
|
|
2473 | |
|
|
2474 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2475 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2476 | |
|
|
2477 | return op; |
|
|
2478 | } |
|
|
2479 | |
|
|
2480 | /* This returns the first object in who's inventory that |
2426 | /* This returns the first object in who's inventory that |
2481 | * has the same type and subtype match. |
2427 | * has the same type and subtype match. |
2482 | * returns NULL if no match. |
2428 | * returns NULL if no match. |
2483 | */ |
2429 | */ |
2484 | object * |
2430 | object * |
2485 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2431 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2486 | { |
2432 | { |
2487 | object *tmp; |
|
|
2488 | |
|
|
2489 | for (tmp = who->inv; tmp; tmp = tmp->below) |
2433 | for (object *tmp = who->inv; tmp; tmp = tmp->below) |
2490 | if (tmp->type == type && tmp->subtype == subtype) |
2434 | if (tmp->type == type && tmp->subtype == subtype) |
2491 | return tmp; |
2435 | return tmp; |
2492 | |
2436 | |
2493 | return NULL; |
2437 | return 0; |
2494 | } |
2438 | } |
2495 | |
2439 | |
2496 | /* If ob has a field named key, return the link from the list, |
2440 | /* If ob has a field named key, return the link from the list, |
2497 | * otherwise return NULL. |
2441 | * otherwise return NULL. |
2498 | * |
2442 | * |
… | |
… | |
2500 | * do the desired thing. |
2444 | * do the desired thing. |
2501 | */ |
2445 | */ |
2502 | key_value * |
2446 | key_value * |
2503 | get_ob_key_link (const object *ob, const char *key) |
2447 | get_ob_key_link (const object *ob, const char *key) |
2504 | { |
2448 | { |
2505 | key_value *link; |
|
|
2506 | |
|
|
2507 | for (link = ob->key_values; link != NULL; link = link->next) |
2449 | for (key_value *link = ob->key_values; link; link = link->next) |
2508 | if (link->key == key) |
2450 | if (link->key == key) |
2509 | return link; |
2451 | return link; |
2510 | |
2452 | |
2511 | return NULL; |
2453 | return 0; |
2512 | } |
2454 | } |
2513 | |
2455 | |
2514 | /* |
2456 | /* |
2515 | * Returns the value of op has an extra_field for key, or NULL. |
2457 | * Returns the value of op has an extra_field for key, or NULL. |
2516 | * |
2458 | * |
… | |
… | |
2541 | if (link->key == canonical_key) |
2483 | if (link->key == canonical_key) |
2542 | return link->value; |
2484 | return link->value; |
2543 | |
2485 | |
2544 | return 0; |
2486 | return 0; |
2545 | } |
2487 | } |
2546 | |
|
|
2547 | |
2488 | |
2548 | /* |
2489 | /* |
2549 | * Updates the canonical_key in op to value. |
2490 | * Updates the canonical_key in op to value. |
2550 | * |
2491 | * |
2551 | * canonical_key is a shared string (value doesn't have to be). |
2492 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2556 | * Returns TRUE on success. |
2497 | * Returns TRUE on success. |
2557 | */ |
2498 | */ |
2558 | int |
2499 | int |
2559 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
2500 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
2560 | { |
2501 | { |
2561 | key_value * |
|
|
2562 | field = NULL, *last = NULL; |
2502 | key_value *field = NULL, *last = NULL; |
2563 | |
2503 | |
2564 | for (field = op->key_values; field != NULL; field = field->next) |
2504 | for (field = op->key_values; field != NULL; field = field->next) |
2565 | { |
2505 | { |
2566 | if (field->key != canonical_key) |
2506 | if (field->key != canonical_key) |
2567 | { |
2507 | { |
… | |
… | |
2595 | /* IF we get here, key doesn't exist */ |
2535 | /* IF we get here, key doesn't exist */ |
2596 | |
2536 | |
2597 | /* No field, we'll have to add it. */ |
2537 | /* No field, we'll have to add it. */ |
2598 | |
2538 | |
2599 | if (!add_key) |
2539 | if (!add_key) |
2600 | { |
|
|
2601 | return FALSE; |
2540 | return FALSE; |
2602 | } |
2541 | |
2603 | /* There isn't any good reason to store a null |
2542 | /* There isn't any good reason to store a null |
2604 | * value in the key/value list. If the archetype has |
2543 | * value in the key/value list. If the archetype has |
2605 | * this key, then we should also have it, so shouldn't |
2544 | * this key, then we should also have it, so shouldn't |
2606 | * be here. If user wants to store empty strings, |
2545 | * be here. If user wants to store empty strings, |
2607 | * should pass in "" |
2546 | * should pass in "" |
… | |
… | |
2656 | } |
2595 | } |
2657 | else |
2596 | else |
2658 | item = item->env; |
2597 | item = item->env; |
2659 | } |
2598 | } |
2660 | |
2599 | |
|
|
2600 | |
|
|
2601 | const char * |
|
|
2602 | object::flag_desc (char *desc, int len) const |
|
|
2603 | { |
|
|
2604 | char *p = desc; |
|
|
2605 | bool first = true; |
|
|
2606 | |
|
|
2607 | *p = 0; |
|
|
2608 | |
|
|
2609 | for (int i = 0; i < NUM_FLAGS; i++) |
|
|
2610 | { |
|
|
2611 | if (len <= 10) // magic constant! |
|
|
2612 | { |
|
|
2613 | snprintf (p, len, ",..."); |
|
|
2614 | break; |
|
|
2615 | } |
|
|
2616 | |
|
|
2617 | if (flag [i]) |
|
|
2618 | { |
|
|
2619 | int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
|
|
2620 | len -= cnt; |
|
|
2621 | p += cnt; |
|
|
2622 | first = false; |
|
|
2623 | } |
|
|
2624 | } |
|
|
2625 | |
|
|
2626 | return desc; |
|
|
2627 | } |
|
|
2628 | |
2661 | // return a suitable string describing an objetc in enough detail to find it |
2629 | // return a suitable string describing an object in enough detail to find it |
2662 | const char * |
2630 | const char * |
2663 | object::debug_desc (char *info) const |
2631 | object::debug_desc (char *info) const |
2664 | { |
2632 | { |
|
|
2633 | char flagdesc[512]; |
2665 | char info2[256 * 3]; |
2634 | char info2[256 * 4]; |
2666 | char *p = info; |
2635 | char *p = info; |
2667 | |
2636 | |
2668 | p += snprintf (p, 256, "%d=\"%s%s%s\"", |
2637 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2669 | count, |
2638 | count, uuid.seq, |
2670 | &name, |
2639 | &name, |
2671 | title ? " " : "", |
2640 | title ? "\",title:\"" : "", |
2672 | title ? (const char *)title : ""); |
2641 | title ? (const char *)title : "", |
|
|
2642 | flag_desc (flagdesc, 512), type); |
2673 | |
2643 | |
2674 | if (env) |
2644 | if (env) |
2675 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2645 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2676 | |
2646 | |
2677 | if (map) |
2647 | if (map) |
2678 | p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); |
2648 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2679 | |
2649 | |
2680 | return info; |
2650 | return info; |
2681 | } |
2651 | } |
2682 | |
2652 | |
2683 | const char * |
2653 | const char * |
2684 | object::debug_desc () const |
2654 | object::debug_desc () const |
2685 | { |
2655 | { |
2686 | static char info[256 * 3]; |
2656 | static char info[3][256 * 4]; |
|
|
2657 | static int info_idx; |
|
|
2658 | |
2687 | return debug_desc (info); |
2659 | return debug_desc (info [++info_idx % 3]); |
2688 | } |
2660 | } |
2689 | |
2661 | |
|
|
2662 | struct region * |
|
|
2663 | object::region () const |
|
|
2664 | { |
|
|
2665 | return map ? map->region (x, y) |
|
|
2666 | : region::default_region (); |
|
|
2667 | } |
|
|
2668 | |
|
|
2669 | const materialtype_t * |
|
|
2670 | object::dominant_material () const |
|
|
2671 | { |
|
|
2672 | if (materialtype_t *mat = name_to_material (materialname)) |
|
|
2673 | return mat; |
|
|
2674 | |
|
|
2675 | // omfg this is slow, this has to be temporary :) |
|
|
2676 | shstr unknown ("unknown"); |
|
|
2677 | |
|
|
2678 | return name_to_material (unknown); |
|
|
2679 | } |
|
|
2680 | |
|
|
2681 | void |
|
|
2682 | object::open_container (object *new_container) |
|
|
2683 | { |
|
|
2684 | if (container == new_container) |
|
|
2685 | return; |
|
|
2686 | |
|
|
2687 | if (object *old_container = container) |
|
|
2688 | { |
|
|
2689 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2690 | return; |
|
|
2691 | |
|
|
2692 | #if 0 |
|
|
2693 | // remove the "Close old_container" object. |
|
|
2694 | if (object *closer = old_container->inv) |
|
|
2695 | if (closer->type == CLOSE_CON) |
|
|
2696 | closer->destroy (); |
|
|
2697 | #endif |
|
|
2698 | |
|
|
2699 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2700 | container = 0; |
|
|
2701 | |
|
|
2702 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2703 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2704 | } |
|
|
2705 | |
|
|
2706 | if (new_container) |
|
|
2707 | { |
|
|
2708 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2709 | return; |
|
|
2710 | |
|
|
2711 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2712 | #if 0 |
|
|
2713 | // insert the "Close Container" object. |
|
|
2714 | if (archetype *closer = new_container->other_arch) |
|
|
2715 | { |
|
|
2716 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2717 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2718 | new_container->insert (closer); |
|
|
2719 | } |
|
|
2720 | #endif |
|
|
2721 | |
|
|
2722 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2723 | |
|
|
2724 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2725 | container = new_container; |
|
|
2726 | |
|
|
2727 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2728 | esrv_send_inventory (this, new_container); |
|
|
2729 | } |
|
|
2730 | } |
|
|
2731 | |
|
|
2732 | |