… | |
… | |
357 | /* |
357 | /* |
358 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
358 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
359 | * Some error messages. |
359 | * Some error messages. |
360 | * The result of the dump is stored in the static global errmsg array. |
360 | * The result of the dump is stored in the static global errmsg array. |
361 | */ |
361 | */ |
362 | |
|
|
363 | char * |
362 | char * |
364 | dump_object (object *op) |
363 | dump_object (object *op) |
365 | { |
364 | { |
366 | if (!op) |
365 | if (!op) |
367 | return strdup ("[NULLOBJ]"); |
366 | return strdup ("[NULLOBJ]"); |
368 | |
367 | |
369 | object_freezer freezer; |
368 | object_freezer freezer; |
370 | save_object (freezer, op, 1); |
369 | op->write (freezer); |
371 | return freezer.as_string (); |
370 | return freezer.as_string (); |
372 | } |
371 | } |
373 | |
372 | |
374 | /* |
373 | /* |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
374 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
455 | * refcounts and freeing the links. |
454 | * refcounts and freeing the links. |
456 | */ |
455 | */ |
457 | static void |
456 | static void |
458 | free_key_values (object *op) |
457 | free_key_values (object *op) |
459 | { |
458 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
459 | for (key_value *i = op->key_values; i; ) |
461 | { |
460 | { |
462 | key_value *next = i->next; |
461 | key_value *next = i->next; |
463 | delete i; |
462 | delete i; |
464 | |
463 | |
465 | i = next; |
464 | i = next; |
466 | } |
465 | } |
467 | |
466 | |
468 | op->key_values = 0; |
467 | op->key_values = 0; |
469 | } |
468 | } |
470 | |
469 | |
471 | /* |
470 | object & |
472 | * copy_to first frees everything allocated by the dst object, |
471 | 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 | { |
472 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
473 | bool is_freed = flag [FLAG_FREED]; |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
474 | bool is_removed = flag [FLAG_REMOVED]; |
484 | |
475 | |
485 | *(object_copy *)dst = *this; |
476 | *(object_copy *)this = src; |
486 | |
477 | |
487 | if (is_freed) |
478 | flag [FLAG_FREED] = is_freed; |
488 | SET_FLAG (dst, FLAG_FREED); |
479 | 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 | |
480 | |
496 | /* Copy over key_values, if any. */ |
481 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
482 | if (src.key_values) |
498 | { |
483 | { |
499 | key_value *tail = 0; |
484 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
485 | key_values = 0; |
503 | |
486 | |
504 | for (i = key_values; i; i = i->next) |
487 | for (key_value *i = src.key_values; i; i = i->next) |
505 | { |
488 | { |
506 | key_value *new_link = new key_value; |
489 | key_value *new_link = new key_value; |
507 | |
490 | |
508 | new_link->next = 0; |
491 | new_link->next = 0; |
509 | new_link->key = i->key; |
492 | new_link->key = i->key; |
510 | new_link->value = i->value; |
493 | new_link->value = i->value; |
511 | |
494 | |
512 | /* Try and be clever here, too. */ |
495 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
496 | if (!key_values) |
514 | { |
497 | { |
515 | dst->key_values = new_link; |
498 | key_values = new_link; |
516 | tail = new_link; |
499 | tail = new_link; |
517 | } |
500 | } |
518 | else |
501 | else |
519 | { |
502 | { |
520 | tail->next = new_link; |
503 | tail->next = new_link; |
521 | tail = new_link; |
504 | tail = new_link; |
522 | } |
505 | } |
523 | } |
506 | } |
524 | } |
507 | } |
|
|
508 | } |
|
|
509 | |
|
|
510 | /* |
|
|
511 | * copy_to first frees everything allocated by the dst object, |
|
|
512 | * and then copies the contents of itself into the second |
|
|
513 | * object, allocating what needs to be allocated. Basically, any |
|
|
514 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
515 | * if the first object is freed, the pointers in the new object |
|
|
516 | * will point at garbage. |
|
|
517 | */ |
|
|
518 | void |
|
|
519 | object::copy_to (object *dst) |
|
|
520 | { |
|
|
521 | *dst = *this; |
|
|
522 | |
|
|
523 | if (speed < 0) |
|
|
524 | dst->speed_left = speed_left - rndm (); |
525 | |
525 | |
526 | dst->set_speed (dst->speed); |
526 | dst->set_speed (dst->speed); |
|
|
527 | } |
|
|
528 | |
|
|
529 | void |
|
|
530 | object::instantiate () |
|
|
531 | { |
|
|
532 | if (!uuid.seq) // HACK |
|
|
533 | uuid = gen_uuid (); |
|
|
534 | |
|
|
535 | speed_left = -0.1f; |
|
|
536 | /* copy the body_info to the body_used - this is only really |
|
|
537 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
538 | * by doing so, when a monster is created, it has good starting |
|
|
539 | * values for the body_used info, so when items are created |
|
|
540 | * for it, they can be properly equipped. |
|
|
541 | */ |
|
|
542 | memcpy (body_used, body_info, sizeof (body_used)); |
|
|
543 | |
|
|
544 | attachable::instantiate (); |
527 | } |
545 | } |
528 | |
546 | |
529 | object * |
547 | object * |
530 | object::clone () |
548 | object::clone () |
531 | { |
549 | { |
… | |
… | |
589 | * UP_OBJ_FACE: only the objects face has changed. |
607 | * UP_OBJ_FACE: only the objects face has changed. |
590 | */ |
608 | */ |
591 | void |
609 | void |
592 | update_object (object *op, int action) |
610 | update_object (object *op, int action) |
593 | { |
611 | { |
594 | MoveType move_on, move_off, move_block, move_slow; |
|
|
595 | |
|
|
596 | if (op == NULL) |
612 | if (op == NULL) |
597 | { |
613 | { |
598 | /* this should never happen */ |
614 | /* this should never happen */ |
599 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
615 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
600 | return; |
616 | return; |
… | |
… | |
1094 | return top; |
1110 | return top; |
1095 | } |
1111 | } |
1096 | } |
1112 | } |
1097 | |
1113 | |
1098 | return 0; |
1114 | return 0; |
|
|
1115 | } |
|
|
1116 | |
|
|
1117 | void |
|
|
1118 | object::expand_tail () |
|
|
1119 | { |
|
|
1120 | if (more) |
|
|
1121 | return; |
|
|
1122 | |
|
|
1123 | object *prev = this; |
|
|
1124 | |
|
|
1125 | for (archetype *at = arch->more; at; at = at->more) |
|
|
1126 | { |
|
|
1127 | object *op = arch_to_object (at); |
|
|
1128 | |
|
|
1129 | op->name = name; |
|
|
1130 | op->name_pl = name_pl; |
|
|
1131 | op->title = title; |
|
|
1132 | |
|
|
1133 | op->head = this; |
|
|
1134 | prev->more = op; |
|
|
1135 | |
|
|
1136 | prev = op; |
|
|
1137 | } |
1099 | } |
1138 | } |
1100 | |
1139 | |
1101 | /* |
1140 | /* |
1102 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1141 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1103 | * job preparing multi-part monsters. |
1142 | * job preparing multi-part monsters. |
… | |
… | |
1135 | * just 'op' otherwise |
1174 | * just 'op' otherwise |
1136 | */ |
1175 | */ |
1137 | object * |
1176 | object * |
1138 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1177 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1139 | { |
1178 | { |
|
|
1179 | assert (!op->flag [FLAG_FREED]); |
|
|
1180 | |
1140 | object *tmp, *top, *floor = NULL; |
1181 | object *tmp, *top, *floor = NULL; |
1141 | |
1182 | |
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 (); |
1183 | op->remove (); |
1152 | |
1184 | |
1153 | if (!m) |
1185 | #if 0 |
1154 | { |
1186 | if (!m->active != !op->active) |
1155 | char *dump = dump_object (op); |
1187 | if (m->active) |
1156 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1188 | op->activate_recursive (); |
1157 | free (dump); |
1189 | else |
1158 | return op; |
1190 | op->deactivate_recursive (); |
1159 | } |
1191 | #endif |
1160 | |
1192 | |
1161 | if (out_of_map (m, op->x, op->y)) |
1193 | if (out_of_map (m, op->x, op->y)) |
1162 | { |
1194 | { |
1163 | char *dump = dump_object (op); |
|
|
1164 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1195 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1165 | #ifdef MANY_CORES |
1196 | #ifdef MANY_CORES |
1166 | /* Better to catch this here, as otherwise the next use of this object |
1197 | /* 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 |
1198 | * is likely to cause a crash. Better to find out where it is getting |
1168 | * improperly inserted. |
1199 | * improperly inserted. |
1169 | */ |
1200 | */ |
1170 | abort (); |
1201 | abort (); |
1171 | #endif |
1202 | #endif |
1172 | free (dump); |
|
|
1173 | return op; |
1203 | return op; |
1174 | } |
1204 | } |
1175 | |
1205 | |
1176 | if (object *more = op->more) |
1206 | if (object *more = op->more) |
1177 | { |
1207 | { |
… | |
… | |
1274 | * looks like instead of lots of conditions here. |
1304 | * looks like instead of lots of conditions here. |
1275 | * makes things faster, and effectively the same result. |
1305 | * makes things faster, and effectively the same result. |
1276 | */ |
1306 | */ |
1277 | |
1307 | |
1278 | /* Have object 'fall below' other objects that block view. |
1308 | /* Have object 'fall below' other objects that block view. |
1279 | * Unless those objects are exits, type 66 |
1309 | * Unless those objects are exits. |
1280 | * If INS_ON_TOP is used, don't do this processing |
1310 | * If INS_ON_TOP is used, don't do this processing |
1281 | * Need to find the object that in fact blocks view, otherwise |
1311 | * Need to find the object that in fact blocks view, otherwise |
1282 | * stacking is a bit odd. |
1312 | * stacking is a bit odd. |
1283 | */ |
1313 | */ |
1284 | if (!(flag & INS_ON_TOP) |
1314 | if (!(flag & INS_ON_TOP) |
1285 | && ms.flags () & P_BLOCKSVIEW |
1315 | && ms.flags () & P_BLOCKSVIEW |
1286 | && (op->face && !op->face->visibility)) |
1316 | && (op->face && !faces [op->face].visibility)) |
1287 | { |
1317 | { |
1288 | for (last = top; last != floor; last = last->below) |
1318 | for (last = top; last != floor; last = last->below) |
1289 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1319 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1290 | break; |
1320 | break; |
1291 | |
1321 | |
… | |
… | |
1417 | } |
1447 | } |
1418 | |
1448 | |
1419 | object * |
1449 | object * |
1420 | object::insert_at (object *where, object *originator, int flags) |
1450 | object::insert_at (object *where, object *originator, int flags) |
1421 | { |
1451 | { |
1422 | where->map->insert (this, where->x, where->y, originator, flags); |
1452 | return where->map->insert (this, where->x, where->y, originator, flags); |
1423 | } |
1453 | } |
1424 | |
1454 | |
1425 | /* |
1455 | /* |
1426 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1456 | * 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 |
1457 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1467 | * the amount of an object. If the amount reaches 0, the object |
1497 | * the amount of an object. If the amount reaches 0, the object |
1468 | * is subsequently removed and freed. |
1498 | * is subsequently removed and freed. |
1469 | * |
1499 | * |
1470 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1500 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1471 | */ |
1501 | */ |
1472 | |
|
|
1473 | object * |
1502 | object * |
1474 | decrease_ob_nr (object *op, uint32 i) |
1503 | decrease_ob_nr (object *op, uint32 i) |
1475 | { |
1504 | { |
1476 | object *tmp; |
1505 | object *tmp; |
1477 | |
1506 | |
… | |
… | |
1552 | |
1581 | |
1553 | /* |
1582 | /* |
1554 | * add_weight(object, weight) adds the specified weight to an object, |
1583 | * add_weight(object, weight) adds the specified weight to an object, |
1555 | * and also updates how much the environment(s) is/are carrying. |
1584 | * and also updates how much the environment(s) is/are carrying. |
1556 | */ |
1585 | */ |
1557 | |
|
|
1558 | void |
1586 | void |
1559 | add_weight (object *op, signed long weight) |
1587 | add_weight (object *op, signed long weight) |
1560 | { |
1588 | { |
1561 | while (op != NULL) |
1589 | while (op != NULL) |
1562 | { |
1590 | { |
… | |
… | |
1594 | * inside the object environment. |
1622 | * inside the object environment. |
1595 | * |
1623 | * |
1596 | * The function returns now pointer to inserted item, and return value can |
1624 | * The function returns now pointer to inserted item, and return value can |
1597 | * be != op, if items are merged. -Tero |
1625 | * be != op, if items are merged. -Tero |
1598 | */ |
1626 | */ |
1599 | |
|
|
1600 | object * |
1627 | object * |
1601 | object::insert (object *op) |
1628 | object::insert (object *op) |
1602 | { |
1629 | { |
1603 | object *tmp, *otmp; |
1630 | object *tmp, *otmp; |
1604 | |
1631 | |
… | |
… | |
2334 | insert_ob_in_ob (object_create_clone (item), dst); |
2361 | insert_ob_in_ob (object_create_clone (item), dst); |
2335 | |
2362 | |
2336 | return dst; |
2363 | return dst; |
2337 | } |
2364 | } |
2338 | |
2365 | |
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 |
2366 | /* This returns the first object in who's inventory that |
2378 | * has the same type and subtype match. |
2367 | * has the same type and subtype match. |
2379 | * returns NULL if no match. |
2368 | * returns NULL if no match. |
2380 | */ |
2369 | */ |
2381 | object * |
2370 | object * |
… | |
… | |
2434 | if (link->key == canonical_key) |
2423 | if (link->key == canonical_key) |
2435 | return link->value; |
2424 | return link->value; |
2436 | |
2425 | |
2437 | return 0; |
2426 | return 0; |
2438 | } |
2427 | } |
2439 | |
|
|
2440 | |
2428 | |
2441 | /* |
2429 | /* |
2442 | * Updates the canonical_key in op to value. |
2430 | * Updates the canonical_key in op to value. |
2443 | * |
2431 | * |
2444 | * canonical_key is a shared string (value doesn't have to be). |
2432 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2674 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2662 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2675 | new_container->insert (closer); |
2663 | new_container->insert (closer); |
2676 | } |
2664 | } |
2677 | #endif |
2665 | #endif |
2678 | |
2666 | |
|
|
2667 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2668 | |
2679 | new_container->flag [FLAG_APPLIED] = 1; |
2669 | new_container->flag [FLAG_APPLIED] = 1; |
2680 | container = new_container; |
2670 | container = new_container; |
2681 | |
2671 | |
2682 | esrv_update_item (UPD_FLAGS, this, new_container); |
2672 | esrv_update_item (UPD_FLAGS, this, new_container); |
2683 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2673 | esrv_send_inventory (this, new_container); |
2684 | } |
2674 | } |
2685 | |
|
|
2686 | if (contr && contr->ns) |
|
|
2687 | contr->ns->floorbox_update (); |
|
|
2688 | } |
2675 | } |
2689 | |
2676 | |
2690 | |
2677 | |