1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
… | |
… | |
37 | uint32_t mapspace::smellcount = 10000; |
37 | uint32_t mapspace::smellcount = 10000; |
38 | |
38 | |
39 | objectvec objects; |
39 | objectvec objects; |
40 | activevec actives; |
40 | activevec actives; |
41 | |
41 | |
|
|
42 | freelist_item *object::freelist; |
|
|
43 | uint32_t object::object_count; |
|
|
44 | uint32_t object::free_count; |
|
|
45 | uint32_t object::create_count; |
|
|
46 | uint32_t object::destroy_count; |
|
|
47 | |
42 | //+GPL |
48 | //+GPL |
43 | |
49 | |
44 | short freearr_x[SIZEOFFREE] = { |
50 | short freearr_x[SIZEOFFREE] = { |
45 | 0, |
51 | 0, |
46 | 0, 1, 1, 1, 0, -1, -1, -1, |
52 | 0, 1, 1, 1, 0, -1, -1, -1, |
… | |
… | |
65 | 9, 10, 13, 14, 17, 18, 21, 22, |
71 | 9, 10, 13, 14, 17, 18, 21, 22, |
66 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
72 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
67 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
73 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
68 | }; |
74 | }; |
69 | |
75 | |
|
|
76 | const char *wall_suffix[16] = { |
|
|
77 | "0", |
|
|
78 | "1_3", |
|
|
79 | "1_4", |
|
|
80 | "2_1_2", |
|
|
81 | "1_2", |
|
|
82 | "2_2_4", |
|
|
83 | "2_2_1", |
|
|
84 | "3_1", |
|
|
85 | "1_1", |
|
|
86 | "2_2_3", |
|
|
87 | "2_2_2", |
|
|
88 | "3_3", |
|
|
89 | "2_1_1", |
|
|
90 | "3_4", |
|
|
91 | "3_2", |
|
|
92 | "4" |
|
|
93 | }; |
|
|
94 | |
70 | static void |
95 | static void |
71 | write_uuid (uval64 skip, bool sync) |
96 | write_uuid (uval64 skip, bool sync) |
72 | { |
97 | { |
73 | CALL_BEGIN (2); |
98 | CALL_BEGIN (2); |
74 | CALL_ARG_SV (newSVval64 (skip)); |
99 | CALL_ARG_SV (newSVval64 (skip)); |
… | |
… | |
208 | |
233 | |
209 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
234 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
210 | static bool |
235 | static bool |
211 | compare_ob_value_lists_one (const object *wants, const object *has) |
236 | compare_ob_value_lists_one (const object *wants, const object *has) |
212 | { |
237 | { |
213 | /* n-squared behaviour (see kv_get), but I'm hoping both |
238 | /* n-squared behaviour (see kv.get), but I'm hoping both |
214 | * objects with lists are rare, and lists stay short. If not, use a |
239 | * objects with lists are rare, and lists stay short. If not, use a |
215 | * different structure or at least keep the lists sorted... |
240 | * different structure or at least keep the lists sorted... |
216 | */ |
241 | */ |
217 | |
242 | |
218 | /* For each field in wants, */ |
243 | /* For each field in wants, */ |
219 | for (key_value *kv = wants->key_values; kv; kv = kv->next) |
244 | for (key_value *kv = wants->kv.first; kv; kv = kv->next) |
220 | if (has->kv_get (kv->key) != kv->value) |
245 | if (has->kv.get (kv->key) != kv->value) |
221 | return false; |
246 | return false; |
222 | |
247 | |
223 | /* If we get here, every field in wants has a matching field in has. */ |
248 | /* If we get here, every field in wants has a matching field in has. */ |
224 | return true; |
249 | return true; |
225 | } |
250 | } |
… | |
… | |
249 | */ |
274 | */ |
250 | bool object::can_merge_slow (object *ob1, object *ob2) |
275 | bool object::can_merge_slow (object *ob1, object *ob2) |
251 | { |
276 | { |
252 | /* A couple quick sanity checks */ |
277 | /* A couple quick sanity checks */ |
253 | if (ob1 == ob2 |
278 | if (ob1 == ob2 |
254 | || ob1->type != ob2->type |
279 | || ob1->type != ob2->type |
255 | || ob1->value != ob2->value |
280 | || ob1->value != ob2->value |
256 | || ob1->name != ob2->name |
281 | || ob1->name != ob2->name |
|
|
282 | || ob1->custom_name != ob2->custom_name |
257 | || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED) |
283 | || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED) |
258 | return 0; |
284 | return 0; |
259 | |
285 | |
260 | /* Do not merge objects if nrof would overflow, assume nrof |
286 | /* Do not merge objects if nrof would overflow, assume nrof |
261 | * is always 0 .. 2**31-1 */ |
287 | * is always 0 .. 2**31-1 */ |
… | |
… | |
347 | if (ob1->level != ob2->level) |
373 | if (ob1->level != ob2->level) |
348 | return 0; |
374 | return 0; |
349 | break; |
375 | break; |
350 | } |
376 | } |
351 | |
377 | |
352 | if (ob1->key_values || ob2->key_values) |
378 | if (!ob1->kv.empty () || !ob2->kv.empty ()) |
353 | { |
379 | { |
354 | /* At least one of these has key_values. */ |
380 | /* At least one of these has key_values. */ |
355 | if ((!ob1->key_values) != (!ob2->key_values)) |
381 | if (ob1->kv.empty () != ob2->kv.empty ()) |
356 | return 0; /* One has fields, but the other one doesn't. */ |
382 | return 0; /* One has fields, but the other one doesn't. */ |
357 | |
383 | |
358 | if (!compare_ob_value_lists (ob1, ob2)) |
384 | if (!compare_ob_value_lists (ob1, ob2)) |
359 | return 0; |
385 | return 0; |
360 | } |
386 | } |
… | |
… | |
420 | |
446 | |
421 | return 0; |
447 | return 0; |
422 | } |
448 | } |
423 | |
449 | |
424 | // adjust weight per container type ("of holding") |
450 | // adjust weight per container type ("of holding") |
425 | static sint32 |
451 | static uint32 |
426 | weight_adjust_for (object *op, sint32 weight) |
452 | weight_adjust_for (object *op, uint32 weight) |
427 | { |
453 | { |
428 | return op->type == CONTAINER |
454 | return op->type == CONTAINER |
429 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
455 | ? weight - weight * op->stats.Str / 100 |
430 | : weight; |
456 | : weight; |
431 | } |
457 | } |
432 | |
458 | |
433 | /* |
459 | /* |
434 | * adjust_weight(object, weight) adds the specified weight to an object, |
460 | * subtracts, then adds, the specified weight to an object, |
435 | * and also updates how much the environment(s) is/are carrying. |
461 | * and also updates how much the environment(s) is/are carrying. |
436 | */ |
462 | */ |
437 | static void |
463 | static void |
438 | adjust_weight (object *op, sint32 weight) |
464 | adjust_weight (object *op, sint32 sub, sint32 add) |
439 | { |
465 | { |
440 | while (op) |
466 | while (op) |
441 | { |
467 | { |
442 | // adjust by actual difference to account for rounding errors |
468 | sint32 ocarrying = op->carrying; |
443 | // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct |
|
|
444 | weight = weight_adjust_for (op, op->carrying) |
|
|
445 | - weight_adjust_for (op, op->carrying - weight); |
|
|
446 | |
469 | |
447 | if (!weight) |
470 | op->carrying -= weight_adjust_for (op, sub); |
448 | return; |
471 | op->carrying += weight_adjust_for (op, add); |
449 | |
|
|
450 | op->carrying += weight; |
|
|
451 | |
472 | |
452 | if (object *pl = op->visible_to ()) |
473 | if (object *pl = op->visible_to ()) |
453 | if (pl != op) // player is handled lazily |
474 | if (pl != op) // player is handled lazily |
454 | esrv_update_item (UPD_WEIGHT, pl, op); |
475 | esrv_update_item (UPD_WEIGHT, pl, op); |
455 | |
476 | |
|
|
477 | sub = ocarrying; |
|
|
478 | add = op->carrying; |
|
|
479 | |
456 | op = op->env; |
480 | op = op->env; |
457 | } |
481 | } |
458 | } |
482 | } |
459 | |
483 | |
460 | /* |
484 | /* |
… | |
… | |
467 | { |
491 | { |
468 | sint32 sum = 0; |
492 | sint32 sum = 0; |
469 | |
493 | |
470 | for (object *op = inv; op; op = op->below) |
494 | for (object *op = inv; op; op = op->below) |
471 | { |
495 | { |
472 | if (op->inv) |
|
|
473 | op->update_weight (); |
496 | op->update_weight (); |
474 | |
497 | |
475 | sum += op->total_weight (); |
498 | sum += weight_adjust_for (this, op->total_weight ()); |
476 | } |
499 | } |
477 | |
|
|
478 | sum = weight_adjust_for (this, sum); |
|
|
479 | |
500 | |
480 | if (sum != carrying) |
501 | if (sum != carrying) |
481 | { |
502 | { |
|
|
503 | if (carrying != sum && carrying)//D |
|
|
504 | LOG (llevDebug, "updating carrying got %ld, expected %ld (%s)\n", |
|
|
505 | (long long)sum, (long long)carrying, debug_desc ()); |
|
|
506 | |
482 | carrying = sum; |
507 | carrying = sum; |
483 | |
508 | |
484 | if (object *pl = visible_to ()) |
509 | if (object *pl = visible_to ()) |
485 | if (pl != this) // player is handled lazily |
510 | if (pl != this) // player is handled lazily |
486 | esrv_update_item (UPD_WEIGHT, pl, this); |
511 | esrv_update_item (UPD_WEIGHT, pl, this); |
… | |
… | |
572 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
597 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
573 | return; |
598 | return; |
574 | } |
599 | } |
575 | |
600 | |
576 | this->owner = owner; |
601 | this->owner = owner; |
577 | } |
|
|
578 | |
|
|
579 | /* Zero the key_values on op, decrementing the shared-string |
|
|
580 | * refcounts and freeing the links. |
|
|
581 | */ |
|
|
582 | static void |
|
|
583 | free_key_values (object *op) |
|
|
584 | { |
|
|
585 | for (key_value *i = op->key_values; i; ) |
|
|
586 | { |
|
|
587 | key_value *next = i->next; |
|
|
588 | delete i; |
|
|
589 | |
|
|
590 | i = next; |
|
|
591 | } |
|
|
592 | |
|
|
593 | op->key_values = 0; |
|
|
594 | } |
602 | } |
595 | |
603 | |
596 | /* |
604 | /* |
597 | * copy_to first frees everything allocated by the dst object, |
605 | * copy_to first frees everything allocated by the dst object, |
598 | * and then copies the contents of itself into the second |
606 | * and then copies the contents of itself into the second |
… | |
… | |
604 | void |
612 | void |
605 | object::copy_to (object *dst) |
613 | object::copy_to (object *dst) |
606 | { |
614 | { |
607 | dst->remove (); |
615 | dst->remove (); |
608 | *(object_copy *)dst = *this; |
616 | *(object_copy *)dst = *this; |
|
|
617 | |
|
|
618 | // maybe move to object_copy? |
|
|
619 | dst->kv = kv; |
|
|
620 | |
609 | dst->flag [FLAG_REMOVED] = true; |
621 | dst->flag [FLAG_REMOVED] = true; |
610 | |
|
|
611 | /* Copy over key_values, if any. */ |
|
|
612 | if (key_values) |
|
|
613 | { |
|
|
614 | key_value *tail = 0; |
|
|
615 | dst->key_values = 0; |
|
|
616 | |
|
|
617 | for (key_value *i = key_values; i; i = i->next) |
|
|
618 | { |
|
|
619 | key_value *new_link = new key_value; |
|
|
620 | |
|
|
621 | new_link->next = 0; |
|
|
622 | new_link->key = i->key; |
|
|
623 | new_link->value = i->value; |
|
|
624 | |
|
|
625 | /* Try and be clever here, too. */ |
|
|
626 | if (!dst->key_values) |
|
|
627 | { |
|
|
628 | dst->key_values = new_link; |
|
|
629 | tail = new_link; |
|
|
630 | } |
|
|
631 | else |
|
|
632 | { |
|
|
633 | tail->next = new_link; |
|
|
634 | tail = new_link; |
|
|
635 | } |
|
|
636 | } |
|
|
637 | } |
|
|
638 | |
|
|
639 | dst->activate (); |
622 | dst->activate (); |
640 | } |
623 | } |
641 | |
624 | |
642 | void |
625 | void |
643 | object::instantiate () |
626 | object::instantiate () |
644 | { |
627 | { |
645 | if (!uuid.seq) // HACK |
628 | if (!uuid.seq) // HACK |
646 | uuid = UUID::gen (); |
629 | uuid = UUID::gen (); |
647 | |
630 | |
648 | // TODO: unclean state changes, should nt be done in copy_to AND instantiate |
631 | // TODO: unclean state changes, should not be done in copy_to AND instantiate |
649 | if (flag [FLAG_RANDOM_SPEED] && speed) |
632 | if (flag [FLAG_RANDOM_SPEED] && speed) |
650 | speed_left = - speed - rndm (); // TODO animation |
633 | speed_left = - speed - rndm (); // TODO animation |
651 | else |
634 | else |
652 | speed_left = -1.; |
635 | speed_left = -1.; |
653 | |
636 | |
… | |
… | |
806 | |
789 | |
807 | object::~object () |
790 | object::~object () |
808 | { |
791 | { |
809 | unlink (); |
792 | unlink (); |
810 | |
793 | |
811 | free_key_values (this); |
794 | kv.clear (); |
812 | } |
795 | } |
813 | |
|
|
814 | static int object_count; |
|
|
815 | |
796 | |
816 | void object::link () |
797 | void object::link () |
817 | { |
798 | { |
818 | assert (!index);//D |
799 | assert (!index);//D |
819 | uuid = UUID::gen (); |
800 | uuid = UUID::gen (); |
820 | count = ++object_count; |
|
|
821 | |
801 | |
822 | refcnt_inc (); |
802 | refcnt_inc (); |
823 | objects.insert (this); |
803 | objects.insert (this); |
|
|
804 | |
|
|
805 | ++create_count; |
|
|
806 | |
824 | } |
807 | } |
825 | |
808 | |
826 | void object::unlink () |
809 | void object::unlink () |
827 | { |
810 | { |
828 | if (!index) |
811 | if (!index) |
829 | return; |
812 | return; |
|
|
813 | |
|
|
814 | ++destroy_count; |
830 | |
815 | |
831 | objects.erase (this); |
816 | objects.erase (this); |
832 | refcnt_dec (); |
817 | refcnt_dec (); |
833 | } |
818 | } |
834 | |
819 | |
… | |
… | |
913 | * if some form of movement is allowed, let objects |
898 | * if some form of movement is allowed, let objects |
914 | * drop on that space. |
899 | * drop on that space. |
915 | */ |
900 | */ |
916 | if (!drop_to_ground |
901 | if (!drop_to_ground |
917 | || !map |
902 | || !map |
918 | || map->in_memory != MAP_ACTIVE |
903 | || !map->linkable () |
919 | || map->no_drop |
904 | || map->no_drop |
920 | || ms ().move_block == MOVE_ALL) |
905 | || ms ().move_block == MOVE_ALL) |
921 | { |
906 | { |
922 | while (inv) |
907 | while (inv) |
923 | inv->destroy (); |
908 | inv->destroy (); |
… | |
… | |
960 | // then destroy |
945 | // then destroy |
961 | op->destroy (); |
946 | op->destroy (); |
962 | } |
947 | } |
963 | } |
948 | } |
964 | |
949 | |
|
|
950 | void |
|
|
951 | object::freelist_free (int count) |
|
|
952 | { |
|
|
953 | while (count-- && freelist) |
|
|
954 | { |
|
|
955 | freelist_item *next = freelist->next; |
|
|
956 | // count is being "destroyed" |
|
|
957 | |
|
|
958 | sfree ((char *)freelist, sizeof (object)); |
|
|
959 | |
|
|
960 | freelist = next; |
|
|
961 | --free_count; |
|
|
962 | } |
|
|
963 | } |
|
|
964 | |
|
|
965 | object * |
965 | object *object::create () |
966 | object::create () |
966 | { |
967 | { |
967 | object *op = new object; |
968 | object *op; |
|
|
969 | |
|
|
970 | if (freelist) |
|
|
971 | { |
|
|
972 | freelist_item li = *freelist; |
|
|
973 | memset (freelist, 0, sizeof (object)); |
|
|
974 | |
|
|
975 | op = new (freelist) object; |
|
|
976 | op->count = li.count; |
|
|
977 | |
|
|
978 | freelist = li.next; |
|
|
979 | --free_count; |
|
|
980 | } |
|
|
981 | else |
|
|
982 | { |
|
|
983 | void *ni = salloc0<char> (sizeof (object)); |
|
|
984 | |
|
|
985 | op = new(ni) object; |
|
|
986 | |
|
|
987 | op->count = ++object_count; |
|
|
988 | } |
|
|
989 | |
968 | op->link (); |
990 | op->link (); |
|
|
991 | |
969 | return op; |
992 | return op; |
970 | } |
993 | } |
971 | |
994 | |
|
|
995 | void |
|
|
996 | object::do_delete () |
|
|
997 | { |
|
|
998 | uint32_t count = this->count; |
|
|
999 | |
|
|
1000 | this->~object (); |
|
|
1001 | |
|
|
1002 | freelist_item *li = (freelist_item *)this; |
|
|
1003 | li->next = freelist; |
|
|
1004 | li->count = count; |
|
|
1005 | |
|
|
1006 | freelist = li; |
|
|
1007 | ++free_count; |
|
|
1008 | } |
|
|
1009 | |
972 | static struct freed_map : maptile |
1010 | static struct freed_map : maptile |
973 | { |
1011 | { |
974 | freed_map () |
1012 | freed_map () |
|
|
1013 | : maptile (3, 3) |
975 | { |
1014 | { |
976 | path = "<freed objects map>"; |
1015 | path = "<freed objects map>"; |
977 | name = "/internal/freed_objects_map"; |
1016 | name = "/internal/freed_objects_map"; |
978 | width = 3; |
|
|
979 | height = 3; |
|
|
980 | no_drop = 1; |
1017 | no_drop = 1; |
981 | no_reset = 1; |
1018 | no_reset = 1; |
982 | |
1019 | |
983 | alloc (); |
|
|
984 | in_memory = MAP_ACTIVE; |
1020 | in_memory = MAP_ACTIVE; |
985 | } |
1021 | } |
986 | |
1022 | |
987 | ~freed_map () |
1023 | ~freed_map () |
988 | { |
1024 | { |
… | |
… | |
1081 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1117 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1082 | if (object *pl = visible_to ()) |
1118 | if (object *pl = visible_to ()) |
1083 | esrv_del_item (pl->contr, count); |
1119 | esrv_del_item (pl->contr, count); |
1084 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1120 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1085 | |
1121 | |
1086 | adjust_weight (env, -total_weight ()); |
1122 | adjust_weight (env, total_weight (), 0); |
1087 | |
1123 | |
1088 | object *pl = in_player (); |
1124 | object *pl = in_player (); |
1089 | |
1125 | |
1090 | /* we set up values so that it could be inserted into |
1126 | /* we set up values so that it could be inserted into |
1091 | * the map, but we don't actually do that - it is up |
1127 | * the map, but we don't actually do that - it is up |
… | |
… | |
1105 | |
1141 | |
1106 | if (pl && pl->is_player ()) |
1142 | if (pl && pl->is_player ()) |
1107 | { |
1143 | { |
1108 | if (expect_false (pl->contr->combat_ob == this)) |
1144 | if (expect_false (pl->contr->combat_ob == this)) |
1109 | { |
1145 | { |
1110 | pl->apply (pl->contr->combat_ob, AP_UNAPPLY); |
1146 | pl->apply (pl->contr->combat_ob, AP_UNAPPLY | AP_IGNORE_CURSE); |
1111 | pl->contr->combat_ob = 0; |
1147 | pl->contr->combat_ob = 0; |
1112 | if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob); |
1148 | if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob); |
1113 | } |
1149 | } |
1114 | |
1150 | |
1115 | if (expect_false (pl->contr->ranged_ob == this)) |
1151 | if (expect_false (pl->contr->ranged_ob == this)) |
1116 | { |
1152 | { |
1117 | pl->apply (pl->contr->ranged_ob, AP_UNAPPLY); |
1153 | pl->apply (pl->contr->ranged_ob, AP_UNAPPLY | AP_IGNORE_CURSE); |
1118 | pl->contr->ranged_ob = 0; |
1154 | pl->contr->ranged_ob = 0; |
1119 | if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob); |
1155 | if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob); |
1120 | } |
1156 | } |
1121 | |
1157 | |
1122 | pl->contr->queue_stats_update (); |
1158 | pl->contr->queue_stats_update (); |
… | |
… | |
1162 | |
1198 | |
1163 | above = 0; |
1199 | above = 0; |
1164 | below = 0; |
1200 | below = 0; |
1165 | |
1201 | |
1166 | ms.invalidate (); |
1202 | ms.invalidate (); |
1167 | |
|
|
1168 | if (map->in_memory == MAP_SAVING) |
|
|
1169 | return; |
|
|
1170 | |
1203 | |
1171 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1204 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1172 | |
1205 | |
1173 | if (object *pl = ms.player ()) |
1206 | if (object *pl = ms.player ()) |
1174 | { |
1207 | { |
… | |
… | |
1309 | { |
1342 | { |
1310 | op->remove (); |
1343 | op->remove (); |
1311 | |
1344 | |
1312 | if (m == &freed_map)//D TODO: remove soon |
1345 | if (m == &freed_map)//D TODO: remove soon |
1313 | {//D |
1346 | {//D |
1314 | LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D |
1347 | LOG (llevError | logBacktrace, "tries to insert object on freed objects map: %s", op->debug_desc ());//D |
1315 | }//D |
1348 | }//D |
1316 | |
1349 | |
1317 | /* Ideally, the caller figures this out. However, it complicates a lot |
1350 | /* Ideally, the caller figures this out. However, it complicates a lot |
1318 | * of areas of callers (eg, anything that uses find_free_spot would now |
1351 | * of areas of callers (eg, anything that uses find_free_spot would now |
1319 | * need extra work |
1352 | * need extra work |
… | |
… | |
1509 | */ |
1542 | */ |
1510 | |
1543 | |
1511 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1544 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1512 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1545 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1513 | { |
1546 | { |
1514 | if (check_move_on (op, originator)) |
1547 | if (check_move_on (op, originator, flag)) |
1515 | return 0; |
1548 | return 0; |
1516 | |
1549 | |
1517 | /* If we are a multi part object, lets work our way through the check |
1550 | /* If we are a multi part object, let's work our way through the check |
1518 | * walk on's. |
1551 | * walk on's. |
1519 | */ |
1552 | */ |
1520 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1553 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1521 | if (check_move_on (tmp, originator)) |
1554 | if (check_move_on (tmp, originator, flag)) |
1522 | return 0; |
1555 | return 0; |
1523 | } |
1556 | } |
1524 | |
1557 | |
1525 | return op; |
1558 | return op; |
1526 | } |
1559 | } |
… | |
… | |
1592 | |
1625 | |
1593 | nr = min (nr, nrof); |
1626 | nr = min (nr, nrof); |
1594 | |
1627 | |
1595 | if (nrof > nr) |
1628 | if (nrof > nr) |
1596 | { |
1629 | { |
|
|
1630 | sint64 oweight = total_weight (); |
|
|
1631 | |
1597 | nrof -= nr; |
1632 | nrof -= nr; |
1598 | adjust_weight (env, -weight * max (1, nr)); // carrying == 0 |
|
|
1599 | |
1633 | |
1600 | if (object *pl = visible_to ()) |
1634 | if (object *pl = visible_to ()) |
1601 | esrv_update_item (UPD_NROF, pl, this); |
1635 | esrv_update_item (UPD_NROF, pl, this); |
|
|
1636 | |
|
|
1637 | adjust_weight (env, oweight, total_weight ()); |
1602 | |
1638 | |
1603 | return true; |
1639 | return true; |
1604 | } |
1640 | } |
1605 | else |
1641 | else |
1606 | { |
1642 | { |
… | |
… | |
1681 | if (op->nrof) |
1717 | if (op->nrof) |
1682 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1718 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1683 | if (object::can_merge (tmp, op)) |
1719 | if (object::can_merge (tmp, op)) |
1684 | { |
1720 | { |
1685 | /* return the original object and remove inserted object |
1721 | /* return the original object and remove inserted object |
1686 | (client needs the original object) */ |
1722 | (client prefers the original object) */ |
|
|
1723 | |
|
|
1724 | // carring must be 0 for mergable objects |
|
|
1725 | sint64 oweight = tmp->weight * tmp->nrof; |
|
|
1726 | |
1687 | tmp->nrof += op->nrof; |
1727 | tmp->nrof += op->nrof; |
1688 | |
1728 | |
1689 | if (object *pl = tmp->visible_to ()) |
1729 | if (object *pl = tmp->visible_to ()) |
1690 | esrv_update_item (UPD_NROF, pl, tmp); |
1730 | esrv_update_item (UPD_NROF, pl, tmp); |
1691 | |
1731 | |
1692 | adjust_weight (this, op->total_weight ()); |
1732 | adjust_weight (this, oweight, tmp->weight * tmp->nrof); |
1693 | |
1733 | |
1694 | op->destroy (); |
1734 | op->destroy (); |
1695 | op = tmp; |
1735 | op = tmp; |
1696 | goto inserted; |
1736 | goto inserted; |
1697 | } |
1737 | } |
… | |
… | |
1713 | op->flag [FLAG_REMOVED] = 0; |
1753 | op->flag [FLAG_REMOVED] = 0; |
1714 | |
1754 | |
1715 | if (object *pl = op->visible_to ()) |
1755 | if (object *pl = op->visible_to ()) |
1716 | esrv_send_item (pl, op); |
1756 | esrv_send_item (pl, op); |
1717 | |
1757 | |
1718 | adjust_weight (this, op->total_weight ()); |
1758 | adjust_weight (this, 0, op->total_weight ()); |
1719 | |
1759 | |
1720 | inserted: |
1760 | inserted: |
1721 | /* reset the light list and los of the players on the map */ |
1761 | /* reset the light list and los of the players on the map */ |
1722 | if (op->glow_radius && is_on_map ()) |
1762 | if (op->glow_radius && is_on_map ()) |
1723 | { |
1763 | { |
… | |
… | |
1752 | * MSW 2001-07-08: Check all objects on space, not just those below |
1792 | * MSW 2001-07-08: Check all objects on space, not just those below |
1753 | * object being inserted. insert_ob_in_map may not put new objects |
1793 | * object being inserted. insert_ob_in_map may not put new objects |
1754 | * on top. |
1794 | * on top. |
1755 | */ |
1795 | */ |
1756 | int |
1796 | int |
1757 | check_move_on (object *op, object *originator) |
1797 | check_move_on (object *op, object *originator, int flags) |
1758 | { |
1798 | { |
1759 | if (op->flag [FLAG_NO_APPLY]) |
1799 | if (op->flag [FLAG_NO_APPLY]) |
1760 | return 0; |
1800 | return 0; |
1761 | |
1801 | |
1762 | object *tmp; |
1802 | object *tmp; |
… | |
… | |
1821 | |
1861 | |
1822 | /* Basically same logic as above, except now for actual apply. */ |
1862 | /* Basically same logic as above, except now for actual apply. */ |
1823 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1863 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1824 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1864 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1825 | { |
1865 | { |
|
|
1866 | if ((flags & INS_NO_AUTO_EXIT) |
|
|
1867 | && (tmp->type == EXIT || tmp->type == TELEPORTER |
|
|
1868 | || tmp->type == HOLE || tmp->type == TRAPDOOR)) //TODO: temporary, fix exits instead |
|
|
1869 | continue; |
|
|
1870 | |
1826 | move_apply (tmp, op, originator); |
1871 | move_apply (tmp, op, originator); |
1827 | |
1872 | |
1828 | if (op->destroyed ()) |
1873 | if (op->destroyed ()) |
1829 | return 1; |
1874 | return 1; |
1830 | |
1875 | |
… | |
… | |
2155 | { |
2200 | { |
2156 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2201 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2157 | } |
2202 | } |
2158 | |
2203 | |
2159 | /* |
2204 | /* |
2160 | * find_dir_2(delta-x,delta-y) will return a direction in which |
2205 | * find_dir_2(delta-x,delta-y) will return a direction value |
2161 | * an object which has subtracted the x and y coordinates of another |
2206 | * for running into direct [dx, dy]. |
2162 | * object, needs to travel toward it. |
2207 | * (the opposite of crossfire's find_dir_2!) |
2163 | */ |
2208 | */ |
2164 | int |
2209 | int |
2165 | find_dir_2 (int x, int y) |
2210 | find_dir_2 (int x, int y) |
2166 | { |
2211 | { |
|
|
2212 | #if 1 // new algorithm |
|
|
2213 | // this works by putting x, y into 16 sectors, which |
|
|
2214 | // are not equal sized, but are a better approximation |
|
|
2215 | // then the old algorithm, and then using a mapping |
|
|
2216 | // table to map it into a direction value. |
|
|
2217 | // basically, it maps these comparisons to each bit |
|
|
2218 | // bit #3: x < 0 |
|
|
2219 | // bit #2: y < 0 |
|
|
2220 | // bit #1: x > y |
|
|
2221 | // bit #0: x > 2y |
|
|
2222 | |
|
|
2223 | static const uint8 dir[16] = { |
|
|
2224 | 4, 5, 4, 3, |
|
|
2225 | 2, 1, 2, 3, |
|
|
2226 | 6, 5, 6, 7, |
|
|
2227 | 8, 1, 8, 7, |
|
|
2228 | }; |
|
|
2229 | int sector = 0; |
|
|
2230 | |
|
|
2231 | // this is a bit ugly, but more likely to result in branchless code |
|
|
2232 | sector |= x < 0 ? 8 : 0; |
|
|
2233 | x = x < 0 ? -x : x; // abs |
|
|
2234 | |
|
|
2235 | sector |= y < 0 ? 4 : 0; |
|
|
2236 | y = y < 0 ? -y : y; // abs |
|
|
2237 | |
|
|
2238 | if (x > y) |
|
|
2239 | { |
|
|
2240 | sector |= 2; |
|
|
2241 | |
|
|
2242 | if (x > y * 2) |
|
|
2243 | sector |= 1; |
|
|
2244 | } |
|
|
2245 | else |
|
|
2246 | { |
|
|
2247 | if (y > x * 2) |
|
|
2248 | sector |= 1; |
|
|
2249 | else if (!y) |
|
|
2250 | return 0; // x == 0 here |
|
|
2251 | } |
|
|
2252 | |
|
|
2253 | return dir [sector]; |
|
|
2254 | #else // old algorithm |
2167 | int q; |
2255 | int q; |
2168 | |
2256 | |
2169 | if (y) |
2257 | if (y) |
2170 | q = x * 100 / y; |
2258 | q = 128 * x / y; |
2171 | else if (x) |
2259 | else if (x) |
2172 | q = -300 * x; |
2260 | q = -512 * x; // to make it > 309 |
2173 | else |
2261 | else |
2174 | return 0; |
2262 | return 0; |
2175 | |
2263 | |
2176 | if (y > 0) |
2264 | if (y > 0) |
2177 | { |
2265 | { |
2178 | if (q < -242) |
2266 | if (q < -309) return 7; |
|
|
2267 | if (q < -52) return 6; |
|
|
2268 | if (q < 52) return 5; |
|
|
2269 | if (q < 309) return 4; |
|
|
2270 | |
2179 | return 3; |
2271 | return 3; |
2180 | if (q < -41) |
2272 | } |
2181 | return 2; |
2273 | else |
2182 | if (q < 41) |
2274 | { |
2183 | return 1; |
2275 | if (q < -309) return 3; |
2184 | if (q < 242) |
2276 | if (q < -52) return 2; |
2185 | return 8; |
2277 | if (q < 52) return 1; |
|
|
2278 | if (q < 309) return 8; |
|
|
2279 | |
2186 | return 7; |
2280 | return 7; |
2187 | } |
2281 | } |
2188 | |
2282 | #endif |
2189 | if (q < -242) |
|
|
2190 | return 7; |
|
|
2191 | if (q < -41) |
|
|
2192 | return 6; |
|
|
2193 | if (q < 41) |
|
|
2194 | return 5; |
|
|
2195 | if (q < 242) |
|
|
2196 | return 4; |
|
|
2197 | |
|
|
2198 | return 3; |
|
|
2199 | } |
2283 | } |
2200 | |
2284 | |
2201 | /* |
2285 | /* |
2202 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2286 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2203 | * between two directions (which are expected to be absolute (see absdir()) |
2287 | * between two directions (which are expected to be absolute (see absdir()) |
2204 | */ |
2288 | */ |
2205 | int |
2289 | int |
2206 | dirdiff (int dir1, int dir2) |
2290 | dirdiff (int dir1, int dir2) |
2207 | { |
2291 | { |
2208 | int d; |
|
|
2209 | |
|
|
2210 | d = abs (dir1 - dir2); |
2292 | int d = abs (dir1 - dir2); |
2211 | if (d > 4) |
|
|
2212 | d = 8 - d; |
|
|
2213 | |
2293 | |
2214 | return d; |
2294 | return d > 4 ? 8 - d : d; |
2215 | } |
2295 | } |
2216 | |
2296 | |
2217 | /* peterm: |
2297 | /* peterm: |
2218 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2298 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2219 | * Basically, this is a table of directions, and what directions |
2299 | * Basically, this is a table of directions, and what directions |
… | |
… | |
2369 | return tmp; |
2449 | return tmp; |
2370 | |
2450 | |
2371 | return 0; |
2451 | return 0; |
2372 | } |
2452 | } |
2373 | |
2453 | |
|
|
2454 | /* Zero the key_values on op, decrementing the shared-string |
|
|
2455 | * refcounts and freeing the links. |
|
|
2456 | */ |
|
|
2457 | void |
|
|
2458 | key_values::clear () |
|
|
2459 | { |
|
|
2460 | for (key_value *kvp = first; kvp; ) |
|
|
2461 | { |
|
|
2462 | key_value *next = kvp->next; |
|
|
2463 | delete kvp; |
|
|
2464 | kvp = next; |
|
|
2465 | } |
|
|
2466 | |
|
|
2467 | first = 0; |
|
|
2468 | } |
|
|
2469 | |
2374 | shstr_tmp |
2470 | shstr_tmp |
2375 | object::kv_get (shstr_tmp key) const |
2471 | key_values::get (shstr_tmp key) const |
2376 | { |
2472 | { |
2377 | for (key_value *kv = key_values; kv; kv = kv->next) |
2473 | for (key_value *kv = first; kv; kv = kv->next) |
2378 | if (kv->key == key) |
2474 | if (kv->key == key) |
2379 | return kv->value; |
2475 | return kv->value; |
2380 | |
2476 | |
2381 | return shstr (); |
2477 | return shstr (); |
2382 | } |
2478 | } |
2383 | |
2479 | |
2384 | void |
2480 | void |
|
|
2481 | key_values::add (shstr_tmp key, shstr_tmp value) |
|
|
2482 | { |
|
|
2483 | key_value *kv = new key_value; |
|
|
2484 | |
|
|
2485 | kv->next = first; |
|
|
2486 | kv->key = key; |
|
|
2487 | kv->value = value; |
|
|
2488 | |
|
|
2489 | first = kv; |
|
|
2490 | } |
|
|
2491 | |
|
|
2492 | void |
2385 | object::kv_set (shstr_tmp key, shstr_tmp value) |
2493 | key_values::set (shstr_tmp key, shstr_tmp value) |
2386 | { |
2494 | { |
2387 | for (key_value *kv = key_values; kv; kv = kv->next) |
2495 | for (key_value *kv = first; kv; kv = kv->next) |
2388 | if (kv->key == key) |
2496 | if (kv->key == key) |
2389 | { |
2497 | { |
2390 | kv->value = value; |
2498 | kv->value = value; |
2391 | return; |
2499 | return; |
2392 | } |
2500 | } |
2393 | |
2501 | |
2394 | key_value *kv = new key_value; |
2502 | add (key, value); |
2395 | |
|
|
2396 | kv->next = key_values; |
|
|
2397 | kv->key = key; |
|
|
2398 | kv->value = value; |
|
|
2399 | |
|
|
2400 | key_values = kv; |
|
|
2401 | } |
2503 | } |
2402 | |
2504 | |
2403 | void |
2505 | void |
2404 | object::kv_del (shstr_tmp key) |
2506 | key_values::del (shstr_tmp key) |
2405 | { |
2507 | { |
2406 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
2508 | for (key_value **kvp = &first; *kvp; kvp = &(*kvp)->next) |
2407 | if ((*kvp)->key == key) |
2509 | if ((*kvp)->key == key) |
2408 | { |
2510 | { |
2409 | key_value *kv = *kvp; |
2511 | key_value *kv = *kvp; |
2410 | *kvp = (*kvp)->next; |
2512 | *kvp = (*kvp)->next; |
2411 | delete kv; |
2513 | delete kv; |
2412 | return; |
2514 | return; |
2413 | } |
2515 | } |
|
|
2516 | } |
|
|
2517 | |
|
|
2518 | void |
|
|
2519 | key_values::reverse () |
|
|
2520 | { |
|
|
2521 | key_value *prev = 0; |
|
|
2522 | key_value *head = first; |
|
|
2523 | |
|
|
2524 | while (head) |
|
|
2525 | { |
|
|
2526 | key_value *node = head; |
|
|
2527 | head = head->next; |
|
|
2528 | node->next = prev; |
|
|
2529 | prev = node; |
|
|
2530 | } |
|
|
2531 | |
|
|
2532 | first = prev; |
|
|
2533 | } |
|
|
2534 | |
|
|
2535 | key_values & |
|
|
2536 | key_values::operator =(const key_values &kv) |
|
|
2537 | { |
|
|
2538 | clear (); |
|
|
2539 | |
|
|
2540 | for (key_value *kvp = kv.first; kvp; kvp = kvp->next) |
|
|
2541 | add (kvp->key, kvp->value); |
|
|
2542 | |
|
|
2543 | reverse (); |
2414 | } |
2544 | } |
2415 | |
2545 | |
2416 | object::depth_iterator::depth_iterator (object *container) |
2546 | object::depth_iterator::depth_iterator (object *container) |
2417 | : iterator_base (container) |
2547 | : iterator_base (container) |
2418 | { |
2548 | { |
… | |
… | |
2598 | object::force_add (shstr_tmp name, int duration) |
2728 | object::force_add (shstr_tmp name, int duration) |
2599 | { |
2729 | { |
2600 | if (object *force = force_find (name)) |
2730 | if (object *force = force_find (name)) |
2601 | force->destroy (); |
2731 | force->destroy (); |
2602 | |
2732 | |
2603 | object *force = get_archetype (FORCE_NAME); |
2733 | object *force = archetype::get (FORCE_NAME); |
2604 | |
2734 | |
2605 | force->slaying = name; |
2735 | force->slaying = name; |
2606 | force->force_set_timer (duration); |
2736 | force->force_set_timer (duration); |
2607 | force->flag [FLAG_APPLIED] = true; |
2737 | force->flag [FLAG_APPLIED] = true; |
2608 | |
2738 | |
… | |
… | |
2677 | } |
2807 | } |
2678 | else |
2808 | else |
2679 | move_type = mt; |
2809 | move_type = mt; |
2680 | } |
2810 | } |
2681 | |
2811 | |
|
|
2812 | /* object should be a player. |
|
|
2813 | * we return the object the player has marked with the 'mark' command |
|
|
2814 | * below. If no match is found (or object has changed), we return |
|
|
2815 | * NULL. We leave it up to the calling function to print messages if |
|
|
2816 | * nothing is found. |
|
|
2817 | */ |
|
|
2818 | object * |
|
|
2819 | object::mark () const |
|
|
2820 | { |
|
|
2821 | if (contr && contr->mark && contr->mark->env == this) |
|
|
2822 | return contr->mark; |
|
|
2823 | else |
|
|
2824 | return 0; |
|
|
2825 | } |
|
|
2826 | |
|
|
2827 | // put marked object first in the inventory |
|
|
2828 | // this is used by identify-like spells so players can influence |
|
|
2829 | // the order a bit. |
|
|
2830 | void |
|
|
2831 | object::splay_marked () |
|
|
2832 | { |
|
|
2833 | if (object *marked = mark ()) |
|
|
2834 | splay (marked); |
|
|
2835 | } |
|
|
2836 | |