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 | * |
… | |
… | |
313 | |
313 | |
314 | /* Everything passes, must be OK. */ |
314 | /* Everything passes, must be OK. */ |
315 | return 1; |
315 | return 1; |
316 | } |
316 | } |
317 | |
317 | |
|
|
318 | void |
|
|
319 | player::set_range (rangetype r) |
|
|
320 | { |
|
|
321 | shoottype = r; |
|
|
322 | } |
|
|
323 | |
318 | /* |
324 | /* |
319 | * sum_weight() is a recursive function which calculates the weight |
325 | * sum_weight() is a recursive function which calculates the weight |
320 | * an object is carrying. It goes through in figures out how much |
326 | * an object is carrying. It goes through in figures out how much |
321 | * containers are carrying, and sums it up. |
327 | * containers are carrying, and sums it up. |
322 | */ |
328 | */ |
… | |
… | |
357 | /* |
363 | /* |
358 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
364 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
359 | * Some error messages. |
365 | * Some error messages. |
360 | * The result of the dump is stored in the static global errmsg array. |
366 | * The result of the dump is stored in the static global errmsg array. |
361 | */ |
367 | */ |
362 | |
|
|
363 | char * |
368 | char * |
364 | dump_object (object *op) |
369 | dump_object (object *op) |
365 | { |
370 | { |
366 | if (!op) |
371 | if (!op) |
367 | return strdup ("[NULLOBJ]"); |
372 | return strdup ("[NULLOBJ]"); |
368 | |
373 | |
369 | object_freezer freezer; |
374 | object_freezer freezer; |
370 | save_object (freezer, op, 1); |
375 | op->write (freezer); |
371 | return freezer.as_string (); |
376 | return freezer.as_string (); |
372 | } |
377 | } |
373 | |
378 | |
374 | /* |
379 | /* |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
380 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
455 | * refcounts and freeing the links. |
460 | * refcounts and freeing the links. |
456 | */ |
461 | */ |
457 | static void |
462 | static void |
458 | free_key_values (object *op) |
463 | free_key_values (object *op) |
459 | { |
464 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
465 | for (key_value *i = op->key_values; i; ) |
461 | { |
466 | { |
462 | key_value *next = i->next; |
467 | key_value *next = i->next; |
463 | delete i; |
468 | delete i; |
464 | |
469 | |
465 | i = next; |
470 | i = next; |
466 | } |
471 | } |
467 | |
472 | |
468 | op->key_values = 0; |
473 | op->key_values = 0; |
469 | } |
474 | } |
470 | |
475 | |
471 | /* |
476 | object & |
472 | * copy_to first frees everything allocated by the dst object, |
477 | 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 | { |
478 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
479 | bool is_freed = flag [FLAG_FREED]; |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
480 | bool is_removed = flag [FLAG_REMOVED]; |
484 | |
481 | |
485 | *(object_copy *)dst = *this; |
482 | *(object_copy *)this = src; |
486 | |
483 | |
487 | if (is_freed) |
484 | flag [FLAG_FREED] = is_freed; |
488 | SET_FLAG (dst, FLAG_FREED); |
485 | 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 | |
486 | |
496 | /* Copy over key_values, if any. */ |
487 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
488 | if (src.key_values) |
498 | { |
489 | { |
499 | key_value *tail = 0; |
490 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
491 | key_values = 0; |
503 | |
492 | |
504 | for (i = key_values; i; i = i->next) |
493 | for (key_value *i = src.key_values; i; i = i->next) |
505 | { |
494 | { |
506 | key_value *new_link = new key_value; |
495 | key_value *new_link = new key_value; |
507 | |
496 | |
508 | new_link->next = 0; |
497 | new_link->next = 0; |
509 | new_link->key = i->key; |
498 | new_link->key = i->key; |
510 | new_link->value = i->value; |
499 | new_link->value = i->value; |
511 | |
500 | |
512 | /* Try and be clever here, too. */ |
501 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
502 | if (!key_values) |
514 | { |
503 | { |
515 | dst->key_values = new_link; |
504 | key_values = new_link; |
516 | tail = new_link; |
505 | tail = new_link; |
517 | } |
506 | } |
518 | else |
507 | else |
519 | { |
508 | { |
520 | tail->next = new_link; |
509 | tail->next = new_link; |
521 | tail = new_link; |
510 | tail = new_link; |
522 | } |
511 | } |
523 | } |
512 | } |
524 | } |
513 | } |
|
|
514 | } |
|
|
515 | |
|
|
516 | /* |
|
|
517 | * copy_to first frees everything allocated by the dst object, |
|
|
518 | * and then copies the contents of itself into the second |
|
|
519 | * object, allocating what needs to be allocated. Basically, any |
|
|
520 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
521 | * if the first object is freed, the pointers in the new object |
|
|
522 | * will point at garbage. |
|
|
523 | */ |
|
|
524 | void |
|
|
525 | object::copy_to (object *dst) |
|
|
526 | { |
|
|
527 | *dst = *this; |
|
|
528 | |
|
|
529 | if (speed < 0) |
|
|
530 | dst->speed_left = speed_left - rndm (); |
525 | |
531 | |
526 | dst->set_speed (dst->speed); |
532 | dst->set_speed (dst->speed); |
|
|
533 | } |
|
|
534 | |
|
|
535 | void |
|
|
536 | object::instantiate () |
|
|
537 | { |
|
|
538 | if (!uuid.seq) // HACK |
|
|
539 | uuid = gen_uuid (); |
|
|
540 | |
|
|
541 | speed_left = -0.1f; |
|
|
542 | /* copy the body_info to the body_used - this is only really |
|
|
543 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
544 | * by doing so, when a monster is created, it has good starting |
|
|
545 | * values for the body_used info, so when items are created |
|
|
546 | * for it, they can be properly equipped. |
|
|
547 | */ |
|
|
548 | memcpy (body_used, body_info, sizeof (body_used)); |
|
|
549 | |
|
|
550 | attachable::instantiate (); |
527 | } |
551 | } |
528 | |
552 | |
529 | object * |
553 | object * |
530 | object::clone () |
554 | object::clone () |
531 | { |
555 | { |
… | |
… | |
589 | * UP_OBJ_FACE: only the objects face has changed. |
613 | * UP_OBJ_FACE: only the objects face has changed. |
590 | */ |
614 | */ |
591 | void |
615 | void |
592 | update_object (object *op, int action) |
616 | update_object (object *op, int action) |
593 | { |
617 | { |
594 | MoveType move_on, move_off, move_block, move_slow; |
|
|
595 | |
|
|
596 | if (op == NULL) |
618 | if (op == NULL) |
597 | { |
619 | { |
598 | /* this should never happen */ |
620 | /* this should never happen */ |
599 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
621 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
600 | return; |
622 | return; |
… | |
… | |
819 | |
841 | |
820 | if (flag [FLAG_IS_LINKED]) |
842 | if (flag [FLAG_IS_LINKED]) |
821 | remove_button_link (this); |
843 | remove_button_link (this); |
822 | |
844 | |
823 | if (flag [FLAG_FRIENDLY]) |
845 | if (flag [FLAG_FRIENDLY]) |
824 | { |
|
|
825 | remove_friendly_object (this); |
846 | remove_friendly_object (this); |
826 | |
|
|
827 | if (type == GOLEM |
|
|
828 | && owner |
|
|
829 | && owner->type == PLAYER |
|
|
830 | && owner->contr->ranges[range_golem] == this) |
|
|
831 | owner->contr->ranges[range_golem] = 0; |
|
|
832 | } |
|
|
833 | |
847 | |
834 | if (!flag [FLAG_REMOVED]) |
848 | if (!flag [FLAG_REMOVED]) |
835 | remove (); |
849 | remove (); |
836 | |
850 | |
837 | destroy_inv (true); |
851 | destroy_inv (true); |
… | |
… | |
1094 | return top; |
1108 | return top; |
1095 | } |
1109 | } |
1096 | } |
1110 | } |
1097 | |
1111 | |
1098 | return 0; |
1112 | return 0; |
|
|
1113 | } |
|
|
1114 | |
|
|
1115 | void |
|
|
1116 | object::expand_tail () |
|
|
1117 | { |
|
|
1118 | if (more) |
|
|
1119 | return; |
|
|
1120 | |
|
|
1121 | object *prev = this; |
|
|
1122 | |
|
|
1123 | for (archetype *at = arch->more; at; at = at->more) |
|
|
1124 | { |
|
|
1125 | object *op = arch_to_object (at); |
|
|
1126 | |
|
|
1127 | op->name = name; |
|
|
1128 | op->name_pl = name_pl; |
|
|
1129 | op->title = title; |
|
|
1130 | |
|
|
1131 | op->head = this; |
|
|
1132 | prev->more = op; |
|
|
1133 | |
|
|
1134 | prev = op; |
|
|
1135 | } |
1099 | } |
1136 | } |
1100 | |
1137 | |
1101 | /* |
1138 | /* |
1102 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1139 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1103 | * job preparing multi-part monsters. |
1140 | * job preparing multi-part monsters. |
… | |
… | |
1135 | * just 'op' otherwise |
1172 | * just 'op' otherwise |
1136 | */ |
1173 | */ |
1137 | object * |
1174 | object * |
1138 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1175 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1139 | { |
1176 | { |
|
|
1177 | assert (!op->flag [FLAG_FREED]); |
|
|
1178 | |
1140 | object *tmp, *top, *floor = NULL; |
1179 | object *tmp, *top, *floor = NULL; |
1141 | |
1180 | |
1142 | if (QUERY_FLAG (op, FLAG_FREED)) |
|
|
1143 | { |
|
|
1144 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1145 | return NULL; |
|
|
1146 | } |
|
|
1147 | |
|
|
1148 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1149 | LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ()); |
|
|
1150 | |
|
|
1151 | op->remove (); |
1181 | op->remove (); |
1152 | |
1182 | |
1153 | if (!m) |
1183 | #if 0 |
1154 | { |
1184 | if (!m->active != !op->active) |
1155 | char *dump = dump_object (op); |
1185 | if (m->active) |
1156 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1186 | op->activate_recursive (); |
1157 | free (dump); |
1187 | else |
1158 | return op; |
1188 | op->deactivate_recursive (); |
1159 | } |
1189 | #endif |
1160 | |
1190 | |
1161 | if (out_of_map (m, op->x, op->y)) |
1191 | if (out_of_map (m, op->x, op->y)) |
1162 | { |
1192 | { |
1163 | char *dump = dump_object (op); |
|
|
1164 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1193 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1165 | #ifdef MANY_CORES |
1194 | #ifdef MANY_CORES |
1166 | /* Better to catch this here, as otherwise the next use of this object |
1195 | /* Better to catch this here, as otherwise the next use of this object |
1167 | * is likely to cause a crash. Better to find out where it is getting |
1196 | * is likely to cause a crash. Better to find out where it is getting |
1168 | * improperly inserted. |
1197 | * improperly inserted. |
1169 | */ |
1198 | */ |
1170 | abort (); |
1199 | abort (); |
1171 | #endif |
1200 | #endif |
1172 | free (dump); |
|
|
1173 | return op; |
1201 | return op; |
1174 | } |
1202 | } |
1175 | |
1203 | |
1176 | if (object *more = op->more) |
1204 | if (object *more = op->more) |
1177 | { |
1205 | { |
… | |
… | |
1274 | * looks like instead of lots of conditions here. |
1302 | * looks like instead of lots of conditions here. |
1275 | * makes things faster, and effectively the same result. |
1303 | * makes things faster, and effectively the same result. |
1276 | */ |
1304 | */ |
1277 | |
1305 | |
1278 | /* Have object 'fall below' other objects that block view. |
1306 | /* Have object 'fall below' other objects that block view. |
1279 | * Unless those objects are exits, type 66 |
1307 | * Unless those objects are exits. |
1280 | * If INS_ON_TOP is used, don't do this processing |
1308 | * If INS_ON_TOP is used, don't do this processing |
1281 | * Need to find the object that in fact blocks view, otherwise |
1309 | * Need to find the object that in fact blocks view, otherwise |
1282 | * stacking is a bit odd. |
1310 | * stacking is a bit odd. |
1283 | */ |
1311 | */ |
1284 | if (!(flag & INS_ON_TOP) |
1312 | if (!(flag & INS_ON_TOP) |
1285 | && ms.flags () & P_BLOCKSVIEW |
1313 | && ms.flags () & P_BLOCKSVIEW |
1286 | && (op->face && !op->face->visibility)) |
1314 | && (op->face && !faces [op->face].visibility)) |
1287 | { |
1315 | { |
1288 | for (last = top; last != floor; last = last->below) |
1316 | for (last = top; last != floor; last = last->below) |
1289 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1317 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1290 | break; |
1318 | break; |
1291 | |
1319 | |
… | |
… | |
1417 | } |
1445 | } |
1418 | |
1446 | |
1419 | object * |
1447 | object * |
1420 | object::insert_at (object *where, object *originator, int flags) |
1448 | object::insert_at (object *where, object *originator, int flags) |
1421 | { |
1449 | { |
1422 | where->map->insert (this, where->x, where->y, originator, flags); |
1450 | return where->map->insert (this, where->x, where->y, originator, flags); |
1423 | } |
1451 | } |
1424 | |
1452 | |
1425 | /* |
1453 | /* |
1426 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1454 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1427 | * is returned contains nr objects, and the remaining parts contains |
1455 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1467 | * the amount of an object. If the amount reaches 0, the object |
1495 | * the amount of an object. If the amount reaches 0, the object |
1468 | * is subsequently removed and freed. |
1496 | * is subsequently removed and freed. |
1469 | * |
1497 | * |
1470 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1498 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1471 | */ |
1499 | */ |
1472 | |
|
|
1473 | object * |
1500 | object * |
1474 | decrease_ob_nr (object *op, uint32 i) |
1501 | decrease_ob_nr (object *op, uint32 i) |
1475 | { |
1502 | { |
1476 | object *tmp; |
1503 | object *tmp; |
1477 | |
1504 | |
… | |
… | |
1552 | |
1579 | |
1553 | /* |
1580 | /* |
1554 | * add_weight(object, weight) adds the specified weight to an object, |
1581 | * add_weight(object, weight) adds the specified weight to an object, |
1555 | * and also updates how much the environment(s) is/are carrying. |
1582 | * and also updates how much the environment(s) is/are carrying. |
1556 | */ |
1583 | */ |
1557 | |
|
|
1558 | void |
1584 | void |
1559 | add_weight (object *op, signed long weight) |
1585 | add_weight (object *op, signed long weight) |
1560 | { |
1586 | { |
1561 | while (op != NULL) |
1587 | while (op != NULL) |
1562 | { |
1588 | { |
… | |
… | |
1594 | * inside the object environment. |
1620 | * inside the object environment. |
1595 | * |
1621 | * |
1596 | * The function returns now pointer to inserted item, and return value can |
1622 | * The function returns now pointer to inserted item, and return value can |
1597 | * be != op, if items are merged. -Tero |
1623 | * be != op, if items are merged. -Tero |
1598 | */ |
1624 | */ |
1599 | |
|
|
1600 | object * |
1625 | object * |
1601 | object::insert (object *op) |
1626 | object::insert (object *op) |
1602 | { |
1627 | { |
1603 | object *tmp, *otmp; |
1628 | object *tmp, *otmp; |
1604 | |
1629 | |
… | |
… | |
2334 | insert_ob_in_ob (object_create_clone (item), dst); |
2359 | insert_ob_in_ob (object_create_clone (item), dst); |
2335 | |
2360 | |
2336 | return dst; |
2361 | return dst; |
2337 | } |
2362 | } |
2338 | |
2363 | |
2339 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2340 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2341 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2342 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2343 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2344 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2345 | object * |
|
|
2346 | load_object_str (const char *obstr) |
|
|
2347 | { |
|
|
2348 | object *op; |
|
|
2349 | char filename[MAX_BUF]; |
|
|
2350 | |
|
|
2351 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2352 | |
|
|
2353 | FILE *tempfile = fopen (filename, "w"); |
|
|
2354 | |
|
|
2355 | if (tempfile == NULL) |
|
|
2356 | { |
|
|
2357 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2358 | return NULL; |
|
|
2359 | } |
|
|
2360 | |
|
|
2361 | fprintf (tempfile, obstr); |
|
|
2362 | fclose (tempfile); |
|
|
2363 | |
|
|
2364 | op = object::create (); |
|
|
2365 | |
|
|
2366 | object_thawer thawer (filename); |
|
|
2367 | |
|
|
2368 | if (thawer) |
|
|
2369 | load_object (thawer, op, 0); |
|
|
2370 | |
|
|
2371 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2372 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2373 | |
|
|
2374 | return op; |
|
|
2375 | } |
|
|
2376 | |
|
|
2377 | /* This returns the first object in who's inventory that |
2364 | /* This returns the first object in who's inventory that |
2378 | * has the same type and subtype match. |
2365 | * has the same type and subtype match. |
2379 | * returns NULL if no match. |
2366 | * returns NULL if no match. |
2380 | */ |
2367 | */ |
2381 | object * |
2368 | object * |
… | |
… | |
2434 | if (link->key == canonical_key) |
2421 | if (link->key == canonical_key) |
2435 | return link->value; |
2422 | return link->value; |
2436 | |
2423 | |
2437 | return 0; |
2424 | return 0; |
2438 | } |
2425 | } |
2439 | |
|
|
2440 | |
2426 | |
2441 | /* |
2427 | /* |
2442 | * Updates the canonical_key in op to value. |
2428 | * Updates the canonical_key in op to value. |
2443 | * |
2429 | * |
2444 | * canonical_key is a shared string (value doesn't have to be). |
2430 | * canonical_key is a shared string (value doesn't have to be). |