ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/object.C
(Generate patch)

Comparing deliantra/server/common/object.C (file contents):
Revision 1.122 by root, Wed Jan 24 22:42:48 2007 UTC vs.
Revision 1.137 by root, Mon Apr 16 06:23:40 2007 UTC

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
363char * 362char *
364dump_object (object *op) 363dump_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 */
457static void 456static void
458free_key_values (object *op) 457free_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/* 470object &
472 * copy_to first frees everything allocated by the dst object, 471object::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 */
479void
480object::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 */
518void
519object::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
529void
530object::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
529object * 547object *
530object::clone () 548object::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 */
591void 609void
592update_object (object *op, int action) 610update_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;
819 835
820 if (flag [FLAG_IS_LINKED]) 836 if (flag [FLAG_IS_LINKED])
821 remove_button_link (this); 837 remove_button_link (this);
822 838
823 if (flag [FLAG_FRIENDLY]) 839 if (flag [FLAG_FRIENDLY])
840 {
824 remove_friendly_object (this); 841 remove_friendly_object (this);
842
843 if (type == GOLEM
844 && owner
845 && owner->type == PLAYER
846 && owner->contr->ranges[range_golem] == this)
847 owner->contr->ranges[range_golem] = 0;
848 }
825 849
826 if (!flag [FLAG_REMOVED]) 850 if (!flag [FLAG_REMOVED])
827 remove (); 851 remove ();
828 852
829 destroy_inv (true); 853 destroy_inv (true);
901 * This function removes the object op from the linked list of objects 925 * This function removes the object op from the linked list of objects
902 * which it is currently tied to. When this function is done, the 926 * which it is currently tied to. When this function is done, the
903 * object will have no environment. If the object previously had an 927 * object will have no environment. If the object previously had an
904 * environment, the x and y coordinates will be updated to 928 * environment, the x and y coordinates will be updated to
905 * the previous environment. 929 * the previous environment.
906 * Beware: This function is called from the editor as well!
907 */ 930 */
908void 931void
909object::remove_slow () 932object::do_remove ()
910{ 933{
911 object *tmp, *last = 0; 934 object *tmp, *last = 0;
912 object *otmp; 935 object *otmp;
913 936
914 if (QUERY_FLAG (this, FLAG_REMOVED)) 937 if (QUERY_FLAG (this, FLAG_REMOVED))
957 } 980 }
958 else if (map) 981 else if (map)
959 { 982 {
960 if (type == PLAYER) 983 if (type == PLAYER)
961 { 984 {
985 // leaving a spot always closes any open container on the ground
986 if (container && !container->env)
987 // this causes spurious floorbox updates, but it ensures
988 // that the CLOSE event is being sent.
989 close_container ();
990
962 --map->players; 991 --map->players;
963 map->touch (); 992 map->touch ();
964 } 993 }
965 994
966 map->dirty = true; 995 map->dirty = true;
1261 * looks like instead of lots of conditions here. 1290 * looks like instead of lots of conditions here.
1262 * makes things faster, and effectively the same result. 1291 * makes things faster, and effectively the same result.
1263 */ 1292 */
1264 1293
1265 /* Have object 'fall below' other objects that block view. 1294 /* Have object 'fall below' other objects that block view.
1266 * Unless those objects are exits, type 66 1295 * Unless those objects are exits.
1267 * If INS_ON_TOP is used, don't do this processing 1296 * If INS_ON_TOP is used, don't do this processing
1268 * Need to find the object that in fact blocks view, otherwise 1297 * Need to find the object that in fact blocks view, otherwise
1269 * stacking is a bit odd. 1298 * stacking is a bit odd.
1270 */ 1299 */
1271 if (!(flag & INS_ON_TOP) 1300 if (!(flag & INS_ON_TOP)
1272 && ms.flags () & P_BLOCKSVIEW 1301 && ms.flags () & P_BLOCKSVIEW
1273 && (op->face && !op->face->visibility)) 1302 && (op->face && !faces [op->face].visibility))
1274 { 1303 {
1275 for (last = top; last != floor; last = last->below) 1304 for (last = top; last != floor; last = last->below)
1276 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1305 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1277 break; 1306 break;
1278 1307
1401 tmp1->x = op->x; 1430 tmp1->x = op->x;
1402 tmp1->y = op->y; 1431 tmp1->y = op->y;
1403 insert_ob_in_map (tmp1, op->map, op, 0); 1432 insert_ob_in_map (tmp1, op->map, op, 0);
1404} 1433}
1405 1434
1435// XXX: function not returning object*
1406object * 1436object *
1407object::insert_at (object *where, object *originator, int flags) 1437object::insert_at (object *where, object *originator, int flags)
1408{ 1438{
1409 where->map->insert (this, where->x, where->y, originator, flags); 1439 where->map->insert (this, where->x, where->y, originator, flags);
1410} 1440}
1968 } 1998 }
1969 1999
1970 if (!index) 2000 if (!index)
1971 return -1; 2001 return -1;
1972 2002
1973 return altern[RANDOM () % index]; 2003 return altern [rndm (index)];
1974} 2004}
1975 2005
1976/* 2006/*
1977 * find_first_free_spot(archetype, maptile, x, y) works like 2007 * find_first_free_spot(archetype, maptile, x, y) works like
1978 * find_free_spot(), but it will search max number of squares. 2008 * find_free_spot(), but it will search max number of squares.
1999{ 2029{
2000 arr += begin; 2030 arr += begin;
2001 end -= begin; 2031 end -= begin;
2002 2032
2003 while (--end) 2033 while (--end)
2004 swap (arr [end], arr [RANDOM () % (end + 1)]); 2034 swap (arr [end], arr [rndm (end + 1)]);
2005} 2035}
2006 2036
2007/* new function to make monster searching more efficient, and effective! 2037/* new function to make monster searching more efficient, and effective!
2008 * This basically returns a randomized array (in the passed pointer) of 2038 * This basically returns a randomized array (in the passed pointer) of
2009 * the spaces to find monsters. In this way, it won't always look for 2039 * the spaces to find monsters. In this way, it won't always look for
2321 insert_ob_in_ob (object_create_clone (item), dst); 2351 insert_ob_in_ob (object_create_clone (item), dst);
2322 2352
2323 return dst; 2353 return dst;
2324} 2354}
2325 2355
2326/* GROS - Creates an object using a string representing its content. */
2327/* Basically, we save the content of the string to a temp file, then call */
2328/* load_object on it. I admit it is a highly inefficient way to make things, */
2329/* but it was simple to make and allows reusing the load_object function. */
2330/* Remember not to use load_object_str in a time-critical situation. */
2331/* Also remember that multiparts objects are not supported for now. */
2332object *
2333load_object_str (const char *obstr)
2334{
2335 object *op;
2336 char filename[MAX_BUF];
2337
2338 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2339
2340 FILE *tempfile = fopen (filename, "w");
2341
2342 if (tempfile == NULL)
2343 {
2344 LOG (llevError, "Error - Unable to access load object temp file\n");
2345 return NULL;
2346 }
2347
2348 fprintf (tempfile, obstr);
2349 fclose (tempfile);
2350
2351 op = object::create ();
2352
2353 object_thawer thawer (filename);
2354
2355 if (thawer)
2356 load_object (thawer, op, 0);
2357
2358 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2359 CLEAR_FLAG (op, FLAG_REMOVED);
2360
2361 return op;
2362}
2363
2364/* This returns the first object in who's inventory that 2356/* This returns the first object in who's inventory that
2365 * has the same type and subtype match. 2357 * has the same type and subtype match.
2366 * returns NULL if no match. 2358 * returns NULL if no match.
2367 */ 2359 */
2368object * 2360object *
2421 if (link->key == canonical_key) 2413 if (link->key == canonical_key)
2422 return link->value; 2414 return link->value;
2423 2415
2424 return 0; 2416 return 0;
2425} 2417}
2426
2427 2418
2428/* 2419/*
2429 * Updates the canonical_key in op to value. 2420 * Updates the canonical_key in op to value.
2430 * 2421 *
2431 * 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).
2571{ 2562{
2572 char flagdesc[512]; 2563 char flagdesc[512];
2573 char info2[256 * 4]; 2564 char info2[256 * 4];
2574 char *p = info; 2565 char *p = info;
2575 2566
2576 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", 2567 p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2577 count, uuid.seq, 2568 count, uuid.seq,
2578 &name, 2569 &name,
2579 title ? "\",title:\"" : "", 2570 title ? "\",title:\"" : "",
2580 title ? (const char *)title : "", 2571 title ? (const char *)title : "",
2581 flag_desc (flagdesc, 512), type); 2572 flag_desc (flagdesc, 512), type);
2601{ 2592{
2602 static char info[256 * 4]; 2593 static char info[256 * 4];
2603 return debug_desc (info); 2594 return debug_desc (info);
2604} 2595}
2605 2596
2597struct region *
2598object::region () const
2599{
2600 return map ? map->region (x, y)
2601 : region::default_region ();
2602}
2603
2604const materialtype_t *
2605object::dominant_material () const
2606{
2607 if (materialtype_t *mat = name_to_material (materialname))
2608 return mat;
2609
2610 // omfg this is slow, this has to be temporary :)
2611 shstr unknown ("unknown");
2612
2613 return name_to_material (unknown);
2614}
2615
2616void
2617object::open_container (object *new_container)
2618{
2619 if (container == new_container)
2620 return;
2621
2622 if (object *old_container = container)
2623 {
2624 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2625 return;
2626
2627#if 0
2628 // remove the "Close old_container" object.
2629 if (object *closer = old_container->inv)
2630 if (closer->type == CLOSE_CON)
2631 closer->destroy ();
2632#endif
2633
2634 old_container->flag [FLAG_APPLIED] = 0;
2635 container = 0;
2636
2637 esrv_update_item (UPD_FLAGS, this, old_container);
2638 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2639 }
2640
2641 if (new_container)
2642 {
2643 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2644 return;
2645
2646 // TODO: this does not seem to serve any purpose anymore?
2647#if 0
2648 // insert the "Close Container" object.
2649 if (archetype *closer = new_container->other_arch)
2650 {
2651 object *closer = arch_to_object (new_container->other_arch);
2652 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2653 new_container->insert (closer);
2654 }
2655#endif
2656
2657 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2658
2659 new_container->flag [FLAG_APPLIED] = 1;
2660 container = new_container;
2661
2662 esrv_update_item (UPD_FLAGS, this, new_container);
2663 esrv_send_inventory (this, new_container);
2664 }
2665}
2666
2667

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines