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 | current_weapon = ob; |
|
|
479 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
480 | |
|
|
481 | update_stats (); |
|
|
482 | |
|
|
483 | if (ob) |
|
|
484 | { |
|
|
485 | // now check wether any body locations became invalid, in which case |
|
|
486 | // we cannot apply the weapon at the moment. |
|
|
487 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
488 | if (slot[i].used < 0) |
|
|
489 | { |
|
|
490 | current_weapon = chosen_skill = 0; |
|
|
491 | update_stats (); |
|
|
492 | |
|
|
493 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
494 | "You try to balance your applied items all at once, but the %s is too much. " |
|
|
495 | "You need to unapply some items first.", &ob->name); |
|
|
496 | return false; |
|
|
497 | } |
|
|
498 | |
|
|
499 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
500 | } |
|
|
501 | else |
|
|
502 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
503 | |
|
|
504 | return true; |
|
|
505 | } |
|
|
506 | |
454 | /* Zero the key_values on op, decrementing the shared-string |
507 | /* Zero the key_values on op, decrementing the shared-string |
455 | * refcounts and freeing the links. |
508 | * refcounts and freeing the links. |
456 | */ |
509 | */ |
457 | static void |
510 | static void |
458 | free_key_values (object *op) |
511 | free_key_values (object *op) |
459 | { |
512 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
513 | for (key_value *i = op->key_values; i; ) |
461 | { |
514 | { |
462 | key_value *next = i->next; |
515 | key_value *next = i->next; |
463 | delete i; |
516 | delete i; |
464 | |
517 | |
465 | i = next; |
518 | i = next; |
466 | } |
519 | } |
467 | |
520 | |
468 | op->key_values = 0; |
521 | op->key_values = 0; |
469 | } |
522 | } |
470 | |
523 | |
471 | /* |
524 | object & |
472 | * copy_to first frees everything allocated by the dst object, |
525 | 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 | { |
526 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
527 | bool is_freed = flag [FLAG_FREED]; |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
528 | bool is_removed = flag [FLAG_REMOVED]; |
484 | |
529 | |
485 | *(object_copy *)dst = *this; |
530 | *(object_copy *)this = src; |
486 | |
531 | |
487 | if (is_freed) |
532 | flag [FLAG_FREED] = is_freed; |
488 | SET_FLAG (dst, FLAG_FREED); |
533 | 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 | |
534 | |
496 | /* Copy over key_values, if any. */ |
535 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
536 | if (src.key_values) |
498 | { |
537 | { |
499 | key_value *tail = 0; |
538 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
539 | key_values = 0; |
503 | |
540 | |
504 | for (i = key_values; i; i = i->next) |
541 | for (key_value *i = src.key_values; i; i = i->next) |
505 | { |
542 | { |
506 | key_value *new_link = new key_value; |
543 | key_value *new_link = new key_value; |
507 | |
544 | |
508 | new_link->next = 0; |
545 | new_link->next = 0; |
509 | new_link->key = i->key; |
546 | new_link->key = i->key; |
510 | new_link->value = i->value; |
547 | new_link->value = i->value; |
511 | |
548 | |
512 | /* Try and be clever here, too. */ |
549 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
550 | if (!key_values) |
514 | { |
551 | { |
515 | dst->key_values = new_link; |
552 | key_values = new_link; |
516 | tail = new_link; |
553 | tail = new_link; |
517 | } |
554 | } |
518 | else |
555 | else |
519 | { |
556 | { |
520 | tail->next = new_link; |
557 | tail->next = new_link; |
521 | tail = new_link; |
558 | tail = new_link; |
522 | } |
559 | } |
523 | } |
560 | } |
524 | } |
561 | } |
|
|
562 | } |
|
|
563 | |
|
|
564 | /* |
|
|
565 | * copy_to first frees everything allocated by the dst object, |
|
|
566 | * and then copies the contents of itself into the second |
|
|
567 | * object, allocating what needs to be allocated. Basically, any |
|
|
568 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
569 | * if the first object is freed, the pointers in the new object |
|
|
570 | * will point at garbage. |
|
|
571 | */ |
|
|
572 | void |
|
|
573 | object::copy_to (object *dst) |
|
|
574 | { |
|
|
575 | *dst = *this; |
|
|
576 | |
|
|
577 | if (speed < 0) |
|
|
578 | dst->speed_left = speed_left - rndm (); |
525 | |
579 | |
526 | dst->set_speed (dst->speed); |
580 | dst->set_speed (dst->speed); |
|
|
581 | } |
|
|
582 | |
|
|
583 | void |
|
|
584 | object::instantiate () |
|
|
585 | { |
|
|
586 | if (!uuid.seq) // HACK |
|
|
587 | uuid = gen_uuid (); |
|
|
588 | |
|
|
589 | speed_left = -0.1f; |
|
|
590 | /* copy the body_info to the body_used - this is only really |
|
|
591 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
592 | * by doing so, when a monster is created, it has good starting |
|
|
593 | * values for the body_used info, so when items are created |
|
|
594 | * for it, they can be properly equipped. |
|
|
595 | */ |
|
|
596 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
597 | slot[i].used = slot[i].info; |
|
|
598 | |
|
|
599 | attachable::instantiate (); |
527 | } |
600 | } |
528 | |
601 | |
529 | object * |
602 | object * |
530 | object::clone () |
603 | object::clone () |
531 | { |
604 | { |
… | |
… | |
589 | * UP_OBJ_FACE: only the objects face has changed. |
662 | * UP_OBJ_FACE: only the objects face has changed. |
590 | */ |
663 | */ |
591 | void |
664 | void |
592 | update_object (object *op, int action) |
665 | update_object (object *op, int action) |
593 | { |
666 | { |
594 | MoveType move_on, move_off, move_block, move_slow; |
|
|
595 | |
|
|
596 | if (op == NULL) |
667 | if (op == NULL) |
597 | { |
668 | { |
598 | /* this should never happen */ |
669 | /* this should never happen */ |
599 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
670 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
600 | return; |
671 | return; |
… | |
… | |
670 | face = blank_face; |
741 | face = blank_face; |
671 | } |
742 | } |
672 | |
743 | |
673 | object::~object () |
744 | object::~object () |
674 | { |
745 | { |
675 | if (index) |
|
|
676 | unlink (); |
746 | unlink (); |
677 | |
747 | |
678 | free_key_values (this); |
748 | free_key_values (this); |
679 | } |
749 | } |
680 | |
750 | |
681 | static int object_count; |
751 | static int object_count; |
… | |
… | |
690 | objects.insert (this); |
760 | objects.insert (this); |
691 | } |
761 | } |
692 | |
762 | |
693 | void object::unlink () |
763 | void object::unlink () |
694 | { |
764 | { |
695 | assert (index);//D |
765 | if (!index) |
|
|
766 | return; |
|
|
767 | |
696 | objects.erase (this); |
768 | objects.erase (this); |
697 | refcnt_dec (); |
769 | refcnt_dec (); |
698 | } |
770 | } |
699 | |
771 | |
700 | void |
772 | void |
… | |
… | |
774 | * drop on that space. |
846 | * drop on that space. |
775 | */ |
847 | */ |
776 | if (!drop_to_ground |
848 | if (!drop_to_ground |
777 | || !map |
849 | || !map |
778 | || map->in_memory != MAP_IN_MEMORY |
850 | || map->in_memory != MAP_IN_MEMORY |
|
|
851 | || map->nodrop |
779 | || ms ().move_block == MOVE_ALL) |
852 | || ms ().move_block == MOVE_ALL) |
780 | { |
853 | { |
781 | while (inv) |
854 | while (inv) |
782 | { |
855 | { |
783 | inv->destroy_inv (drop_to_ground); |
856 | inv->destroy_inv (drop_to_ground); |
… | |
… | |
899 | * This function removes the object op from the linked list of objects |
972 | * This function removes the object op from the linked list of objects |
900 | * which it is currently tied to. When this function is done, the |
973 | * which it is currently tied to. When this function is done, the |
901 | * object will have no environment. If the object previously had an |
974 | * object will have no environment. If the object previously had an |
902 | * environment, the x and y coordinates will be updated to |
975 | * environment, the x and y coordinates will be updated to |
903 | * the previous environment. |
976 | * the previous environment. |
904 | * Beware: This function is called from the editor as well! |
|
|
905 | */ |
977 | */ |
906 | void |
978 | void |
907 | object::remove_slow () |
979 | object::do_remove () |
908 | { |
980 | { |
909 | object *tmp, *last = 0; |
981 | object *tmp, *last = 0; |
910 | object *otmp; |
982 | object *otmp; |
911 | |
983 | |
912 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
984 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
… | |
… | |
955 | } |
1027 | } |
956 | else if (map) |
1028 | else if (map) |
957 | { |
1029 | { |
958 | if (type == PLAYER) |
1030 | if (type == PLAYER) |
959 | { |
1031 | { |
|
|
1032 | // leaving a spot always closes any open container on the ground |
|
|
1033 | if (container && !container->env) |
|
|
1034 | // this causes spurious floorbox updates, but it ensures |
|
|
1035 | // that the CLOSE event is being sent. |
|
|
1036 | close_container (); |
|
|
1037 | |
960 | --map->players; |
1038 | --map->players; |
961 | map->touch (); |
1039 | map->touch (); |
962 | } |
1040 | } |
963 | |
1041 | |
964 | map->dirty = true; |
1042 | map->dirty = true; |
… | |
… | |
1079 | return top; |
1157 | return top; |
1080 | } |
1158 | } |
1081 | } |
1159 | } |
1082 | |
1160 | |
1083 | return 0; |
1161 | return 0; |
|
|
1162 | } |
|
|
1163 | |
|
|
1164 | void |
|
|
1165 | object::expand_tail () |
|
|
1166 | { |
|
|
1167 | if (more) |
|
|
1168 | return; |
|
|
1169 | |
|
|
1170 | object *prev = this; |
|
|
1171 | |
|
|
1172 | for (archetype *at = arch->more; at; at = at->more) |
|
|
1173 | { |
|
|
1174 | object *op = arch_to_object (at); |
|
|
1175 | |
|
|
1176 | op->name = name; |
|
|
1177 | op->name_pl = name_pl; |
|
|
1178 | op->title = title; |
|
|
1179 | |
|
|
1180 | op->head = this; |
|
|
1181 | prev->more = op; |
|
|
1182 | |
|
|
1183 | prev = op; |
|
|
1184 | } |
1084 | } |
1185 | } |
1085 | |
1186 | |
1086 | /* |
1187 | /* |
1087 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1188 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1088 | * job preparing multi-part monsters. |
1189 | * job preparing multi-part monsters. |
… | |
… | |
1120 | * just 'op' otherwise |
1221 | * just 'op' otherwise |
1121 | */ |
1222 | */ |
1122 | object * |
1223 | object * |
1123 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1224 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1124 | { |
1225 | { |
|
|
1226 | assert (!op->flag [FLAG_FREED]); |
|
|
1227 | |
1125 | object *tmp, *top, *floor = NULL; |
1228 | object *tmp, *top, *floor = NULL; |
1126 | |
1229 | |
1127 | if (QUERY_FLAG (op, FLAG_FREED)) |
|
|
1128 | { |
|
|
1129 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1130 | return NULL; |
|
|
1131 | } |
|
|
1132 | |
|
|
1133 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1134 | LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ()); |
|
|
1135 | |
|
|
1136 | op->remove (); |
1230 | op->remove (); |
1137 | |
1231 | |
1138 | if (!m) |
1232 | #if 0 |
1139 | { |
1233 | if (!m->active != !op->active) |
1140 | char *dump = dump_object (op); |
1234 | if (m->active) |
1141 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1235 | op->activate_recursive (); |
1142 | free (dump); |
1236 | else |
1143 | return op; |
1237 | op->deactivate_recursive (); |
1144 | } |
1238 | #endif |
1145 | |
1239 | |
1146 | if (out_of_map (m, op->x, op->y)) |
1240 | if (out_of_map (m, op->x, op->y)) |
1147 | { |
1241 | { |
1148 | char *dump = dump_object (op); |
|
|
1149 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1242 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1150 | #ifdef MANY_CORES |
1243 | #ifdef MANY_CORES |
1151 | /* Better to catch this here, as otherwise the next use of this object |
1244 | /* Better to catch this here, as otherwise the next use of this object |
1152 | * is likely to cause a crash. Better to find out where it is getting |
1245 | * is likely to cause a crash. Better to find out where it is getting |
1153 | * improperly inserted. |
1246 | * improperly inserted. |
1154 | */ |
1247 | */ |
1155 | abort (); |
1248 | abort (); |
1156 | #endif |
1249 | #endif |
1157 | free (dump); |
|
|
1158 | return op; |
1250 | return op; |
1159 | } |
1251 | } |
1160 | |
1252 | |
1161 | if (object *more = op->more) |
1253 | if (object *more = op->more) |
1162 | { |
1254 | { |
… | |
… | |
1259 | * looks like instead of lots of conditions here. |
1351 | * looks like instead of lots of conditions here. |
1260 | * makes things faster, and effectively the same result. |
1352 | * makes things faster, and effectively the same result. |
1261 | */ |
1353 | */ |
1262 | |
1354 | |
1263 | /* Have object 'fall below' other objects that block view. |
1355 | /* Have object 'fall below' other objects that block view. |
1264 | * Unless those objects are exits, type 66 |
1356 | * Unless those objects are exits. |
1265 | * If INS_ON_TOP is used, don't do this processing |
1357 | * If INS_ON_TOP is used, don't do this processing |
1266 | * Need to find the object that in fact blocks view, otherwise |
1358 | * Need to find the object that in fact blocks view, otherwise |
1267 | * stacking is a bit odd. |
1359 | * stacking is a bit odd. |
1268 | */ |
1360 | */ |
1269 | if (!(flag & INS_ON_TOP) |
1361 | if (!(flag & INS_ON_TOP) |
1270 | && ms.flags () & P_BLOCKSVIEW |
1362 | && ms.flags () & P_BLOCKSVIEW |
1271 | && (op->face && !op->face->visibility)) |
1363 | && (op->face && !faces [op->face].visibility)) |
1272 | { |
1364 | { |
1273 | for (last = top; last != floor; last = last->below) |
1365 | for (last = top; last != floor; last = last->below) |
1274 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1366 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1275 | break; |
1367 | break; |
1276 | |
1368 | |
… | |
… | |
1402 | } |
1494 | } |
1403 | |
1495 | |
1404 | object * |
1496 | object * |
1405 | object::insert_at (object *where, object *originator, int flags) |
1497 | object::insert_at (object *where, object *originator, int flags) |
1406 | { |
1498 | { |
1407 | where->map->insert (this, where->x, where->y, originator, flags); |
1499 | return where->map->insert (this, where->x, where->y, originator, flags); |
1408 | } |
1500 | } |
1409 | |
1501 | |
1410 | /* |
1502 | /* |
1411 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1503 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1412 | * is returned contains nr objects, and the remaining parts contains |
1504 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1452 | * the amount of an object. If the amount reaches 0, the object |
1544 | * the amount of an object. If the amount reaches 0, the object |
1453 | * is subsequently removed and freed. |
1545 | * is subsequently removed and freed. |
1454 | * |
1546 | * |
1455 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1547 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1456 | */ |
1548 | */ |
1457 | |
|
|
1458 | object * |
1549 | object * |
1459 | decrease_ob_nr (object *op, uint32 i) |
1550 | decrease_ob_nr (object *op, uint32 i) |
1460 | { |
1551 | { |
1461 | object *tmp; |
1552 | object *tmp; |
1462 | |
1553 | |
… | |
… | |
1537 | |
1628 | |
1538 | /* |
1629 | /* |
1539 | * add_weight(object, weight) adds the specified weight to an object, |
1630 | * add_weight(object, weight) adds the specified weight to an object, |
1540 | * and also updates how much the environment(s) is/are carrying. |
1631 | * and also updates how much the environment(s) is/are carrying. |
1541 | */ |
1632 | */ |
1542 | |
|
|
1543 | void |
1633 | void |
1544 | add_weight (object *op, signed long weight) |
1634 | add_weight (object *op, signed long weight) |
1545 | { |
1635 | { |
1546 | while (op != NULL) |
1636 | while (op != NULL) |
1547 | { |
1637 | { |
… | |
… | |
1579 | * inside the object environment. |
1669 | * inside the object environment. |
1580 | * |
1670 | * |
1581 | * The function returns now pointer to inserted item, and return value can |
1671 | * The function returns now pointer to inserted item, and return value can |
1582 | * be != op, if items are merged. -Tero |
1672 | * be != op, if items are merged. -Tero |
1583 | */ |
1673 | */ |
1584 | |
|
|
1585 | object * |
1674 | object * |
1586 | object::insert (object *op) |
1675 | object::insert (object *op) |
1587 | { |
1676 | { |
1588 | object *tmp, *otmp; |
1677 | object *tmp, *otmp; |
1589 | |
1678 | |
… | |
… | |
1749 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1838 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1750 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1839 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1751 | { |
1840 | { |
1752 | |
1841 | |
1753 | float |
1842 | float |
1754 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1843 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1755 | |
1844 | |
1756 | if (op->type == PLAYER) |
1845 | if (op->type == PLAYER) |
1757 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1846 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1758 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1847 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1759 | diff /= 4.0; |
1848 | diff /= 4.0; |
… | |
… | |
1966 | } |
2055 | } |
1967 | |
2056 | |
1968 | if (!index) |
2057 | if (!index) |
1969 | return -1; |
2058 | return -1; |
1970 | |
2059 | |
1971 | return altern[RANDOM () % index]; |
2060 | return altern [rndm (index)]; |
1972 | } |
2061 | } |
1973 | |
2062 | |
1974 | /* |
2063 | /* |
1975 | * find_first_free_spot(archetype, maptile, x, y) works like |
2064 | * find_first_free_spot(archetype, maptile, x, y) works like |
1976 | * find_free_spot(), but it will search max number of squares. |
2065 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
1997 | { |
2086 | { |
1998 | arr += begin; |
2087 | arr += begin; |
1999 | end -= begin; |
2088 | end -= begin; |
2000 | |
2089 | |
2001 | while (--end) |
2090 | while (--end) |
2002 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2091 | swap (arr [end], arr [rndm (end + 1)]); |
2003 | } |
2092 | } |
2004 | |
2093 | |
2005 | /* new function to make monster searching more efficient, and effective! |
2094 | /* new function to make monster searching more efficient, and effective! |
2006 | * This basically returns a randomized array (in the passed pointer) of |
2095 | * This basically returns a randomized array (in the passed pointer) of |
2007 | * the spaces to find monsters. In this way, it won't always look for |
2096 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2319 | insert_ob_in_ob (object_create_clone (item), dst); |
2408 | insert_ob_in_ob (object_create_clone (item), dst); |
2320 | |
2409 | |
2321 | return dst; |
2410 | return dst; |
2322 | } |
2411 | } |
2323 | |
2412 | |
2324 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2325 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2326 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2327 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2328 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2329 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2330 | object * |
|
|
2331 | load_object_str (const char *obstr) |
|
|
2332 | { |
|
|
2333 | object *op; |
|
|
2334 | char filename[MAX_BUF]; |
|
|
2335 | |
|
|
2336 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2337 | |
|
|
2338 | FILE *tempfile = fopen (filename, "w"); |
|
|
2339 | |
|
|
2340 | if (tempfile == NULL) |
|
|
2341 | { |
|
|
2342 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2343 | return NULL; |
|
|
2344 | } |
|
|
2345 | |
|
|
2346 | fprintf (tempfile, obstr); |
|
|
2347 | fclose (tempfile); |
|
|
2348 | |
|
|
2349 | op = object::create (); |
|
|
2350 | |
|
|
2351 | object_thawer thawer (filename); |
|
|
2352 | |
|
|
2353 | if (thawer) |
|
|
2354 | load_object (thawer, op, 0); |
|
|
2355 | |
|
|
2356 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2357 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2358 | |
|
|
2359 | return op; |
|
|
2360 | } |
|
|
2361 | |
|
|
2362 | /* This returns the first object in who's inventory that |
2413 | /* This returns the first object in who's inventory that |
2363 | * has the same type and subtype match. |
2414 | * has the same type and subtype match. |
2364 | * returns NULL if no match. |
2415 | * returns NULL if no match. |
2365 | */ |
2416 | */ |
2366 | object * |
2417 | object * |
… | |
… | |
2419 | if (link->key == canonical_key) |
2470 | if (link->key == canonical_key) |
2420 | return link->value; |
2471 | return link->value; |
2421 | |
2472 | |
2422 | return 0; |
2473 | return 0; |
2423 | } |
2474 | } |
2424 | |
|
|
2425 | |
2475 | |
2426 | /* |
2476 | /* |
2427 | * Updates the canonical_key in op to value. |
2477 | * Updates the canonical_key in op to value. |
2428 | * |
2478 | * |
2429 | * canonical_key is a shared string (value doesn't have to be). |
2479 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2569 | { |
2619 | { |
2570 | char flagdesc[512]; |
2620 | char flagdesc[512]; |
2571 | char info2[256 * 4]; |
2621 | char info2[256 * 4]; |
2572 | char *p = info; |
2622 | char *p = info; |
2573 | |
2623 | |
2574 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2624 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2575 | count, uuid.seq, |
2625 | count, uuid.seq, |
2576 | &name, |
2626 | &name, |
2577 | title ? "\",title:\"" : "", |
2627 | title ? "\",title:\"" : "", |
2578 | title ? (const char *)title : "", |
2628 | title ? (const char *)title : "", |
2579 | flag_desc (flagdesc, 512), type); |
2629 | flag_desc (flagdesc, 512), type); |
… | |
… | |
2588 | } |
2638 | } |
2589 | |
2639 | |
2590 | const char * |
2640 | const char * |
2591 | object::debug_desc () const |
2641 | object::debug_desc () const |
2592 | { |
2642 | { |
2593 | static char info[256 * 4]; |
2643 | static char info[3][256 * 4]; |
|
|
2644 | static int info_idx; |
|
|
2645 | |
2594 | return debug_desc (info); |
2646 | return debug_desc (info [++info_idx % 3]); |
2595 | } |
2647 | } |
2596 | |
2648 | |
2597 | const char * |
2649 | struct region * |
2598 | object::debug_desc2 () const |
2650 | object::region () const |
2599 | { |
2651 | { |
2600 | static char info[256 * 4]; |
2652 | return map ? map->region (x, y) |
2601 | return debug_desc (info); |
2653 | : region::default_region (); |
2602 | } |
2654 | } |
2603 | |
2655 | |
|
|
2656 | const materialtype_t * |
|
|
2657 | object::dominant_material () const |
|
|
2658 | { |
|
|
2659 | if (materialtype_t *mat = name_to_material (materialname)) |
|
|
2660 | return mat; |
|
|
2661 | |
|
|
2662 | // omfg this is slow, this has to be temporary :) |
|
|
2663 | shstr unknown ("unknown"); |
|
|
2664 | |
|
|
2665 | return name_to_material (unknown); |
|
|
2666 | } |
|
|
2667 | |
|
|
2668 | void |
|
|
2669 | object::open_container (object *new_container) |
|
|
2670 | { |
|
|
2671 | if (container == new_container) |
|
|
2672 | return; |
|
|
2673 | |
|
|
2674 | if (object *old_container = container) |
|
|
2675 | { |
|
|
2676 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2677 | return; |
|
|
2678 | |
|
|
2679 | #if 0 |
|
|
2680 | // remove the "Close old_container" object. |
|
|
2681 | if (object *closer = old_container->inv) |
|
|
2682 | if (closer->type == CLOSE_CON) |
|
|
2683 | closer->destroy (); |
|
|
2684 | #endif |
|
|
2685 | |
|
|
2686 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2687 | container = 0; |
|
|
2688 | |
|
|
2689 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2690 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2691 | } |
|
|
2692 | |
|
|
2693 | if (new_container) |
|
|
2694 | { |
|
|
2695 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2696 | return; |
|
|
2697 | |
|
|
2698 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2699 | #if 0 |
|
|
2700 | // insert the "Close Container" object. |
|
|
2701 | if (archetype *closer = new_container->other_arch) |
|
|
2702 | { |
|
|
2703 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2704 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2705 | new_container->insert (closer); |
|
|
2706 | } |
|
|
2707 | #endif |
|
|
2708 | |
|
|
2709 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2710 | |
|
|
2711 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2712 | container = new_container; |
|
|
2713 | |
|
|
2714 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2715 | esrv_send_inventory (this, new_container); |
|
|
2716 | } |
|
|
2717 | } |
|
|
2718 | |
|
|
2719 | |