1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * 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 |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your option) any later version. |
12 | * |
12 | * |
13 | * 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * 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 |
19 | * along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
26 | sub/add_weight will transcend the environment updating the carrying |
25 | sub/add_weight will transcend the environment updating the carrying |
27 | variable. */ |
26 | variable. */ |
… | |
… | |
29 | #include <stdio.h> |
28 | #include <stdio.h> |
30 | #include <sys/types.h> |
29 | #include <sys/types.h> |
31 | #include <sys/uio.h> |
30 | #include <sys/uio.h> |
32 | #include <object.h> |
31 | #include <object.h> |
33 | #include <funcpoint.h> |
32 | #include <funcpoint.h> |
|
|
33 | #include <sproto.h> |
34 | #include <loader.h> |
34 | #include <loader.h> |
35 | |
35 | |
36 | #include <bitset> |
36 | #include <bitset> |
37 | |
37 | |
38 | int nrofallocobjects = 0; |
38 | UUID UUID::cur; |
39 | static UUID uuid; |
|
|
40 | const uint64 UUID_SKIP = 1<<19; |
39 | static const uint64 UUID_SKIP = 1<<19; |
41 | |
40 | |
42 | objectvec objects; |
41 | objectvec objects; |
43 | activevec actives; |
42 | activevec actives; |
44 | |
43 | |
45 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
44 | 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, |
… | |
… | |
70 | { |
69 | { |
71 | LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); |
70 | LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); |
72 | return; |
71 | return; |
73 | } |
72 | } |
74 | |
73 | |
75 | fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2); |
74 | fprintf (fp, "<1,%llx>\n", (unsigned long long)UUID::cur.seq + UUID_SKIP * 2); |
76 | fclose (fp); |
75 | fclose (fp); |
77 | rename (filename2, filename1); |
76 | rename (filename2, filename1); |
78 | } |
77 | } |
79 | |
78 | |
80 | static void |
79 | static void |
… | |
… | |
89 | if (!(fp = fopen (filename, "r"))) |
88 | if (!(fp = fopen (filename, "r"))) |
90 | { |
89 | { |
91 | if (errno == ENOENT) |
90 | if (errno == ENOENT) |
92 | { |
91 | { |
93 | LOG (llevInfo, "RESET uid to 1\n"); |
92 | LOG (llevInfo, "RESET uid to 1\n"); |
94 | uuid.seq = 0; |
93 | UUID::cur.seq = 0; |
95 | write_uuid (); |
94 | write_uuid (); |
96 | return; |
95 | return; |
97 | } |
96 | } |
98 | |
97 | |
99 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
98 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
… | |
… | |
106 | { |
105 | { |
107 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
106 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
108 | _exit (1); |
107 | _exit (1); |
109 | } |
108 | } |
110 | |
109 | |
111 | uuid.seq = uid; |
110 | UUID::cur.seq = uid; |
112 | write_uuid (); |
111 | write_uuid (); |
113 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
112 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
114 | fclose (fp); |
113 | fclose (fp); |
115 | } |
114 | } |
116 | |
115 | |
117 | UUID |
116 | UUID |
118 | gen_uuid () |
117 | UUID::gen () |
119 | { |
118 | { |
120 | UUID uid; |
119 | UUID uid; |
121 | |
120 | |
122 | uid.seq = ++uuid.seq; |
121 | uid.seq = ++cur.seq; |
123 | |
122 | |
124 | if (!(uuid.seq & (UUID_SKIP - 1))) |
123 | if (!(cur.seq & (UUID_SKIP - 1))) |
125 | write_uuid (); |
124 | write_uuid (); |
126 | |
125 | |
127 | return uid; |
126 | return uid; |
128 | } |
127 | } |
129 | |
128 | |
130 | void |
129 | void |
131 | init_uuid () |
130 | UUID::init () |
132 | { |
131 | { |
133 | read_uuid (); |
132 | read_uuid (); |
134 | } |
133 | } |
135 | |
134 | |
136 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
135 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
… | |
… | |
254 | /* This is really a spellbook check - really, we should |
253 | /* This is really a spellbook check - really, we should |
255 | * check all objects in the inventory. |
254 | * check all objects in the inventory. |
256 | */ |
255 | */ |
257 | if (ob1->inv || ob2->inv) |
256 | if (ob1->inv || ob2->inv) |
258 | { |
257 | { |
259 | /* if one object has inventory but the other doesn't, not equiv */ |
258 | if (!(ob1->inv && ob2->inv)) |
260 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
259 | return 0; /* inventories differ in length */ |
261 | return 0; |
|
|
262 | |
260 | |
263 | /* Now check to see if the two inventory objects could merge */ |
261 | if (ob1->inv->below || ob2->inv->below) |
|
|
262 | return 0; /* more than one object in inv */ |
|
|
263 | |
264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
265 | return 0; |
265 | return 0; /* inventory objexts differ */ |
266 | |
266 | |
267 | /* inventory ok - still need to check rest of this object to see |
267 | /* inventory ok - still need to check rest of this object to see |
268 | * if it is valid. |
268 | * if it is valid. |
269 | */ |
269 | */ |
270 | } |
270 | } |
… | |
… | |
299 | return 0; |
299 | return 0; |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
301 | return 0; |
301 | return 0; |
302 | } |
302 | } |
303 | |
303 | |
304 | //TODO: generate an event or call into perl for additional checks |
|
|
305 | if (ob1->self || ob2->self) |
304 | if (ob1->self || ob2->self) |
306 | { |
305 | { |
307 | ob1->optimise (); |
306 | ob1->optimise (); |
308 | ob2->optimise (); |
307 | ob2->optimise (); |
309 | |
308 | |
310 | if (ob1->self || ob2->self) |
309 | if (ob1->self || ob2->self) |
|
|
310 | { |
|
|
311 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
|
|
312 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
|
|
313 | |
|
|
314 | if (k1 != k2) |
311 | return 0; |
315 | return 0; |
|
|
316 | else if (k1 == 0) |
|
|
317 | return 1; |
|
|
318 | else if (!cfperl_can_merge (ob1, ob2)) |
|
|
319 | return 0; |
|
|
320 | } |
312 | } |
321 | } |
313 | |
322 | |
314 | /* Everything passes, must be OK. */ |
323 | /* Everything passes, must be OK. */ |
315 | return 1; |
324 | return 1; |
316 | } |
325 | } |
… | |
… | |
324 | sum_weight (object *op) |
333 | sum_weight (object *op) |
325 | { |
334 | { |
326 | long sum; |
335 | long sum; |
327 | object *inv; |
336 | object *inv; |
328 | |
337 | |
329 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
338 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
330 | { |
339 | { |
331 | if (inv->inv) |
340 | if (inv->inv) |
332 | sum_weight (inv); |
341 | sum_weight (inv); |
|
|
342 | |
333 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
343 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
334 | } |
344 | } |
335 | |
345 | |
336 | if (op->type == CONTAINER && op->stats.Str) |
346 | if (op->type == CONTAINER && op->stats.Str) |
337 | sum = (sum * (100 - op->stats.Str)) / 100; |
347 | sum = (sum * (100 - op->stats.Str)) / 100; |
… | |
… | |
373 | /* |
383 | /* |
374 | * get_nearest_part(multi-object, object 2) returns the part of the |
384 | * get_nearest_part(multi-object, object 2) returns the part of the |
375 | * multi-object 1 which is closest to the second object. |
385 | * multi-object 1 which is closest to the second object. |
376 | * If it's not a multi-object, it is returned. |
386 | * If it's not a multi-object, it is returned. |
377 | */ |
387 | */ |
378 | |
|
|
379 | object * |
388 | object * |
380 | get_nearest_part (object *op, const object *pl) |
389 | get_nearest_part (object *op, const object *pl) |
381 | { |
390 | { |
382 | object *tmp, *closest; |
391 | object *tmp, *closest; |
383 | int last_dist, i; |
392 | int last_dist, i; |
… | |
… | |
419 | break; |
428 | break; |
420 | |
429 | |
421 | return op; |
430 | return op; |
422 | } |
431 | } |
423 | |
432 | |
424 | void |
|
|
425 | free_all_object_data () |
|
|
426 | { |
|
|
427 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
428 | } |
|
|
429 | |
|
|
430 | /* |
433 | /* |
431 | * Sets the owner and sets the skill and exp pointers to owner's current |
434 | * Sets the owner and sets the skill and exp pointers to owner's current |
432 | * skill and experience objects. |
435 | * skill and experience objects. |
|
|
436 | * ACTUALLY NO! investigate! TODO |
433 | */ |
437 | */ |
434 | void |
438 | void |
435 | object::set_owner (object *owner) |
439 | object::set_owner (object *owner) |
436 | { |
440 | { |
|
|
441 | // allow objects which own objects |
437 | if (!owner) |
442 | if (owner) |
438 | return; |
|
|
439 | |
|
|
440 | /* next line added to allow objects which own objects */ |
|
|
441 | /* Add a check for ownercounts in here, as I got into an endless loop |
|
|
442 | * with the fireball owning a poison cloud which then owned the |
|
|
443 | * fireball. I believe that was caused by one of the objects getting |
|
|
444 | * freed and then another object replacing it. Since the ownercounts |
|
|
445 | * didn't match, this check is valid and I believe that cause is valid. |
|
|
446 | */ |
|
|
447 | while (owner->owner) |
443 | while (owner->owner) |
448 | owner = owner->owner; |
444 | owner = owner->owner; |
|
|
445 | |
|
|
446 | if (flag [FLAG_FREED]) |
|
|
447 | { |
|
|
448 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
|
|
449 | return; |
|
|
450 | } |
449 | |
451 | |
450 | this->owner = owner; |
452 | this->owner = owner; |
|
|
453 | } |
|
|
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 | update_stats (); |
|
|
488 | |
|
|
489 | if (ob) |
|
|
490 | { |
|
|
491 | // now check wether any body locations became invalid, in which case |
|
|
492 | // we cannot apply the weapon at the moment. |
|
|
493 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
494 | if (slot[i].used < 0) |
|
|
495 | { |
|
|
496 | current_weapon = chosen_skill = 0; |
|
|
497 | update_stats (); |
|
|
498 | |
|
|
499 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
500 | "You try to balance all your items at once, " |
|
|
501 | "but the %s is just too much for your body. " |
|
|
502 | "[You need to unapply some items first.]", &ob->name); |
|
|
503 | return false; |
|
|
504 | } |
|
|
505 | |
|
|
506 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
507 | } |
|
|
508 | else |
|
|
509 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
510 | |
|
|
511 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
512 | { |
|
|
513 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
514 | &name, ob->debug_desc ()); |
|
|
515 | return false; |
|
|
516 | } |
|
|
517 | |
|
|
518 | return true; |
451 | } |
519 | } |
452 | |
520 | |
453 | /* Zero the key_values on op, decrementing the shared-string |
521 | /* Zero the key_values on op, decrementing the shared-string |
454 | * refcounts and freeing the links. |
522 | * refcounts and freeing the links. |
455 | */ |
523 | */ |
… | |
… | |
519 | object::copy_to (object *dst) |
587 | object::copy_to (object *dst) |
520 | { |
588 | { |
521 | *dst = *this; |
589 | *dst = *this; |
522 | |
590 | |
523 | if (speed < 0) |
591 | if (speed < 0) |
524 | dst->speed_left = speed_left - rndm (); |
592 | dst->speed_left -= rndm (); |
525 | |
593 | |
526 | dst->set_speed (dst->speed); |
594 | dst->set_speed (dst->speed); |
527 | } |
595 | } |
528 | |
596 | |
529 | void |
597 | void |
530 | object::instantiate () |
598 | object::instantiate () |
531 | { |
599 | { |
532 | if (!uuid.seq) // HACK |
600 | if (!uuid.seq) // HACK |
533 | uuid = gen_uuid (); |
601 | uuid = UUID::gen (); |
534 | |
602 | |
535 | speed_left = -0.1f; |
603 | speed_left = -0.1f; |
536 | /* copy the body_info to the body_used - this is only really |
604 | /* copy the body_info to the body_used - this is only really |
537 | * need for monsters, but doesn't hurt to do it for everything. |
605 | * need for monsters, but doesn't hurt to do it for everything. |
538 | * by doing so, when a monster is created, it has good starting |
606 | * by doing so, when a monster is created, it has good starting |
539 | * values for the body_used info, so when items are created |
607 | * values for the body_used info, so when items are created |
540 | * for it, they can be properly equipped. |
608 | * for it, they can be properly equipped. |
541 | */ |
609 | */ |
542 | memcpy (body_used, body_info, sizeof (body_used)); |
610 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
611 | slot[i].used = slot[i].info; |
543 | |
612 | |
544 | attachable::instantiate (); |
613 | attachable::instantiate (); |
545 | } |
614 | } |
546 | |
615 | |
547 | object * |
616 | object * |
… | |
… | |
696 | static int object_count; |
765 | static int object_count; |
697 | |
766 | |
698 | void object::link () |
767 | void object::link () |
699 | { |
768 | { |
700 | assert (!index);//D |
769 | assert (!index);//D |
701 | uuid = gen_uuid (); |
770 | uuid = UUID::gen (); |
702 | count = ++object_count; |
771 | count = ++object_count; |
703 | |
772 | |
704 | refcnt_inc (); |
773 | refcnt_inc (); |
705 | objects.insert (this); |
774 | objects.insert (this); |
706 | } |
775 | } |
… | |
… | |
835 | |
904 | |
836 | if (flag [FLAG_IS_LINKED]) |
905 | if (flag [FLAG_IS_LINKED]) |
837 | remove_button_link (this); |
906 | remove_button_link (this); |
838 | |
907 | |
839 | if (flag [FLAG_FRIENDLY]) |
908 | if (flag [FLAG_FRIENDLY]) |
840 | { |
|
|
841 | remove_friendly_object (this); |
909 | remove_friendly_object (this); |
842 | |
|
|
843 | if (type == GOLEM |
|
|
844 | && owner |
|
|
845 | && owner->type == PLAYER |
|
|
846 | && owner->contr->ranges[range_golem] == this) |
|
|
847 | owner->contr->ranges[range_golem] = 0; |
|
|
848 | } |
|
|
849 | |
910 | |
850 | if (!flag [FLAG_REMOVED]) |
911 | if (!flag [FLAG_REMOVED]) |
851 | remove (); |
912 | remove (); |
852 | |
913 | |
853 | destroy_inv (true); |
914 | destroy_inv (true); |
… | |
… | |
863 | |
924 | |
864 | if (!freed_map) |
925 | if (!freed_map) |
865 | { |
926 | { |
866 | freed_map = new maptile; |
927 | freed_map = new maptile; |
867 | |
928 | |
|
|
929 | freed_map->path = "<freed objects map>"; |
868 | freed_map->name = "/internal/freed_objects_map"; |
930 | freed_map->name = "/internal/freed_objects_map"; |
869 | freed_map->width = 3; |
931 | freed_map->width = 3; |
870 | freed_map->height = 3; |
932 | freed_map->height = 3; |
|
|
933 | freed_map->nodrop = 1; |
871 | |
934 | |
872 | freed_map->alloc (); |
935 | freed_map->alloc (); |
873 | freed_map->in_memory = MAP_IN_MEMORY; |
936 | freed_map->in_memory = MAP_IN_MEMORY; |
874 | } |
937 | } |
875 | |
938 | |
876 | map = freed_map; |
939 | map = freed_map; |
877 | x = 1; |
940 | x = 1; |
878 | y = 1; |
941 | y = 1; |
879 | } |
942 | } |
880 | |
943 | |
881 | head = 0; |
|
|
882 | |
|
|
883 | if (more) |
944 | if (more) |
884 | { |
945 | { |
885 | more->destroy (); |
946 | more->destroy (); |
886 | more = 0; |
947 | more = 0; |
887 | } |
948 | } |
888 | |
949 | |
|
|
950 | head = 0; |
|
|
951 | |
889 | // clear those pointers that likely might have circular references to us |
952 | // clear those pointers that likely might cause circular references |
890 | owner = 0; |
953 | owner = 0; |
891 | enemy = 0; |
954 | enemy = 0; |
892 | attacked_by = 0; |
955 | attacked_by = 0; |
|
|
956 | current_weapon = 0; |
893 | } |
957 | } |
894 | |
958 | |
895 | void |
959 | void |
896 | object::destroy (bool destroy_inventory) |
960 | object::destroy (bool destroy_inventory) |
897 | { |
961 | { |
898 | if (destroyed ()) |
962 | if (destroyed ()) |
899 | return; |
963 | return; |
900 | |
964 | |
901 | if (destroy_inventory) |
965 | if (destroy_inventory) |
902 | destroy_inv (false); |
966 | destroy_inv (false); |
|
|
967 | |
|
|
968 | if (is_head ()) |
|
|
969 | if (sound_destroy) |
|
|
970 | play_sound (sound_destroy); |
|
|
971 | else if (flag [FLAG_MONSTER]) |
|
|
972 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
903 | |
973 | |
904 | attachable::destroy (); |
974 | attachable::destroy (); |
905 | } |
975 | } |
906 | |
976 | |
907 | /* |
977 | /* |
… | |
… | |
1022 | if (map->in_memory == MAP_SAVING) |
1092 | if (map->in_memory == MAP_SAVING) |
1023 | return; |
1093 | return; |
1024 | |
1094 | |
1025 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1095 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1026 | |
1096 | |
|
|
1097 | if (object *pl = ms.player ()) |
|
|
1098 | { |
|
|
1099 | if (pl->container == this) |
|
|
1100 | /* If a container that the player is currently using somehow gets |
|
|
1101 | * removed (most likely destroyed), update the player view |
|
|
1102 | * appropriately. |
|
|
1103 | */ |
|
|
1104 | pl->close_container (); |
|
|
1105 | |
|
|
1106 | pl->contr->ns->floorbox_update (); |
|
|
1107 | } |
|
|
1108 | |
1027 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1109 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1028 | { |
1110 | { |
1029 | /* No point updating the players look faces if he is the object |
1111 | /* No point updating the players look faces if he is the object |
1030 | * being removed. |
1112 | * being removed. |
1031 | */ |
1113 | */ |
1032 | |
|
|
1033 | if (tmp->type == PLAYER && tmp != this) |
|
|
1034 | { |
|
|
1035 | /* If a container that the player is currently using somehow gets |
|
|
1036 | * removed (most likely destroyed), update the player view |
|
|
1037 | * appropriately. |
|
|
1038 | */ |
|
|
1039 | if (tmp->container == this) |
|
|
1040 | { |
|
|
1041 | flag [FLAG_APPLIED] = 0; |
|
|
1042 | tmp->container = 0; |
|
|
1043 | } |
|
|
1044 | |
|
|
1045 | if (tmp->contr->ns) |
|
|
1046 | tmp->contr->ns->floorbox_update (); |
|
|
1047 | } |
|
|
1048 | |
1114 | |
1049 | /* See if object moving off should effect something */ |
1115 | /* See if object moving off should effect something */ |
1050 | if (check_walk_off |
1116 | if (check_walk_off |
1051 | && ((move_type & tmp->move_off) |
1117 | && ((move_type & tmp->move_off) |
1052 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1118 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
… | |
… | |
1055 | |
1121 | |
1056 | if (destroyed ()) |
1122 | if (destroyed ()) |
1057 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1123 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1058 | } |
1124 | } |
1059 | |
1125 | |
1060 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1061 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1062 | if (tmp->above == tmp) |
|
|
1063 | tmp->above = 0; |
|
|
1064 | |
|
|
1065 | last = tmp; |
1126 | last = tmp; |
1066 | } |
1127 | } |
1067 | |
1128 | |
1068 | /* last == NULL if there are no objects on this space */ |
1129 | /* last == NULL if there are no objects on this space */ |
1069 | //TODO: this makes little sense, why only update the topmost object? |
1130 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1089 | merge_ob (object *op, object *top) |
1150 | merge_ob (object *op, object *top) |
1090 | { |
1151 | { |
1091 | if (!op->nrof) |
1152 | if (!op->nrof) |
1092 | return 0; |
1153 | return 0; |
1093 | |
1154 | |
1094 | if (top) |
1155 | if (!top) |
1095 | for (top = op; top && top->above; top = top->above) |
1156 | for (top = op; top && top->above; top = top->above) |
1096 | ; |
1157 | ; |
1097 | |
1158 | |
1098 | for (; top; top = top->below) |
1159 | for (; top; top = top->below) |
1099 | { |
1160 | { |
… | |
… | |
1112 | } |
1173 | } |
1113 | |
1174 | |
1114 | return 0; |
1175 | return 0; |
1115 | } |
1176 | } |
1116 | |
1177 | |
|
|
1178 | void |
|
|
1179 | object::expand_tail () |
|
|
1180 | { |
|
|
1181 | if (more) |
|
|
1182 | return; |
|
|
1183 | |
|
|
1184 | object *prev = this; |
|
|
1185 | |
|
|
1186 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
|
|
1187 | { |
|
|
1188 | object *op = arch_to_object (at); |
|
|
1189 | |
|
|
1190 | op->name = name; |
|
|
1191 | op->name_pl = name_pl; |
|
|
1192 | op->title = title; |
|
|
1193 | |
|
|
1194 | op->head = this; |
|
|
1195 | prev->more = op; |
|
|
1196 | |
|
|
1197 | prev = op; |
|
|
1198 | } |
|
|
1199 | } |
|
|
1200 | |
1117 | /* |
1201 | /* |
1118 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1202 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1119 | * job preparing multi-part monsters. |
1203 | * job preparing multi-part monsters. |
1120 | */ |
1204 | */ |
1121 | object * |
1205 | object * |
1122 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1206 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1123 | { |
1207 | { |
1124 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1208 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1125 | { |
1209 | { |
1126 | tmp->x = x + tmp->arch->clone.x; |
1210 | tmp->x = x + tmp->arch->x; |
1127 | tmp->y = y + tmp->arch->clone.y; |
1211 | tmp->y = y + tmp->arch->y; |
1128 | } |
1212 | } |
1129 | |
1213 | |
1130 | return insert_ob_in_map (op, m, originator, flag); |
1214 | return insert_ob_in_map (op, m, originator, flag); |
1131 | } |
1215 | } |
1132 | |
1216 | |
… | |
… | |
1151 | * just 'op' otherwise |
1235 | * just 'op' otherwise |
1152 | */ |
1236 | */ |
1153 | object * |
1237 | object * |
1154 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1238 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1155 | { |
1239 | { |
|
|
1240 | assert (!op->flag [FLAG_FREED]); |
|
|
1241 | |
1156 | object *tmp, *top, *floor = NULL; |
1242 | object *top, *floor = NULL; |
1157 | |
|
|
1158 | if (QUERY_FLAG (op, FLAG_FREED)) |
|
|
1159 | { |
|
|
1160 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1161 | return NULL; |
|
|
1162 | } |
|
|
1163 | |
|
|
1164 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1165 | LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ()); |
|
|
1166 | |
1243 | |
1167 | op->remove (); |
1244 | op->remove (); |
1168 | |
|
|
1169 | if (!m) |
|
|
1170 | { |
|
|
1171 | char *dump = dump_object (op); |
|
|
1172 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
|
|
1173 | free (dump); |
|
|
1174 | return op; |
|
|
1175 | } |
|
|
1176 | |
|
|
1177 | if (out_of_map (m, op->x, op->y)) |
|
|
1178 | { |
|
|
1179 | char *dump = dump_object (op); |
|
|
1180 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
|
|
1181 | #ifdef MANY_CORES |
|
|
1182 | /* Better to catch this here, as otherwise the next use of this object |
|
|
1183 | * is likely to cause a crash. Better to find out where it is getting |
|
|
1184 | * improperly inserted. |
|
|
1185 | */ |
|
|
1186 | abort (); |
|
|
1187 | #endif |
|
|
1188 | free (dump); |
|
|
1189 | return op; |
|
|
1190 | } |
|
|
1191 | |
|
|
1192 | if (object *more = op->more) |
|
|
1193 | { |
|
|
1194 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1195 | { |
|
|
1196 | if (!op->head) |
|
|
1197 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1198 | |
|
|
1199 | return 0; |
|
|
1200 | } |
|
|
1201 | } |
|
|
1202 | |
|
|
1203 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1204 | |
1245 | |
1205 | /* Ideally, the caller figures this out. However, it complicates a lot |
1246 | /* Ideally, the caller figures this out. However, it complicates a lot |
1206 | * of areas of callers (eg, anything that uses find_free_spot would now |
1247 | * of areas of callers (eg, anything that uses find_free_spot would now |
1207 | * need extra work |
1248 | * need extra work |
1208 | */ |
1249 | */ |
1209 | if (!xy_normalise (m, op->x, op->y)) |
1250 | if (!xy_normalise (m, op->x, op->y)) |
|
|
1251 | { |
|
|
1252 | op->destroy (); |
1210 | return 0; |
1253 | return 0; |
|
|
1254 | } |
|
|
1255 | |
|
|
1256 | if (object *more = op->more) |
|
|
1257 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1258 | return 0; |
|
|
1259 | |
|
|
1260 | CLEAR_FLAG (op, FLAG_REMOVED); |
1211 | |
1261 | |
1212 | op->map = m; |
1262 | op->map = m; |
1213 | mapspace &ms = op->ms (); |
1263 | mapspace &ms = op->ms (); |
1214 | |
1264 | |
1215 | /* this has to be done after we translate the coordinates. |
1265 | /* this has to be done after we translate the coordinates. |
1216 | */ |
1266 | */ |
1217 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1267 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1218 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1268 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1219 | if (object::can_merge (op, tmp)) |
1269 | if (object::can_merge (op, tmp)) |
1220 | { |
1270 | { |
1221 | op->nrof += tmp->nrof; |
1271 | op->nrof += tmp->nrof; |
1222 | tmp->destroy (); |
1272 | tmp->destroy (); |
1223 | } |
1273 | } |
… | |
… | |
1250 | else |
1300 | else |
1251 | { |
1301 | { |
1252 | top = ms.bot; |
1302 | top = ms.bot; |
1253 | |
1303 | |
1254 | /* If there are other objects, then */ |
1304 | /* If there are other objects, then */ |
1255 | if ((!(flag & INS_MAP_LOAD)) && top) |
1305 | if (top) |
1256 | { |
1306 | { |
1257 | object *last = 0; |
1307 | object *last = 0; |
1258 | |
1308 | |
1259 | /* |
1309 | /* |
1260 | * If there are multiple objects on this space, we do some trickier handling. |
1310 | * If there are multiple objects on this space, we do some trickier handling. |
… | |
… | |
1313 | if (last && last->below && last != floor) |
1363 | if (last && last->below && last != floor) |
1314 | top = last->below; |
1364 | top = last->below; |
1315 | } |
1365 | } |
1316 | } /* If objects on this space */ |
1366 | } /* If objects on this space */ |
1317 | |
1367 | |
1318 | if (flag & INS_MAP_LOAD) |
|
|
1319 | top = ms.top; |
|
|
1320 | |
|
|
1321 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1368 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1322 | top = floor; |
1369 | top = floor; |
1323 | |
1370 | |
1324 | /* Top is the object that our object (op) is going to get inserted above. |
1371 | /* Top is the object that our object (op) is going to get inserted above. |
1325 | */ |
1372 | */ |
… | |
… | |
1357 | op->map->touch (); |
1404 | op->map->touch (); |
1358 | } |
1405 | } |
1359 | |
1406 | |
1360 | op->map->dirty = true; |
1407 | op->map->dirty = true; |
1361 | |
1408 | |
1362 | /* If we have a floor, we know the player, if any, will be above |
|
|
1363 | * it, so save a few ticks and start from there. |
|
|
1364 | */ |
|
|
1365 | if (!(flag & INS_MAP_LOAD)) |
|
|
1366 | if (object *pl = ms.player ()) |
1409 | if (object *pl = ms.player ()) |
1367 | if (pl->contr->ns) |
|
|
1368 | pl->contr->ns->floorbox_update (); |
1410 | pl->contr->ns->floorbox_update (); |
1369 | |
1411 | |
1370 | /* If this object glows, it may affect lighting conditions that are |
1412 | /* If this object glows, it may affect lighting conditions that are |
1371 | * visible to others on this map. But update_all_los is really |
1413 | * visible to others on this map. But update_all_los is really |
1372 | * an inefficient way to do this, as it means los for all players |
1414 | * an inefficient way to do this, as it means los for all players |
1373 | * on the map will get recalculated. The players could very well |
1415 | * on the map will get recalculated. The players could very well |
… | |
… | |
1392 | * blocked() and wall() work properly), and these flags are updated by |
1434 | * blocked() and wall() work properly), and these flags are updated by |
1393 | * update_object(). |
1435 | * update_object(). |
1394 | */ |
1436 | */ |
1395 | |
1437 | |
1396 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1438 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1397 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1439 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1398 | { |
1440 | { |
1399 | if (check_move_on (op, originator)) |
1441 | if (check_move_on (op, originator)) |
1400 | return 0; |
1442 | return 0; |
1401 | |
1443 | |
1402 | /* If we are a multi part object, lets work our way through the check |
1444 | /* If we are a multi part object, lets work our way through the check |
1403 | * walk on's. |
1445 | * walk on's. |
1404 | */ |
1446 | */ |
1405 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1447 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1406 | if (check_move_on (tmp, originator)) |
1448 | if (check_move_on (tmp, originator)) |
1407 | return 0; |
1449 | return 0; |
1408 | } |
1450 | } |
1409 | |
1451 | |
1410 | return op; |
1452 | return op; |
… | |
… | |
1420 | object *tmp, *tmp1; |
1462 | object *tmp, *tmp1; |
1421 | |
1463 | |
1422 | /* first search for itself and remove any old instances */ |
1464 | /* first search for itself and remove any old instances */ |
1423 | |
1465 | |
1424 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1466 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1425 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1467 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1426 | tmp->destroy (); |
1468 | tmp->destroy (); |
1427 | |
1469 | |
1428 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1470 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1429 | |
1471 | |
1430 | tmp1->x = op->x; |
1472 | tmp1->x = op->x; |
1431 | tmp1->y = op->y; |
1473 | tmp1->y = op->y; |
1432 | insert_ob_in_map (tmp1, op->map, op, 0); |
1474 | insert_ob_in_map (tmp1, op->map, op, 0); |
1433 | } |
1475 | } |
1434 | |
1476 | |
1435 | // XXX: function not returning object* |
|
|
1436 | object * |
1477 | object * |
1437 | object::insert_at (object *where, object *originator, int flags) |
1478 | object::insert_at (object *where, object *originator, int flags) |
1438 | { |
1479 | { |
1439 | where->map->insert (this, where->x, where->y, originator, flags); |
1480 | return where->map->insert (this, where->x, where->y, originator, flags); |
1440 | } |
1481 | } |
1441 | |
1482 | |
1442 | /* |
1483 | /* |
1443 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1484 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1444 | * is returned contains nr objects, and the remaining parts contains |
1485 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1484 | * the amount of an object. If the amount reaches 0, the object |
1525 | * the amount of an object. If the amount reaches 0, the object |
1485 | * is subsequently removed and freed. |
1526 | * is subsequently removed and freed. |
1486 | * |
1527 | * |
1487 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1528 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1488 | */ |
1529 | */ |
1489 | |
|
|
1490 | object * |
1530 | object * |
1491 | decrease_ob_nr (object *op, uint32 i) |
1531 | decrease_ob_nr (object *op, uint32 i) |
1492 | { |
1532 | { |
1493 | object *tmp; |
1533 | object *tmp; |
1494 | |
1534 | |
… | |
… | |
1569 | |
1609 | |
1570 | /* |
1610 | /* |
1571 | * add_weight(object, weight) adds the specified weight to an object, |
1611 | * add_weight(object, weight) adds the specified weight to an object, |
1572 | * and also updates how much the environment(s) is/are carrying. |
1612 | * and also updates how much the environment(s) is/are carrying. |
1573 | */ |
1613 | */ |
1574 | |
|
|
1575 | void |
1614 | void |
1576 | add_weight (object *op, signed long weight) |
1615 | add_weight (object *op, signed long weight) |
1577 | { |
1616 | { |
1578 | while (op != NULL) |
1617 | while (op != NULL) |
1579 | { |
1618 | { |
… | |
… | |
1594 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1633 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1595 | free (dump); |
1634 | free (dump); |
1596 | return op; |
1635 | return op; |
1597 | } |
1636 | } |
1598 | |
1637 | |
1599 | if (where->head) |
1638 | if (where->head_ () != where) |
1600 | { |
1639 | { |
1601 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1640 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1602 | where = where->head; |
1641 | where = where->head; |
1603 | } |
1642 | } |
1604 | |
1643 | |
1605 | return where->insert (op); |
1644 | return where->insert (op); |
1606 | } |
1645 | } |
… | |
… | |
1611 | * inside the object environment. |
1650 | * inside the object environment. |
1612 | * |
1651 | * |
1613 | * The function returns now pointer to inserted item, and return value can |
1652 | * The function returns now pointer to inserted item, and return value can |
1614 | * be != op, if items are merged. -Tero |
1653 | * be != op, if items are merged. -Tero |
1615 | */ |
1654 | */ |
1616 | |
|
|
1617 | object * |
1655 | object * |
1618 | object::insert (object *op) |
1656 | object::insert (object *op) |
1619 | { |
1657 | { |
1620 | object *tmp, *otmp; |
|
|
1621 | |
|
|
1622 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1658 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1623 | op->remove (); |
1659 | op->remove (); |
1624 | |
1660 | |
1625 | if (op->more) |
1661 | if (op->more) |
1626 | { |
1662 | { |
… | |
… | |
1628 | return op; |
1664 | return op; |
1629 | } |
1665 | } |
1630 | |
1666 | |
1631 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1667 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1632 | CLEAR_FLAG (op, FLAG_REMOVED); |
1668 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1669 | |
1633 | if (op->nrof) |
1670 | if (op->nrof) |
1634 | { |
1671 | { |
1635 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1672 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1636 | if (object::can_merge (tmp, op)) |
1673 | if (object::can_merge (tmp, op)) |
1637 | { |
1674 | { |
1638 | /* return the original object and remove inserted object |
1675 | /* return the original object and remove inserted object |
1639 | (client needs the original object) */ |
1676 | (client needs the original object) */ |
1640 | tmp->nrof += op->nrof; |
1677 | tmp->nrof += op->nrof; |
… | |
… | |
1659 | add_weight (this, op->weight * op->nrof); |
1696 | add_weight (this, op->weight * op->nrof); |
1660 | } |
1697 | } |
1661 | else |
1698 | else |
1662 | add_weight (this, (op->weight + op->carrying)); |
1699 | add_weight (this, (op->weight + op->carrying)); |
1663 | |
1700 | |
1664 | otmp = this->in_player (); |
1701 | if (object *otmp = this->in_player ()) |
1665 | if (otmp && otmp->contr) |
|
|
1666 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1702 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1667 | otmp->update_stats (); |
1703 | otmp->update_stats (); |
1668 | |
1704 | |
|
|
1705 | op->owner = 0; // its his/hers now. period. |
1669 | op->map = 0; |
1706 | op->map = 0; |
1670 | op->env = this; |
1707 | op->env = this; |
1671 | op->above = 0; |
1708 | op->above = 0; |
1672 | op->below = 0; |
1709 | op->below = 0; |
1673 | op->x = 0, op->y = 0; |
1710 | op->x = op->y = 0; |
1674 | |
1711 | |
1675 | /* reset the light list and los of the players on the map */ |
1712 | /* reset the light list and los of the players on the map */ |
1676 | if ((op->glow_radius != 0) && map) |
1713 | if (op->glow_radius && map) |
1677 | { |
1714 | { |
1678 | #ifdef DEBUG_LIGHTS |
1715 | #ifdef DEBUG_LIGHTS |
1679 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1716 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1680 | #endif /* DEBUG_LIGHTS */ |
1717 | #endif /* DEBUG_LIGHTS */ |
1681 | if (map->darkness) |
1718 | if (map->darkness) |
… | |
… | |
1915 | * activate recursively a flag on an object inventory |
1952 | * activate recursively a flag on an object inventory |
1916 | */ |
1953 | */ |
1917 | void |
1954 | void |
1918 | flag_inv (object *op, int flag) |
1955 | flag_inv (object *op, int flag) |
1919 | { |
1956 | { |
1920 | if (op->inv) |
|
|
1921 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1957 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1922 | { |
1958 | { |
1923 | SET_FLAG (tmp, flag); |
1959 | SET_FLAG (tmp, flag); |
1924 | flag_inv (tmp, flag); |
1960 | flag_inv (tmp, flag); |
1925 | } |
1961 | } |
1926 | } |
1962 | } |
1927 | |
1963 | |
1928 | /* |
1964 | /* |
1929 | * deactivate recursively a flag on an object inventory |
1965 | * deactivate recursively a flag on an object inventory |
1930 | */ |
1966 | */ |
1931 | void |
1967 | void |
1932 | unflag_inv (object *op, int flag) |
1968 | unflag_inv (object *op, int flag) |
1933 | { |
1969 | { |
1934 | if (op->inv) |
|
|
1935 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1970 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1936 | { |
1971 | { |
1937 | CLEAR_FLAG (tmp, flag); |
1972 | CLEAR_FLAG (tmp, flag); |
1938 | unflag_inv (tmp, flag); |
1973 | unflag_inv (tmp, flag); |
1939 | } |
1974 | } |
1940 | } |
|
|
1941 | |
|
|
1942 | /* |
|
|
1943 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
1944 | * all it's inventory (recursively). |
|
|
1945 | * If checksums are used, a player will get set_cheat called for |
|
|
1946 | * him/her-self and all object carried by a call to this function. |
|
|
1947 | */ |
|
|
1948 | void |
|
|
1949 | set_cheat (object *op) |
|
|
1950 | { |
|
|
1951 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
1952 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
1953 | } |
1975 | } |
1954 | |
1976 | |
1955 | /* |
1977 | /* |
1956 | * find_free_spot(object, map, x, y, start, stop) will search for |
1978 | * find_free_spot(object, map, x, y, start, stop) will search for |
1957 | * a spot at the given map and coordinates which will be able to contain |
1979 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
1959 | * to search (see the freearr_x/y[] definition). |
1981 | * to search (see the freearr_x/y[] definition). |
1960 | * It returns a random choice among the alternatives found. |
1982 | * It returns a random choice among the alternatives found. |
1961 | * start and stop are where to start relative to the free_arr array (1,9 |
1983 | * start and stop are where to start relative to the free_arr array (1,9 |
1962 | * does all 4 immediate directions). This returns the index into the |
1984 | * does all 4 immediate directions). This returns the index into the |
1963 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1985 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1964 | * Note - this only checks to see if there is space for the head of the |
|
|
1965 | * object - if it is a multispace object, this should be called for all |
|
|
1966 | * pieces. |
|
|
1967 | * Note2: This function does correctly handle tiled maps, but does not |
1986 | * Note: This function does correctly handle tiled maps, but does not |
1968 | * inform the caller. However, insert_ob_in_map will update as |
1987 | * inform the caller. However, insert_ob_in_map will update as |
1969 | * necessary, so the caller shouldn't need to do any special work. |
1988 | * necessary, so the caller shouldn't need to do any special work. |
1970 | * Note - updated to take an object instead of archetype - this is necessary |
1989 | * Note - updated to take an object instead of archetype - this is necessary |
1971 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1990 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1972 | * to know if the space in question will block the object. We can't use |
1991 | * to know if the space in question will block the object. We can't use |
… | |
… | |
1974 | * customized, changed states, etc. |
1993 | * customized, changed states, etc. |
1975 | */ |
1994 | */ |
1976 | int |
1995 | int |
1977 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1996 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1978 | { |
1997 | { |
|
|
1998 | int altern[SIZEOFFREE]; |
1979 | int index = 0, flag; |
1999 | int index = 0, flag; |
1980 | int altern[SIZEOFFREE]; |
|
|
1981 | |
2000 | |
1982 | for (int i = start; i < stop; i++) |
2001 | for (int i = start; i < stop; i++) |
1983 | { |
2002 | { |
1984 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
2003 | mapxy pos (m, x, y); pos.move (i); |
1985 | if (!flag) |
2004 | |
|
|
2005 | if (!pos.normalise ()) |
|
|
2006 | continue; |
|
|
2007 | |
|
|
2008 | mapspace &ms = *pos; |
|
|
2009 | |
|
|
2010 | if (ms.flags () & P_IS_ALIVE) |
|
|
2011 | continue; |
|
|
2012 | |
|
|
2013 | /* However, often |
|
|
2014 | * ob doesn't have any move type (when used to place exits) |
|
|
2015 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
2016 | */ |
|
|
2017 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
2018 | { |
1986 | altern [index++] = i; |
2019 | altern [index++] = i; |
|
|
2020 | continue; |
|
|
2021 | } |
1987 | |
2022 | |
1988 | /* Basically, if we find a wall on a space, we cut down the search size. |
2023 | /* Basically, if we find a wall on a space, we cut down the search size. |
1989 | * In this way, we won't return spaces that are on another side of a wall. |
2024 | * In this way, we won't return spaces that are on another side of a wall. |
1990 | * This mostly work, but it cuts down the search size in all directions - |
2025 | * This mostly work, but it cuts down the search size in all directions - |
1991 | * if the space being examined only has a wall to the north and empty |
2026 | * if the space being examined only has a wall to the north and empty |
1992 | * spaces in all the other directions, this will reduce the search space |
2027 | * spaces in all the other directions, this will reduce the search space |
1993 | * to only the spaces immediately surrounding the target area, and |
2028 | * to only the spaces immediately surrounding the target area, and |
1994 | * won't look 2 spaces south of the target space. |
2029 | * won't look 2 spaces south of the target space. |
1995 | */ |
2030 | */ |
1996 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
2031 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
2032 | { |
1997 | stop = maxfree[i]; |
2033 | stop = maxfree[i]; |
|
|
2034 | continue; |
|
|
2035 | } |
|
|
2036 | |
|
|
2037 | /* Note it is intentional that we check ob - the movement type of the |
|
|
2038 | * head of the object should correspond for the entire object. |
|
|
2039 | */ |
|
|
2040 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
2041 | continue; |
|
|
2042 | |
|
|
2043 | if (ob->blocked (m, pos.x, pos.y)) |
|
|
2044 | continue; |
|
|
2045 | |
|
|
2046 | altern [index++] = i; |
1998 | } |
2047 | } |
1999 | |
2048 | |
2000 | if (!index) |
2049 | if (!index) |
2001 | return -1; |
2050 | return -1; |
2002 | |
2051 | |
… | |
… | |
2011 | */ |
2060 | */ |
2012 | int |
2061 | int |
2013 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2062 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2014 | { |
2063 | { |
2015 | for (int i = 0; i < SIZEOFFREE; i++) |
2064 | for (int i = 0; i < SIZEOFFREE; i++) |
2016 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2065 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2017 | return i; |
2066 | return i; |
2018 | |
2067 | |
2019 | return -1; |
2068 | return -1; |
2020 | } |
2069 | } |
2021 | |
2070 | |
… | |
… | |
2075 | object *tmp; |
2124 | object *tmp; |
2076 | maptile *mp; |
2125 | maptile *mp; |
2077 | |
2126 | |
2078 | MoveType blocked, move_type; |
2127 | MoveType blocked, move_type; |
2079 | |
2128 | |
2080 | if (exclude && exclude->head) |
2129 | if (exclude && exclude->head_ () != exclude) |
2081 | { |
2130 | { |
2082 | exclude = exclude->head; |
2131 | exclude = exclude->head; |
2083 | move_type = exclude->move_type; |
2132 | move_type = exclude->move_type; |
2084 | } |
2133 | } |
2085 | else |
2134 | else |
… | |
… | |
2108 | max = maxfree[i]; |
2157 | max = maxfree[i]; |
2109 | else if (mflags & P_IS_ALIVE) |
2158 | else if (mflags & P_IS_ALIVE) |
2110 | { |
2159 | { |
2111 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2160 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2112 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2161 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2113 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2162 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2114 | break; |
2163 | break; |
2115 | |
2164 | |
2116 | if (tmp) |
2165 | if (tmp) |
2117 | return freedir[i]; |
2166 | return freedir[i]; |
2118 | } |
2167 | } |
… | |
… | |
2298 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2347 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2299 | * core dumps if they do. |
2348 | * core dumps if they do. |
2300 | * |
2349 | * |
2301 | * Add a check so we can't pick up invisible objects (0.93.8) |
2350 | * Add a check so we can't pick up invisible objects (0.93.8) |
2302 | */ |
2351 | */ |
2303 | |
|
|
2304 | int |
2352 | int |
2305 | can_pick (const object *who, const object *item) |
2353 | can_pick (const object *who, const object *item) |
2306 | { |
2354 | { |
2307 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2355 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2308 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2356 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
… | |
… | |
2313 | * create clone from object to another |
2361 | * create clone from object to another |
2314 | */ |
2362 | */ |
2315 | object * |
2363 | object * |
2316 | object_create_clone (object *asrc) |
2364 | object_create_clone (object *asrc) |
2317 | { |
2365 | { |
2318 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2366 | object *dst = 0, *tmp, *src, *prev, *item; |
2319 | |
2367 | |
2320 | if (!asrc) |
2368 | if (!asrc) |
2321 | return 0; |
2369 | return 0; |
2322 | |
2370 | |
2323 | src = asrc; |
|
|
2324 | if (src->head) |
|
|
2325 | src = src->head; |
2371 | src = asrc->head_ (); |
2326 | |
2372 | |
2327 | prev = 0; |
2373 | prev = 0; |
2328 | for (part = src; part; part = part->more) |
2374 | for (object *part = src; part; part = part->more) |
2329 | { |
2375 | { |
2330 | tmp = part->clone (); |
2376 | tmp = part->clone (); |
2331 | tmp->x -= src->x; |
2377 | tmp->x -= src->x; |
2332 | tmp->y -= src->y; |
2378 | tmp->y -= src->y; |
2333 | |
2379 | |
… | |
… | |
2446 | /* Basically, if the archetype has this key set, |
2492 | /* Basically, if the archetype has this key set, |
2447 | * we need to store the null value so when we save |
2493 | * we need to store the null value so when we save |
2448 | * it, we save the empty value so that when we load, |
2494 | * it, we save the empty value so that when we load, |
2449 | * we get this value back again. |
2495 | * we get this value back again. |
2450 | */ |
2496 | */ |
2451 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2497 | if (get_ob_key_link (op->arch, canonical_key)) |
2452 | field->value = 0; |
2498 | field->value = 0; |
2453 | else |
2499 | else |
2454 | { |
2500 | { |
2455 | if (last) |
2501 | if (last) |
2456 | last->next = field->next; |
2502 | last->next = field->next; |
… | |
… | |
2525 | } |
2571 | } |
2526 | else |
2572 | else |
2527 | item = item->env; |
2573 | item = item->env; |
2528 | } |
2574 | } |
2529 | |
2575 | |
2530 | |
|
|
2531 | const char * |
2576 | const char * |
2532 | object::flag_desc (char *desc, int len) const |
2577 | object::flag_desc (char *desc, int len) const |
2533 | { |
2578 | { |
2534 | char *p = desc; |
2579 | char *p = desc; |
2535 | bool first = true; |
2580 | bool first = true; |
… | |
… | |
2569 | &name, |
2614 | &name, |
2570 | title ? "\",title:\"" : "", |
2615 | title ? "\",title:\"" : "", |
2571 | title ? (const char *)title : "", |
2616 | title ? (const char *)title : "", |
2572 | flag_desc (flagdesc, 512), type); |
2617 | flag_desc (flagdesc, 512), type); |
2573 | |
2618 | |
2574 | if (env) |
2619 | if (!this->flag[FLAG_REMOVED] && env) |
2575 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2620 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2576 | |
2621 | |
2577 | if (map) |
2622 | if (map) |
2578 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2623 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2579 | |
2624 | |
… | |
… | |
2581 | } |
2626 | } |
2582 | |
2627 | |
2583 | const char * |
2628 | const char * |
2584 | object::debug_desc () const |
2629 | object::debug_desc () const |
2585 | { |
2630 | { |
2586 | static char info[256 * 4]; |
2631 | static char info[3][256 * 4]; |
|
|
2632 | static int info_idx; |
|
|
2633 | |
2587 | return debug_desc (info); |
2634 | return debug_desc (info [++info_idx % 3]); |
2588 | } |
|
|
2589 | |
|
|
2590 | const char * |
|
|
2591 | object::debug_desc2 () const |
|
|
2592 | { |
|
|
2593 | static char info[256 * 4]; |
|
|
2594 | return debug_desc (info); |
|
|
2595 | } |
2635 | } |
2596 | |
2636 | |
2597 | struct region * |
2637 | struct region * |
2598 | object::region () const |
2638 | object::region () const |
2599 | { |
2639 | { |
… | |
… | |
2602 | } |
2642 | } |
2603 | |
2643 | |
2604 | const materialtype_t * |
2644 | const materialtype_t * |
2605 | object::dominant_material () const |
2645 | object::dominant_material () const |
2606 | { |
2646 | { |
2607 | if (materialtype_t *mat = name_to_material (materialname)) |
2647 | if (materialtype_t *mt = name_to_material (materialname)) |
2608 | return mat; |
2648 | return mt; |
2609 | |
2649 | |
2610 | // omfg this is slow, this has to be temporary :) |
|
|
2611 | shstr unknown ("unknown"); |
|
|
2612 | |
|
|
2613 | return name_to_material (unknown); |
2650 | return name_to_material (shstr_unknown); |
2614 | } |
2651 | } |
2615 | |
2652 | |
2616 | void |
2653 | void |
2617 | object::open_container (object *new_container) |
2654 | object::open_container (object *new_container) |
2618 | { |
2655 | { |
… | |
… | |
2634 | old_container->flag [FLAG_APPLIED] = 0; |
2671 | old_container->flag [FLAG_APPLIED] = 0; |
2635 | container = 0; |
2672 | container = 0; |
2636 | |
2673 | |
2637 | esrv_update_item (UPD_FLAGS, this, old_container); |
2674 | esrv_update_item (UPD_FLAGS, this, old_container); |
2638 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2675 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2676 | play_sound (sound_find ("chest_close")); |
2639 | } |
2677 | } |
2640 | |
2678 | |
2641 | if (new_container) |
2679 | if (new_container) |
2642 | { |
2680 | { |
2643 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
2681 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
… | |
… | |
2659 | new_container->flag [FLAG_APPLIED] = 1; |
2697 | new_container->flag [FLAG_APPLIED] = 1; |
2660 | container = new_container; |
2698 | container = new_container; |
2661 | |
2699 | |
2662 | esrv_update_item (UPD_FLAGS, this, new_container); |
2700 | esrv_update_item (UPD_FLAGS, this, new_container); |
2663 | esrv_send_inventory (this, new_container); |
2701 | esrv_send_inventory (this, new_container); |
|
|
2702 | play_sound (sound_find ("chest_open")); |
|
|
2703 | } |
|
|
2704 | } |
|
|
2705 | |
|
|
2706 | object * |
|
|
2707 | object::force_find (const shstr name) |
|
|
2708 | { |
|
|
2709 | /* cycle through his inventory to look for the MARK we want to |
|
|
2710 | * place |
|
|
2711 | */ |
|
|
2712 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2713 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2714 | return splay (tmp); |
|
|
2715 | |
|
|
2716 | return 0; |
|
|
2717 | } |
|
|
2718 | |
|
|
2719 | void |
|
|
2720 | object::force_add (const shstr name, int duration) |
|
|
2721 | { |
|
|
2722 | if (object *force = force_find (name)) |
|
|
2723 | force->destroy (); |
|
|
2724 | |
|
|
2725 | object *force = get_archetype (FORCE_NAME); |
|
|
2726 | |
|
|
2727 | force->slaying = name; |
|
|
2728 | force->stats.food = 1; |
|
|
2729 | force->speed_left = -1.f; |
|
|
2730 | |
|
|
2731 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2732 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2733 | force->flag [FLAG_APPLIED] = true; |
|
|
2734 | |
|
|
2735 | insert (force); |
|
|
2736 | } |
|
|
2737 | |
|
|
2738 | void |
|
|
2739 | object::play_sound (faceidx sound) const |
|
|
2740 | { |
|
|
2741 | if (!sound) |
|
|
2742 | return; |
|
|
2743 | |
|
|
2744 | if (flag [FLAG_REMOVED]) |
|
|
2745 | return; |
|
|
2746 | |
|
|
2747 | if (env) |
2664 | } |
2748 | { |
|
|
2749 | if (object *pl = in_player ()) |
|
|
2750 | pl->contr->play_sound (sound); |
|
|
2751 | } |
|
|
2752 | else |
|
|
2753 | map->play_sound (sound, x, y); |
2665 | } |
2754 | } |
2666 | |
2755 | |
2667 | |
|
|