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; |
… | |
… | |
448 | owner = owner->owner; |
450 | owner = owner->owner; |
449 | |
451 | |
450 | this->owner = owner; |
452 | this->owner = owner; |
451 | } |
453 | } |
452 | |
454 | |
|
|
455 | void |
|
|
456 | object::set_weapon (object *ob) |
|
|
457 | { |
|
|
458 | if (current_weapon == ob) |
|
|
459 | return; |
|
|
460 | |
|
|
461 | new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
462 | |
|
|
463 | if (chosen_skill) |
|
|
464 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
465 | |
|
|
466 | current_weapon = ob; |
|
|
467 | chosen_skill = ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
468 | |
|
|
469 | if (chosen_skill) |
|
|
470 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
471 | |
|
|
472 | update_stats (); |
|
|
473 | } |
|
|
474 | |
453 | /* Zero the key_values on op, decrementing the shared-string |
475 | /* Zero the key_values on op, decrementing the shared-string |
454 | * refcounts and freeing the links. |
476 | * refcounts and freeing the links. |
455 | */ |
477 | */ |
456 | static void |
478 | static void |
457 | free_key_values (object *op) |
479 | free_key_values (object *op) |
458 | { |
480 | { |
459 | for (key_value *i = op->key_values; i != 0;) |
481 | for (key_value *i = op->key_values; i; ) |
460 | { |
482 | { |
461 | key_value *next = i->next; |
483 | key_value *next = i->next; |
462 | delete i; |
484 | delete i; |
463 | |
485 | |
464 | i = next; |
486 | i = next; |
465 | } |
487 | } |
466 | |
488 | |
467 | op->key_values = 0; |
489 | op->key_values = 0; |
468 | } |
490 | } |
469 | |
491 | |
470 | /* |
492 | object & |
471 | * copy_to first frees everything allocated by the dst object, |
493 | object::operator =(const object &src) |
472 | * and then copies the contents of itself into the second |
|
|
473 | * object, allocating what needs to be allocated. Basically, any |
|
|
474 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
475 | * if the first object is freed, the pointers in the new object |
|
|
476 | * will point at garbage. |
|
|
477 | */ |
|
|
478 | void |
|
|
479 | object::copy_to (object *dst) |
|
|
480 | { |
494 | { |
481 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
495 | bool is_freed = flag [FLAG_FREED]; |
482 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
496 | bool is_removed = flag [FLAG_REMOVED]; |
483 | |
497 | |
484 | *(object_copy *)dst = *this; |
498 | *(object_copy *)this = src; |
485 | |
499 | |
486 | if (is_freed) |
500 | flag [FLAG_FREED] = is_freed; |
487 | SET_FLAG (dst, FLAG_FREED); |
501 | flag [FLAG_REMOVED] = is_removed; |
488 | |
|
|
489 | if (is_removed) |
|
|
490 | SET_FLAG (dst, FLAG_REMOVED); |
|
|
491 | |
|
|
492 | if (speed < 0) |
|
|
493 | dst->speed_left = speed_left - rndm (); |
|
|
494 | |
502 | |
495 | /* Copy over key_values, if any. */ |
503 | /* Copy over key_values, if any. */ |
496 | if (key_values) |
504 | if (src.key_values) |
497 | { |
505 | { |
498 | key_value *tail = 0; |
506 | key_value *tail = 0; |
499 | key_value *i; |
|
|
500 | |
|
|
501 | dst->key_values = 0; |
507 | key_values = 0; |
502 | |
508 | |
503 | for (i = key_values; i; i = i->next) |
509 | for (key_value *i = src.key_values; i; i = i->next) |
504 | { |
510 | { |
505 | key_value *new_link = new key_value; |
511 | key_value *new_link = new key_value; |
506 | |
512 | |
507 | new_link->next = 0; |
513 | new_link->next = 0; |
508 | new_link->key = i->key; |
514 | new_link->key = i->key; |
509 | new_link->value = i->value; |
515 | new_link->value = i->value; |
510 | |
516 | |
511 | /* Try and be clever here, too. */ |
517 | /* Try and be clever here, too. */ |
512 | if (!dst->key_values) |
518 | if (!key_values) |
513 | { |
519 | { |
514 | dst->key_values = new_link; |
520 | key_values = new_link; |
515 | tail = new_link; |
521 | tail = new_link; |
516 | } |
522 | } |
517 | else |
523 | else |
518 | { |
524 | { |
519 | tail->next = new_link; |
525 | tail->next = new_link; |
520 | tail = new_link; |
526 | tail = new_link; |
521 | } |
527 | } |
522 | } |
528 | } |
523 | } |
529 | } |
|
|
530 | } |
|
|
531 | |
|
|
532 | /* |
|
|
533 | * copy_to first frees everything allocated by the dst object, |
|
|
534 | * and then copies the contents of itself into the second |
|
|
535 | * object, allocating what needs to be allocated. Basically, any |
|
|
536 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
537 | * if the first object is freed, the pointers in the new object |
|
|
538 | * will point at garbage. |
|
|
539 | */ |
|
|
540 | void |
|
|
541 | object::copy_to (object *dst) |
|
|
542 | { |
|
|
543 | *dst = *this; |
|
|
544 | |
|
|
545 | if (speed < 0) |
|
|
546 | dst->speed_left = speed_left - rndm (); |
524 | |
547 | |
525 | dst->set_speed (dst->speed); |
548 | dst->set_speed (dst->speed); |
526 | } |
549 | } |
527 | |
550 | |
528 | void |
551 | void |
… | |
… | |
536 | * need for monsters, but doesn't hurt to do it for everything. |
559 | * need for monsters, but doesn't hurt to do it for everything. |
537 | * by doing so, when a monster is created, it has good starting |
560 | * by doing so, when a monster is created, it has good starting |
538 | * values for the body_used info, so when items are created |
561 | * values for the body_used info, so when items are created |
539 | * for it, they can be properly equipped. |
562 | * for it, they can be properly equipped. |
540 | */ |
563 | */ |
541 | memcpy (body_used, body_info, sizeof (body_used)); |
564 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
565 | slot[i].used = slot[i].info; |
542 | |
566 | |
543 | attachable::instantiate (); |
567 | attachable::instantiate (); |
544 | } |
568 | } |
545 | |
569 | |
546 | object * |
570 | object * |
… | |
… | |
834 | |
858 | |
835 | if (flag [FLAG_IS_LINKED]) |
859 | if (flag [FLAG_IS_LINKED]) |
836 | remove_button_link (this); |
860 | remove_button_link (this); |
837 | |
861 | |
838 | if (flag [FLAG_FRIENDLY]) |
862 | if (flag [FLAG_FRIENDLY]) |
839 | { |
|
|
840 | remove_friendly_object (this); |
863 | remove_friendly_object (this); |
841 | |
|
|
842 | if (type == GOLEM |
|
|
843 | && owner |
|
|
844 | && owner->type == PLAYER |
|
|
845 | && owner->contr->ranges[range_golem] == this) |
|
|
846 | owner->contr->ranges[range_golem] = 0; |
|
|
847 | } |
|
|
848 | |
864 | |
849 | if (!flag [FLAG_REMOVED]) |
865 | if (!flag [FLAG_REMOVED]) |
850 | remove (); |
866 | remove (); |
851 | |
867 | |
852 | destroy_inv (true); |
868 | destroy_inv (true); |
… | |
… | |
1109 | return top; |
1125 | return top; |
1110 | } |
1126 | } |
1111 | } |
1127 | } |
1112 | |
1128 | |
1113 | return 0; |
1129 | return 0; |
|
|
1130 | } |
|
|
1131 | |
|
|
1132 | void |
|
|
1133 | object::expand_tail () |
|
|
1134 | { |
|
|
1135 | if (more) |
|
|
1136 | return; |
|
|
1137 | |
|
|
1138 | object *prev = this; |
|
|
1139 | |
|
|
1140 | for (archetype *at = arch->more; at; at = at->more) |
|
|
1141 | { |
|
|
1142 | object *op = arch_to_object (at); |
|
|
1143 | |
|
|
1144 | op->name = name; |
|
|
1145 | op->name_pl = name_pl; |
|
|
1146 | op->title = title; |
|
|
1147 | |
|
|
1148 | op->head = this; |
|
|
1149 | prev->more = op; |
|
|
1150 | |
|
|
1151 | prev = op; |
|
|
1152 | } |
1114 | } |
1153 | } |
1115 | |
1154 | |
1116 | /* |
1155 | /* |
1117 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1156 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1118 | * job preparing multi-part monsters. |
1157 | * job preparing multi-part monsters. |
… | |
… | |
1150 | * just 'op' otherwise |
1189 | * just 'op' otherwise |
1151 | */ |
1190 | */ |
1152 | object * |
1191 | object * |
1153 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1192 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1154 | { |
1193 | { |
|
|
1194 | assert (!op->flag [FLAG_FREED]); |
|
|
1195 | |
1155 | object *tmp, *top, *floor = NULL; |
1196 | object *tmp, *top, *floor = NULL; |
1156 | |
1197 | |
1157 | if (QUERY_FLAG (op, FLAG_FREED)) |
|
|
1158 | { |
|
|
1159 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1160 | return NULL; |
|
|
1161 | } |
|
|
1162 | |
|
|
1163 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1164 | LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ()); |
|
|
1165 | |
|
|
1166 | op->remove (); |
1198 | op->remove (); |
1167 | |
1199 | |
1168 | if (!m) |
1200 | #if 0 |
1169 | { |
1201 | if (!m->active != !op->active) |
1170 | char *dump = dump_object (op); |
1202 | if (m->active) |
1171 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1203 | op->activate_recursive (); |
1172 | free (dump); |
1204 | else |
1173 | return op; |
1205 | op->deactivate_recursive (); |
1174 | } |
1206 | #endif |
1175 | |
1207 | |
1176 | if (out_of_map (m, op->x, op->y)) |
1208 | if (out_of_map (m, op->x, op->y)) |
1177 | { |
1209 | { |
1178 | char *dump = dump_object (op); |
|
|
1179 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1210 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1180 | #ifdef MANY_CORES |
1211 | #ifdef MANY_CORES |
1181 | /* Better to catch this here, as otherwise the next use of this object |
1212 | /* Better to catch this here, as otherwise the next use of this object |
1182 | * is likely to cause a crash. Better to find out where it is getting |
1213 | * is likely to cause a crash. Better to find out where it is getting |
1183 | * improperly inserted. |
1214 | * improperly inserted. |
1184 | */ |
1215 | */ |
1185 | abort (); |
1216 | abort (); |
1186 | #endif |
1217 | #endif |
1187 | free (dump); |
|
|
1188 | return op; |
1218 | return op; |
1189 | } |
1219 | } |
1190 | |
1220 | |
1191 | if (object *more = op->more) |
1221 | if (object *more = op->more) |
1192 | { |
1222 | { |
… | |
… | |
1289 | * looks like instead of lots of conditions here. |
1319 | * looks like instead of lots of conditions here. |
1290 | * makes things faster, and effectively the same result. |
1320 | * makes things faster, and effectively the same result. |
1291 | */ |
1321 | */ |
1292 | |
1322 | |
1293 | /* Have object 'fall below' other objects that block view. |
1323 | /* Have object 'fall below' other objects that block view. |
1294 | * Unless those objects are exits, type 66 |
1324 | * Unless those objects are exits. |
1295 | * If INS_ON_TOP is used, don't do this processing |
1325 | * If INS_ON_TOP is used, don't do this processing |
1296 | * Need to find the object that in fact blocks view, otherwise |
1326 | * Need to find the object that in fact blocks view, otherwise |
1297 | * stacking is a bit odd. |
1327 | * stacking is a bit odd. |
1298 | */ |
1328 | */ |
1299 | if (!(flag & INS_ON_TOP) |
1329 | if (!(flag & INS_ON_TOP) |
1300 | && ms.flags () & P_BLOCKSVIEW |
1330 | && ms.flags () & P_BLOCKSVIEW |
1301 | && (op->face && !op->face->visibility)) |
1331 | && (op->face && !faces [op->face].visibility)) |
1302 | { |
1332 | { |
1303 | for (last = top; last != floor; last = last->below) |
1333 | for (last = top; last != floor; last = last->below) |
1304 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1334 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1305 | break; |
1335 | break; |
1306 | |
1336 | |
… | |
… | |
1429 | tmp1->x = op->x; |
1459 | tmp1->x = op->x; |
1430 | tmp1->y = op->y; |
1460 | tmp1->y = op->y; |
1431 | insert_ob_in_map (tmp1, op->map, op, 0); |
1461 | insert_ob_in_map (tmp1, op->map, op, 0); |
1432 | } |
1462 | } |
1433 | |
1463 | |
1434 | // XXX: function not returning object* |
|
|
1435 | object * |
1464 | object * |
1436 | object::insert_at (object *where, object *originator, int flags) |
1465 | object::insert_at (object *where, object *originator, int flags) |
1437 | { |
1466 | { |
1438 | where->map->insert (this, where->x, where->y, originator, flags); |
1467 | return where->map->insert (this, where->x, where->y, originator, flags); |
1439 | } |
1468 | } |
1440 | |
1469 | |
1441 | /* |
1470 | /* |
1442 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1471 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1443 | * is returned contains nr objects, and the remaining parts contains |
1472 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1483 | * the amount of an object. If the amount reaches 0, the object |
1512 | * the amount of an object. If the amount reaches 0, the object |
1484 | * is subsequently removed and freed. |
1513 | * is subsequently removed and freed. |
1485 | * |
1514 | * |
1486 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1515 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1487 | */ |
1516 | */ |
1488 | |
|
|
1489 | object * |
1517 | object * |
1490 | decrease_ob_nr (object *op, uint32 i) |
1518 | decrease_ob_nr (object *op, uint32 i) |
1491 | { |
1519 | { |
1492 | object *tmp; |
1520 | object *tmp; |
1493 | |
1521 | |
… | |
… | |
1568 | |
1596 | |
1569 | /* |
1597 | /* |
1570 | * add_weight(object, weight) adds the specified weight to an object, |
1598 | * add_weight(object, weight) adds the specified weight to an object, |
1571 | * and also updates how much the environment(s) is/are carrying. |
1599 | * and also updates how much the environment(s) is/are carrying. |
1572 | */ |
1600 | */ |
1573 | |
|
|
1574 | void |
1601 | void |
1575 | add_weight (object *op, signed long weight) |
1602 | add_weight (object *op, signed long weight) |
1576 | { |
1603 | { |
1577 | while (op != NULL) |
1604 | while (op != NULL) |
1578 | { |
1605 | { |
… | |
… | |
1610 | * inside the object environment. |
1637 | * inside the object environment. |
1611 | * |
1638 | * |
1612 | * The function returns now pointer to inserted item, and return value can |
1639 | * The function returns now pointer to inserted item, and return value can |
1613 | * be != op, if items are merged. -Tero |
1640 | * be != op, if items are merged. -Tero |
1614 | */ |
1641 | */ |
1615 | |
|
|
1616 | object * |
1642 | object * |
1617 | object::insert (object *op) |
1643 | object::insert (object *op) |
1618 | { |
1644 | { |
1619 | object *tmp, *otmp; |
1645 | object *tmp, *otmp; |
1620 | |
1646 | |
… | |
… | |
2413 | return link->value; |
2439 | return link->value; |
2414 | |
2440 | |
2415 | return 0; |
2441 | return 0; |
2416 | } |
2442 | } |
2417 | |
2443 | |
2418 | |
|
|
2419 | /* |
2444 | /* |
2420 | * Updates the canonical_key in op to value. |
2445 | * Updates the canonical_key in op to value. |
2421 | * |
2446 | * |
2422 | * canonical_key is a shared string (value doesn't have to be). |
2447 | * canonical_key is a shared string (value doesn't have to be). |
2423 | * |
2448 | * |
… | |
… | |
2581 | } |
2606 | } |
2582 | |
2607 | |
2583 | const char * |
2608 | const char * |
2584 | object::debug_desc () const |
2609 | object::debug_desc () const |
2585 | { |
2610 | { |
2586 | static char info[256 * 4]; |
2611 | static char info[3][256 * 4]; |
|
|
2612 | static int info_idx; |
|
|
2613 | |
2587 | return debug_desc (info); |
2614 | return debug_desc (info [++info_idx % 3]); |
2588 | } |
|
|
2589 | |
|
|
2590 | const char * |
|
|
2591 | object::debug_desc2 () const |
|
|
2592 | { |
|
|
2593 | static char info[256 * 4]; |
|
|
2594 | return debug_desc (info); |
|
|
2595 | } |
2615 | } |
2596 | |
2616 | |
2597 | struct region * |
2617 | struct region * |
2598 | object::region () const |
2618 | object::region () const |
2599 | { |
2619 | { |