1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
5 | * Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
7 | * |
7 | * |
… | |
… | |
29 | #include <stdio.h> |
29 | #include <stdio.h> |
30 | #include <sys/types.h> |
30 | #include <sys/types.h> |
31 | #include <sys/uio.h> |
31 | #include <sys/uio.h> |
32 | #include <object.h> |
32 | #include <object.h> |
33 | #include <funcpoint.h> |
33 | #include <funcpoint.h> |
|
|
34 | #include <sproto.h> |
34 | #include <loader.h> |
35 | #include <loader.h> |
35 | |
36 | |
36 | #include <bitset> |
37 | #include <bitset> |
37 | |
38 | |
38 | int nrofallocobjects = 0; |
39 | int nrofallocobjects = 0; |
… | |
… | |
324 | sum_weight (object *op) |
325 | sum_weight (object *op) |
325 | { |
326 | { |
326 | long sum; |
327 | long sum; |
327 | object *inv; |
328 | object *inv; |
328 | |
329 | |
329 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
330 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
330 | { |
331 | { |
331 | if (inv->inv) |
332 | if (inv->inv) |
332 | sum_weight (inv); |
333 | sum_weight (inv); |
|
|
334 | |
333 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
335 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
334 | } |
336 | } |
335 | |
337 | |
336 | if (op->type == CONTAINER && op->stats.Str) |
338 | if (op->type == CONTAINER && op->stats.Str) |
337 | sum = (sum * (100 - op->stats.Str)) / 100; |
339 | sum = (sum * (100 - op->stats.Str)) / 100; |
… | |
… | |
357 | /* |
359 | /* |
358 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
360 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
359 | * Some error messages. |
361 | * Some error messages. |
360 | * The result of the dump is stored in the static global errmsg array. |
362 | * The result of the dump is stored in the static global errmsg array. |
361 | */ |
363 | */ |
362 | |
|
|
363 | char * |
364 | char * |
364 | dump_object (object *op) |
365 | dump_object (object *op) |
365 | { |
366 | { |
366 | if (!op) |
367 | if (!op) |
367 | return strdup ("[NULLOBJ]"); |
368 | return strdup ("[NULLOBJ]"); |
368 | |
369 | |
369 | object_freezer freezer; |
370 | object_freezer freezer; |
370 | save_object (freezer, op, 1); |
371 | op->write (freezer); |
371 | return freezer.as_string (); |
372 | return freezer.as_string (); |
372 | } |
373 | } |
373 | |
374 | |
374 | /* |
375 | /* |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
376 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
449 | owner = owner->owner; |
450 | owner = owner->owner; |
450 | |
451 | |
451 | this->owner = owner; |
452 | this->owner = owner; |
452 | } |
453 | } |
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 your applied items all at once, but the %s is too much. " |
|
|
501 | "You need to unapply some items first.", &ob->name); |
|
|
502 | return false; |
|
|
503 | } |
|
|
504 | |
|
|
505 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
506 | } |
|
|
507 | else |
|
|
508 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
509 | |
|
|
510 | return true; |
|
|
511 | } |
|
|
512 | |
454 | /* Zero the key_values on op, decrementing the shared-string |
513 | /* Zero the key_values on op, decrementing the shared-string |
455 | * refcounts and freeing the links. |
514 | * refcounts and freeing the links. |
456 | */ |
515 | */ |
457 | static void |
516 | static void |
458 | free_key_values (object *op) |
517 | free_key_values (object *op) |
459 | { |
518 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
519 | for (key_value *i = op->key_values; i; ) |
461 | { |
520 | { |
462 | key_value *next = i->next; |
521 | key_value *next = i->next; |
463 | delete i; |
522 | delete i; |
464 | |
523 | |
465 | i = next; |
524 | i = next; |
466 | } |
525 | } |
467 | |
526 | |
468 | op->key_values = 0; |
527 | op->key_values = 0; |
469 | } |
528 | } |
470 | |
529 | |
471 | /* |
530 | object & |
472 | * copy_to first frees everything allocated by the dst object, |
531 | object::operator =(const object &src) |
473 | * and then copies the contents of itself into the second |
|
|
474 | * object, allocating what needs to be allocated. Basically, any |
|
|
475 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
476 | * if the first object is freed, the pointers in the new object |
|
|
477 | * will point at garbage. |
|
|
478 | */ |
|
|
479 | void |
|
|
480 | object::copy_to (object *dst) |
|
|
481 | { |
532 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
533 | bool is_freed = flag [FLAG_FREED]; |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
534 | bool is_removed = flag [FLAG_REMOVED]; |
484 | |
535 | |
485 | *(object_copy *)dst = *this; |
536 | *(object_copy *)this = src; |
486 | |
537 | |
487 | if (is_freed) |
538 | flag [FLAG_FREED] = is_freed; |
488 | SET_FLAG (dst, FLAG_FREED); |
539 | flag [FLAG_REMOVED] = is_removed; |
489 | |
|
|
490 | if (is_removed) |
|
|
491 | SET_FLAG (dst, FLAG_REMOVED); |
|
|
492 | |
|
|
493 | if (speed < 0) |
|
|
494 | dst->speed_left = speed_left - rndm (); |
|
|
495 | |
540 | |
496 | /* Copy over key_values, if any. */ |
541 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
542 | if (src.key_values) |
498 | { |
543 | { |
499 | key_value *tail = 0; |
544 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
545 | key_values = 0; |
503 | |
546 | |
504 | for (i = key_values; i; i = i->next) |
547 | for (key_value *i = src.key_values; i; i = i->next) |
505 | { |
548 | { |
506 | key_value *new_link = new key_value; |
549 | key_value *new_link = new key_value; |
507 | |
550 | |
508 | new_link->next = 0; |
551 | new_link->next = 0; |
509 | new_link->key = i->key; |
552 | new_link->key = i->key; |
510 | new_link->value = i->value; |
553 | new_link->value = i->value; |
511 | |
554 | |
512 | /* Try and be clever here, too. */ |
555 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
556 | if (!key_values) |
514 | { |
557 | { |
515 | dst->key_values = new_link; |
558 | key_values = new_link; |
516 | tail = new_link; |
559 | tail = new_link; |
517 | } |
560 | } |
518 | else |
561 | else |
519 | { |
562 | { |
520 | tail->next = new_link; |
563 | tail->next = new_link; |
521 | tail = new_link; |
564 | tail = new_link; |
522 | } |
565 | } |
523 | } |
566 | } |
524 | } |
567 | } |
|
|
568 | } |
|
|
569 | |
|
|
570 | /* |
|
|
571 | * copy_to first frees everything allocated by the dst object, |
|
|
572 | * and then copies the contents of itself into the second |
|
|
573 | * object, allocating what needs to be allocated. Basically, any |
|
|
574 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
575 | * if the first object is freed, the pointers in the new object |
|
|
576 | * will point at garbage. |
|
|
577 | */ |
|
|
578 | void |
|
|
579 | object::copy_to (object *dst) |
|
|
580 | { |
|
|
581 | *dst = *this; |
|
|
582 | |
|
|
583 | if (speed < 0) |
|
|
584 | dst->speed_left = speed_left - rndm (); |
525 | |
585 | |
526 | dst->set_speed (dst->speed); |
586 | dst->set_speed (dst->speed); |
|
|
587 | } |
|
|
588 | |
|
|
589 | void |
|
|
590 | object::instantiate () |
|
|
591 | { |
|
|
592 | if (!uuid.seq) // HACK |
|
|
593 | uuid = gen_uuid (); |
|
|
594 | |
|
|
595 | speed_left = -0.1f; |
|
|
596 | /* copy the body_info to the body_used - this is only really |
|
|
597 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
598 | * by doing so, when a monster is created, it has good starting |
|
|
599 | * values for the body_used info, so when items are created |
|
|
600 | * for it, they can be properly equipped. |
|
|
601 | */ |
|
|
602 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
603 | slot[i].used = slot[i].info; |
|
|
604 | |
|
|
605 | attachable::instantiate (); |
527 | } |
606 | } |
528 | |
607 | |
529 | object * |
608 | object * |
530 | object::clone () |
609 | object::clone () |
531 | { |
610 | { |
… | |
… | |
589 | * UP_OBJ_FACE: only the objects face has changed. |
668 | * UP_OBJ_FACE: only the objects face has changed. |
590 | */ |
669 | */ |
591 | void |
670 | void |
592 | update_object (object *op, int action) |
671 | update_object (object *op, int action) |
593 | { |
672 | { |
594 | MoveType move_on, move_off, move_block, move_slow; |
|
|
595 | |
|
|
596 | if (op == NULL) |
673 | if (op == NULL) |
597 | { |
674 | { |
598 | /* this should never happen */ |
675 | /* this should never happen */ |
599 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
676 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
600 | return; |
677 | return; |
… | |
… | |
670 | face = blank_face; |
747 | face = blank_face; |
671 | } |
748 | } |
672 | |
749 | |
673 | object::~object () |
750 | object::~object () |
674 | { |
751 | { |
|
|
752 | unlink (); |
|
|
753 | |
675 | free_key_values (this); |
754 | free_key_values (this); |
676 | } |
755 | } |
677 | |
756 | |
678 | static int object_count; |
757 | static int object_count; |
679 | |
758 | |
… | |
… | |
687 | objects.insert (this); |
766 | objects.insert (this); |
688 | } |
767 | } |
689 | |
768 | |
690 | void object::unlink () |
769 | void object::unlink () |
691 | { |
770 | { |
692 | assert (index);//D |
771 | if (!index) |
|
|
772 | return; |
|
|
773 | |
693 | objects.erase (this); |
774 | objects.erase (this); |
694 | refcnt_dec (); |
775 | refcnt_dec (); |
695 | } |
776 | } |
696 | |
777 | |
697 | void |
778 | void |
… | |
… | |
771 | * drop on that space. |
852 | * drop on that space. |
772 | */ |
853 | */ |
773 | if (!drop_to_ground |
854 | if (!drop_to_ground |
774 | || !map |
855 | || !map |
775 | || map->in_memory != MAP_IN_MEMORY |
856 | || map->in_memory != MAP_IN_MEMORY |
|
|
857 | || map->nodrop |
776 | || ms ().move_block == MOVE_ALL) |
858 | || ms ().move_block == MOVE_ALL) |
777 | { |
859 | { |
778 | while (inv) |
860 | while (inv) |
779 | { |
861 | { |
780 | inv->destroy_inv (drop_to_ground); |
862 | inv->destroy_inv (drop_to_ground); |
… | |
… | |
896 | * This function removes the object op from the linked list of objects |
978 | * This function removes the object op from the linked list of objects |
897 | * which it is currently tied to. When this function is done, the |
979 | * which it is currently tied to. When this function is done, the |
898 | * object will have no environment. If the object previously had an |
980 | * object will have no environment. If the object previously had an |
899 | * environment, the x and y coordinates will be updated to |
981 | * environment, the x and y coordinates will be updated to |
900 | * the previous environment. |
982 | * the previous environment. |
901 | * Beware: This function is called from the editor as well! |
|
|
902 | */ |
983 | */ |
903 | void |
984 | void |
904 | object::remove_slow () |
985 | object::do_remove () |
905 | { |
986 | { |
906 | object *tmp, *last = 0; |
987 | object *tmp, *last = 0; |
907 | object *otmp; |
988 | object *otmp; |
908 | |
989 | |
909 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
990 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
… | |
… | |
952 | } |
1033 | } |
953 | else if (map) |
1034 | else if (map) |
954 | { |
1035 | { |
955 | if (type == PLAYER) |
1036 | if (type == PLAYER) |
956 | { |
1037 | { |
|
|
1038 | // leaving a spot always closes any open container on the ground |
|
|
1039 | if (container && !container->env) |
|
|
1040 | // this causes spurious floorbox updates, but it ensures |
|
|
1041 | // that the CLOSE event is being sent. |
|
|
1042 | close_container (); |
|
|
1043 | |
957 | --map->players; |
1044 | --map->players; |
958 | map->touch (); |
1045 | map->touch (); |
959 | } |
1046 | } |
960 | |
1047 | |
961 | map->dirty = true; |
1048 | map->dirty = true; |
… | |
… | |
1076 | return top; |
1163 | return top; |
1077 | } |
1164 | } |
1078 | } |
1165 | } |
1079 | |
1166 | |
1080 | return 0; |
1167 | return 0; |
|
|
1168 | } |
|
|
1169 | |
|
|
1170 | void |
|
|
1171 | object::expand_tail () |
|
|
1172 | { |
|
|
1173 | if (more) |
|
|
1174 | return; |
|
|
1175 | |
|
|
1176 | object *prev = this; |
|
|
1177 | |
|
|
1178 | for (archetype *at = arch->more; at; at = at->more) |
|
|
1179 | { |
|
|
1180 | object *op = arch_to_object (at); |
|
|
1181 | |
|
|
1182 | op->name = name; |
|
|
1183 | op->name_pl = name_pl; |
|
|
1184 | op->title = title; |
|
|
1185 | |
|
|
1186 | op->head = this; |
|
|
1187 | prev->more = op; |
|
|
1188 | |
|
|
1189 | prev = op; |
|
|
1190 | } |
1081 | } |
1191 | } |
1082 | |
1192 | |
1083 | /* |
1193 | /* |
1084 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1194 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1085 | * job preparing multi-part monsters. |
1195 | * job preparing multi-part monsters. |
… | |
… | |
1117 | * just 'op' otherwise |
1227 | * just 'op' otherwise |
1118 | */ |
1228 | */ |
1119 | object * |
1229 | object * |
1120 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1230 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1121 | { |
1231 | { |
|
|
1232 | assert (!op->flag [FLAG_FREED]); |
|
|
1233 | |
1122 | object *tmp, *top, *floor = NULL; |
1234 | object *tmp, *top, *floor = NULL; |
1123 | |
1235 | |
1124 | if (QUERY_FLAG (op, FLAG_FREED)) |
|
|
1125 | { |
|
|
1126 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1127 | return NULL; |
|
|
1128 | } |
|
|
1129 | |
|
|
1130 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1131 | LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ()); |
|
|
1132 | |
|
|
1133 | op->remove (); |
1236 | op->remove (); |
1134 | |
1237 | |
1135 | if (!m) |
1238 | #if 0 |
1136 | { |
1239 | if (!m->active != !op->active) |
1137 | char *dump = dump_object (op); |
1240 | if (m->active) |
1138 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1241 | op->activate_recursive (); |
1139 | free (dump); |
1242 | else |
1140 | return op; |
1243 | op->deactivate_recursive (); |
1141 | } |
1244 | #endif |
1142 | |
1245 | |
1143 | if (out_of_map (m, op->x, op->y)) |
1246 | if (out_of_map (m, op->x, op->y)) |
1144 | { |
1247 | { |
1145 | char *dump = dump_object (op); |
|
|
1146 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1248 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1147 | #ifdef MANY_CORES |
1249 | #ifdef MANY_CORES |
1148 | /* Better to catch this here, as otherwise the next use of this object |
1250 | /* Better to catch this here, as otherwise the next use of this object |
1149 | * is likely to cause a crash. Better to find out where it is getting |
1251 | * is likely to cause a crash. Better to find out where it is getting |
1150 | * improperly inserted. |
1252 | * improperly inserted. |
1151 | */ |
1253 | */ |
1152 | abort (); |
1254 | abort (); |
1153 | #endif |
1255 | #endif |
1154 | free (dump); |
|
|
1155 | return op; |
1256 | return op; |
1156 | } |
1257 | } |
1157 | |
1258 | |
1158 | if (object *more = op->more) |
1259 | if (object *more = op->more) |
1159 | { |
1260 | { |
… | |
… | |
1256 | * looks like instead of lots of conditions here. |
1357 | * looks like instead of lots of conditions here. |
1257 | * makes things faster, and effectively the same result. |
1358 | * makes things faster, and effectively the same result. |
1258 | */ |
1359 | */ |
1259 | |
1360 | |
1260 | /* Have object 'fall below' other objects that block view. |
1361 | /* Have object 'fall below' other objects that block view. |
1261 | * Unless those objects are exits, type 66 |
1362 | * Unless those objects are exits. |
1262 | * If INS_ON_TOP is used, don't do this processing |
1363 | * If INS_ON_TOP is used, don't do this processing |
1263 | * Need to find the object that in fact blocks view, otherwise |
1364 | * Need to find the object that in fact blocks view, otherwise |
1264 | * stacking is a bit odd. |
1365 | * stacking is a bit odd. |
1265 | */ |
1366 | */ |
1266 | if (!(flag & INS_ON_TOP) |
1367 | if (!(flag & INS_ON_TOP) |
1267 | && ms.flags () & P_BLOCKSVIEW |
1368 | && ms.flags () & P_BLOCKSVIEW |
1268 | && (op->face && !op->face->visibility)) |
1369 | && (op->face && !faces [op->face].visibility)) |
1269 | { |
1370 | { |
1270 | for (last = top; last != floor; last = last->below) |
1371 | for (last = top; last != floor; last = last->below) |
1271 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1372 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1272 | break; |
1373 | break; |
1273 | |
1374 | |
… | |
… | |
1399 | } |
1500 | } |
1400 | |
1501 | |
1401 | object * |
1502 | object * |
1402 | object::insert_at (object *where, object *originator, int flags) |
1503 | object::insert_at (object *where, object *originator, int flags) |
1403 | { |
1504 | { |
1404 | where->map->insert (this, where->x, where->y, originator, flags); |
1505 | return where->map->insert (this, where->x, where->y, originator, flags); |
1405 | } |
1506 | } |
1406 | |
1507 | |
1407 | /* |
1508 | /* |
1408 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1509 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1409 | * is returned contains nr objects, and the remaining parts contains |
1510 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1449 | * the amount of an object. If the amount reaches 0, the object |
1550 | * the amount of an object. If the amount reaches 0, the object |
1450 | * is subsequently removed and freed. |
1551 | * is subsequently removed and freed. |
1451 | * |
1552 | * |
1452 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1553 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1453 | */ |
1554 | */ |
1454 | |
|
|
1455 | object * |
1555 | object * |
1456 | decrease_ob_nr (object *op, uint32 i) |
1556 | decrease_ob_nr (object *op, uint32 i) |
1457 | { |
1557 | { |
1458 | object *tmp; |
1558 | object *tmp; |
1459 | |
1559 | |
… | |
… | |
1534 | |
1634 | |
1535 | /* |
1635 | /* |
1536 | * add_weight(object, weight) adds the specified weight to an object, |
1636 | * add_weight(object, weight) adds the specified weight to an object, |
1537 | * and also updates how much the environment(s) is/are carrying. |
1637 | * and also updates how much the environment(s) is/are carrying. |
1538 | */ |
1638 | */ |
1539 | |
|
|
1540 | void |
1639 | void |
1541 | add_weight (object *op, signed long weight) |
1640 | add_weight (object *op, signed long weight) |
1542 | { |
1641 | { |
1543 | while (op != NULL) |
1642 | while (op != NULL) |
1544 | { |
1643 | { |
… | |
… | |
1576 | * inside the object environment. |
1675 | * inside the object environment. |
1577 | * |
1676 | * |
1578 | * The function returns now pointer to inserted item, and return value can |
1677 | * The function returns now pointer to inserted item, and return value can |
1579 | * be != op, if items are merged. -Tero |
1678 | * be != op, if items are merged. -Tero |
1580 | */ |
1679 | */ |
1581 | |
|
|
1582 | object * |
1680 | object * |
1583 | object::insert (object *op) |
1681 | object::insert (object *op) |
1584 | { |
1682 | { |
1585 | object *tmp, *otmp; |
1683 | object *tmp, *otmp; |
1586 | |
1684 | |
… | |
… | |
1746 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1844 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1747 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1845 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1748 | { |
1846 | { |
1749 | |
1847 | |
1750 | float |
1848 | float |
1751 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1849 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1752 | |
1850 | |
1753 | if (op->type == PLAYER) |
1851 | if (op->type == PLAYER) |
1754 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1852 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1755 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1853 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1756 | diff /= 4.0; |
1854 | diff /= 4.0; |
… | |
… | |
1963 | } |
2061 | } |
1964 | |
2062 | |
1965 | if (!index) |
2063 | if (!index) |
1966 | return -1; |
2064 | return -1; |
1967 | |
2065 | |
1968 | return altern[RANDOM () % index]; |
2066 | return altern [rndm (index)]; |
1969 | } |
2067 | } |
1970 | |
2068 | |
1971 | /* |
2069 | /* |
1972 | * find_first_free_spot(archetype, maptile, x, y) works like |
2070 | * find_first_free_spot(archetype, maptile, x, y) works like |
1973 | * find_free_spot(), but it will search max number of squares. |
2071 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
1994 | { |
2092 | { |
1995 | arr += begin; |
2093 | arr += begin; |
1996 | end -= begin; |
2094 | end -= begin; |
1997 | |
2095 | |
1998 | while (--end) |
2096 | while (--end) |
1999 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2097 | swap (arr [end], arr [rndm (end + 1)]); |
2000 | } |
2098 | } |
2001 | |
2099 | |
2002 | /* new function to make monster searching more efficient, and effective! |
2100 | /* new function to make monster searching more efficient, and effective! |
2003 | * This basically returns a randomized array (in the passed pointer) of |
2101 | * This basically returns a randomized array (in the passed pointer) of |
2004 | * the spaces to find monsters. In this way, it won't always look for |
2102 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2316 | insert_ob_in_ob (object_create_clone (item), dst); |
2414 | insert_ob_in_ob (object_create_clone (item), dst); |
2317 | |
2415 | |
2318 | return dst; |
2416 | return dst; |
2319 | } |
2417 | } |
2320 | |
2418 | |
2321 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2322 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2323 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2324 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2325 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2326 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2327 | object * |
|
|
2328 | load_object_str (const char *obstr) |
|
|
2329 | { |
|
|
2330 | object *op; |
|
|
2331 | char filename[MAX_BUF]; |
|
|
2332 | |
|
|
2333 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2334 | |
|
|
2335 | FILE *tempfile = fopen (filename, "w"); |
|
|
2336 | |
|
|
2337 | if (tempfile == NULL) |
|
|
2338 | { |
|
|
2339 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2340 | return NULL; |
|
|
2341 | } |
|
|
2342 | |
|
|
2343 | fprintf (tempfile, obstr); |
|
|
2344 | fclose (tempfile); |
|
|
2345 | |
|
|
2346 | op = object::create (); |
|
|
2347 | |
|
|
2348 | object_thawer thawer (filename); |
|
|
2349 | |
|
|
2350 | if (thawer) |
|
|
2351 | load_object (thawer, op, 0); |
|
|
2352 | |
|
|
2353 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2354 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2355 | |
|
|
2356 | return op; |
|
|
2357 | } |
|
|
2358 | |
|
|
2359 | /* This returns the first object in who's inventory that |
2419 | /* This returns the first object in who's inventory that |
2360 | * has the same type and subtype match. |
2420 | * has the same type and subtype match. |
2361 | * returns NULL if no match. |
2421 | * returns NULL if no match. |
2362 | */ |
2422 | */ |
2363 | object * |
2423 | object * |
… | |
… | |
2416 | if (link->key == canonical_key) |
2476 | if (link->key == canonical_key) |
2417 | return link->value; |
2477 | return link->value; |
2418 | |
2478 | |
2419 | return 0; |
2479 | return 0; |
2420 | } |
2480 | } |
2421 | |
|
|
2422 | |
2481 | |
2423 | /* |
2482 | /* |
2424 | * Updates the canonical_key in op to value. |
2483 | * Updates the canonical_key in op to value. |
2425 | * |
2484 | * |
2426 | * canonical_key is a shared string (value doesn't have to be). |
2485 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2566 | { |
2625 | { |
2567 | char flagdesc[512]; |
2626 | char flagdesc[512]; |
2568 | char info2[256 * 4]; |
2627 | char info2[256 * 4]; |
2569 | char *p = info; |
2628 | char *p = info; |
2570 | |
2629 | |
2571 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2630 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2572 | count, uuid.seq, |
2631 | count, uuid.seq, |
2573 | &name, |
2632 | &name, |
2574 | title ? "\",title:\"" : "", |
2633 | title ? "\",title:\"" : "", |
2575 | title ? (const char *)title : "", |
2634 | title ? (const char *)title : "", |
2576 | flag_desc (flagdesc, 512), type); |
2635 | flag_desc (flagdesc, 512), type); |
… | |
… | |
2585 | } |
2644 | } |
2586 | |
2645 | |
2587 | const char * |
2646 | const char * |
2588 | object::debug_desc () const |
2647 | object::debug_desc () const |
2589 | { |
2648 | { |
2590 | static char info[256 * 4]; |
2649 | static char info[3][256 * 4]; |
|
|
2650 | static int info_idx; |
|
|
2651 | |
2591 | return debug_desc (info); |
2652 | return debug_desc (info [++info_idx % 3]); |
2592 | } |
2653 | } |
2593 | |
2654 | |
2594 | const char * |
2655 | struct region * |
2595 | object::debug_desc2 () const |
2656 | object::region () const |
2596 | { |
2657 | { |
2597 | static char info[256 * 4]; |
2658 | return map ? map->region (x, y) |
2598 | return debug_desc (info); |
2659 | : region::default_region (); |
2599 | } |
2660 | } |
2600 | |
2661 | |
|
|
2662 | const materialtype_t * |
|
|
2663 | object::dominant_material () const |
|
|
2664 | { |
|
|
2665 | if (materialtype_t *mat = name_to_material (materialname)) |
|
|
2666 | return mat; |
|
|
2667 | |
|
|
2668 | // omfg this is slow, this has to be temporary :) |
|
|
2669 | shstr unknown ("unknown"); |
|
|
2670 | |
|
|
2671 | return name_to_material (unknown); |
|
|
2672 | } |
|
|
2673 | |
|
|
2674 | void |
|
|
2675 | object::open_container (object *new_container) |
|
|
2676 | { |
|
|
2677 | if (container == new_container) |
|
|
2678 | return; |
|
|
2679 | |
|
|
2680 | if (object *old_container = container) |
|
|
2681 | { |
|
|
2682 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2683 | return; |
|
|
2684 | |
|
|
2685 | #if 0 |
|
|
2686 | // remove the "Close old_container" object. |
|
|
2687 | if (object *closer = old_container->inv) |
|
|
2688 | if (closer->type == CLOSE_CON) |
|
|
2689 | closer->destroy (); |
|
|
2690 | #endif |
|
|
2691 | |
|
|
2692 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2693 | container = 0; |
|
|
2694 | |
|
|
2695 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2696 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2697 | } |
|
|
2698 | |
|
|
2699 | if (new_container) |
|
|
2700 | { |
|
|
2701 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2702 | return; |
|
|
2703 | |
|
|
2704 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2705 | #if 0 |
|
|
2706 | // insert the "Close Container" object. |
|
|
2707 | if (archetype *closer = new_container->other_arch) |
|
|
2708 | { |
|
|
2709 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2710 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2711 | new_container->insert (closer); |
|
|
2712 | } |
|
|
2713 | #endif |
|
|
2714 | |
|
|
2715 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2716 | |
|
|
2717 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2718 | container = new_container; |
|
|
2719 | |
|
|
2720 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2721 | esrv_send_inventory (this, new_container); |
|
|
2722 | } |
|
|
2723 | } |
|
|
2724 | |
|
|
2725 | |