… | |
… | |
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; |
… | |
… | |
1274 | * looks like instead of lots of conditions here. |
1290 | * looks like instead of lots of conditions here. |
1275 | * makes things faster, and effectively the same result. |
1291 | * makes things faster, and effectively the same result. |
1276 | */ |
1292 | */ |
1277 | |
1293 | |
1278 | /* Have object 'fall below' other objects that block view. |
1294 | /* Have object 'fall below' other objects that block view. |
1279 | * Unless those objects are exits, type 66 |
1295 | * Unless those objects are exits. |
1280 | * If INS_ON_TOP is used, don't do this processing |
1296 | * If INS_ON_TOP is used, don't do this processing |
1281 | * Need to find the object that in fact blocks view, otherwise |
1297 | * Need to find the object that in fact blocks view, otherwise |
1282 | * stacking is a bit odd. |
1298 | * stacking is a bit odd. |
1283 | */ |
1299 | */ |
1284 | if (!(flag & INS_ON_TOP) |
1300 | if (!(flag & INS_ON_TOP) |
1285 | && ms.flags () & P_BLOCKSVIEW |
1301 | && ms.flags () & P_BLOCKSVIEW |
1286 | && (op->face && !op->face->visibility)) |
1302 | && (op->face && !faces [op->face].visibility)) |
1287 | { |
1303 | { |
1288 | for (last = top; last != floor; last = last->below) |
1304 | for (last = top; last != floor; last = last->below) |
1289 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1305 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1290 | break; |
1306 | break; |
1291 | |
1307 | |
… | |
… | |
1414 | tmp1->x = op->x; |
1430 | tmp1->x = op->x; |
1415 | tmp1->y = op->y; |
1431 | tmp1->y = op->y; |
1416 | insert_ob_in_map (tmp1, op->map, op, 0); |
1432 | insert_ob_in_map (tmp1, op->map, op, 0); |
1417 | } |
1433 | } |
1418 | |
1434 | |
|
|
1435 | // XXX: function not returning object* |
1419 | object * |
1436 | object * |
1420 | object::insert_at (object *where, object *originator, int flags) |
1437 | object::insert_at (object *where, object *originator, int flags) |
1421 | { |
1438 | { |
1422 | where->map->insert (this, where->x, where->y, originator, flags); |
1439 | where->map->insert (this, where->x, where->y, originator, flags); |
1423 | } |
1440 | } |
… | |
… | |
2334 | insert_ob_in_ob (object_create_clone (item), dst); |
2351 | insert_ob_in_ob (object_create_clone (item), dst); |
2335 | |
2352 | |
2336 | return dst; |
2353 | return dst; |
2337 | } |
2354 | } |
2338 | |
2355 | |
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 |
2356 | /* This returns the first object in who's inventory that |
2378 | * has the same type and subtype match. |
2357 | * has the same type and subtype match. |
2379 | * returns NULL if no match. |
2358 | * returns NULL if no match. |
2380 | */ |
2359 | */ |
2381 | object * |
2360 | object * |
… | |
… | |
2434 | if (link->key == canonical_key) |
2413 | if (link->key == canonical_key) |
2435 | return link->value; |
2414 | return link->value; |
2436 | |
2415 | |
2437 | return 0; |
2416 | return 0; |
2438 | } |
2417 | } |
2439 | |
|
|
2440 | |
2418 | |
2441 | /* |
2419 | /* |
2442 | * Updates the canonical_key in op to value. |
2420 | * Updates the canonical_key in op to value. |
2443 | * |
2421 | * |
2444 | * canonical_key is a shared string (value doesn't have to be). |
2422 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2639 | object::open_container (object *new_container) |
2617 | object::open_container (object *new_container) |
2640 | { |
2618 | { |
2641 | if (container == new_container) |
2619 | if (container == new_container) |
2642 | return; |
2620 | return; |
2643 | |
2621 | |
2644 | if (contr && contr->ns) |
|
|
2645 | contr->ns->floorbox_reset (); |
|
|
2646 | |
|
|
2647 | if (object *old_container = container) |
2622 | if (object *old_container = container) |
2648 | { |
2623 | { |
2649 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2624 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2650 | return; |
2625 | return; |
2651 | |
2626 | |
… | |
… | |
2677 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2652 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2678 | new_container->insert (closer); |
2653 | new_container->insert (closer); |
2679 | } |
2654 | } |
2680 | #endif |
2655 | #endif |
2681 | |
2656 | |
|
|
2657 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2658 | |
2682 | new_container->flag [FLAG_APPLIED] = 1; |
2659 | new_container->flag [FLAG_APPLIED] = 1; |
2683 | container = new_container; |
2660 | container = new_container; |
2684 | |
2661 | |
2685 | esrv_update_item (UPD_FLAGS, this, new_container); |
2662 | esrv_update_item (UPD_FLAGS, this, new_container); |
2686 | esrv_send_inventory (this, new_container); |
2663 | esrv_send_inventory (this, new_container); |
2687 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2688 | } |
2664 | } |
2689 | } |
2665 | } |
2690 | |
2666 | |
2691 | |
2667 | |