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.123 by root, Fri Jan 26 20:59:56 2007 UTC vs.
Revision 1.138 by root, Sat Apr 21 16:56:29 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);
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 */ 930 */
907void 931void
908object::remove_slow () 932object::do_remove ()
909{ 933{
910 object *tmp, *last = 0; 934 object *tmp, *last = 0;
911 object *otmp; 935 object *otmp;
912 936
913 if (QUERY_FLAG (this, FLAG_REMOVED)) 937 if (QUERY_FLAG (this, FLAG_REMOVED))
956 } 980 }
957 else if (map) 981 else if (map)
958 { 982 {
959 if (type == PLAYER) 983 if (type == PLAYER)
960 { 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
961 --map->players; 991 --map->players;
962 map->touch (); 992 map->touch ();
963 } 993 }
964 994
965 map->dirty = true; 995 map->dirty = true;
1080 return top; 1110 return top;
1081 } 1111 }
1082 } 1112 }
1083 1113
1084 return 0; 1114 return 0;
1115}
1116
1117void
1118object::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 }
1085} 1138}
1086 1139
1087/* 1140/*
1088 * 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
1089 * job preparing multi-part monsters. 1142 * job preparing multi-part monsters.
1121 * just 'op' otherwise 1174 * just 'op' otherwise
1122 */ 1175 */
1123object * 1176object *
1124insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1177insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1125{ 1178{
1179 assert (!op->flag [FLAG_FREED]);
1180
1126 object *tmp, *top, *floor = NULL; 1181 object *tmp, *top, *floor = NULL;
1127 1182
1128 if (QUERY_FLAG (op, FLAG_FREED))
1129 {
1130 LOG (llevError, "Trying to insert freed object!\n");
1131 return NULL;
1132 }
1133
1134 if (!QUERY_FLAG (op, FLAG_REMOVED))
1135 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1136
1137 op->remove (); 1183 op->remove ();
1138 1184
1139 if (!m) 1185 if (!m->active != !op->active)
1140 { 1186 if (m->active)
1141 char *dump = dump_object (op); 1187 op->activate_recursive ();
1142 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1188 else
1143 free (dump); 1189 op->deactivate_recursive ();
1144 return op;
1145 }
1146 1190
1147 if (out_of_map (m, op->x, op->y)) 1191 if (out_of_map (m, op->x, op->y))
1148 { 1192 {
1149 char *dump = dump_object (op);
1150 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 ());
1151#ifdef MANY_CORES 1194#ifdef MANY_CORES
1152 /* 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
1153 * 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
1154 * improperly inserted. 1197 * improperly inserted.
1155 */ 1198 */
1156 abort (); 1199 abort ();
1157#endif 1200#endif
1158 free (dump);
1159 return op; 1201 return op;
1160 } 1202 }
1161 1203
1162 if (object *more = op->more) 1204 if (object *more = op->more)
1163 { 1205 {
1260 * looks like instead of lots of conditions here. 1302 * looks like instead of lots of conditions here.
1261 * makes things faster, and effectively the same result. 1303 * makes things faster, and effectively the same result.
1262 */ 1304 */
1263 1305
1264 /* Have object 'fall below' other objects that block view. 1306 /* Have object 'fall below' other objects that block view.
1265 * Unless those objects are exits, type 66 1307 * Unless those objects are exits.
1266 * If INS_ON_TOP is used, don't do this processing 1308 * If INS_ON_TOP is used, don't do this processing
1267 * Need to find the object that in fact blocks view, otherwise 1309 * Need to find the object that in fact blocks view, otherwise
1268 * stacking is a bit odd. 1310 * stacking is a bit odd.
1269 */ 1311 */
1270 if (!(flag & INS_ON_TOP) 1312 if (!(flag & INS_ON_TOP)
1271 && ms.flags () & P_BLOCKSVIEW 1313 && ms.flags () & P_BLOCKSVIEW
1272 && (op->face && !op->face->visibility)) 1314 && (op->face && !faces [op->face].visibility))
1273 { 1315 {
1274 for (last = top; last != floor; last = last->below) 1316 for (last = top; last != floor; last = last->below)
1275 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1317 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1276 break; 1318 break;
1277 1319
1403} 1445}
1404 1446
1405object * 1447object *
1406object::insert_at (object *where, object *originator, int flags) 1448object::insert_at (object *where, object *originator, int flags)
1407{ 1449{
1408 where->map->insert (this, where->x, where->y, originator, flags); 1450 return where->map->insert (this, where->x, where->y, originator, flags);
1409} 1451}
1410 1452
1411/* 1453/*
1412 * 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
1413 * is returned contains nr objects, and the remaining parts contains 1455 * is returned contains nr objects, and the remaining parts contains
1453 * 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
1454 * is subsequently removed and freed. 1496 * is subsequently removed and freed.
1455 * 1497 *
1456 * 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
1457 */ 1499 */
1458
1459object * 1500object *
1460decrease_ob_nr (object *op, uint32 i) 1501decrease_ob_nr (object *op, uint32 i)
1461{ 1502{
1462 object *tmp; 1503 object *tmp;
1463 1504
1538 1579
1539/* 1580/*
1540 * add_weight(object, weight) adds the specified weight to an object, 1581 * add_weight(object, weight) adds the specified weight to an object,
1541 * and also updates how much the environment(s) is/are carrying. 1582 * and also updates how much the environment(s) is/are carrying.
1542 */ 1583 */
1543
1544void 1584void
1545add_weight (object *op, signed long weight) 1585add_weight (object *op, signed long weight)
1546{ 1586{
1547 while (op != NULL) 1587 while (op != NULL)
1548 { 1588 {
1580 * inside the object environment. 1620 * inside the object environment.
1581 * 1621 *
1582 * 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
1583 * be != op, if items are merged. -Tero 1623 * be != op, if items are merged. -Tero
1584 */ 1624 */
1585
1586object * 1625object *
1587object::insert (object *op) 1626object::insert (object *op)
1588{ 1627{
1589 object *tmp, *otmp; 1628 object *tmp, *otmp;
1590 1629
1967 } 2006 }
1968 2007
1969 if (!index) 2008 if (!index)
1970 return -1; 2009 return -1;
1971 2010
1972 return altern[RANDOM () % index]; 2011 return altern [rndm (index)];
1973} 2012}
1974 2013
1975/* 2014/*
1976 * find_first_free_spot(archetype, maptile, x, y) works like 2015 * find_first_free_spot(archetype, maptile, x, y) works like
1977 * find_free_spot(), but it will search max number of squares. 2016 * find_free_spot(), but it will search max number of squares.
1998{ 2037{
1999 arr += begin; 2038 arr += begin;
2000 end -= begin; 2039 end -= begin;
2001 2040
2002 while (--end) 2041 while (--end)
2003 swap (arr [end], arr [RANDOM () % (end + 1)]); 2042 swap (arr [end], arr [rndm (end + 1)]);
2004} 2043}
2005 2044
2006/* new function to make monster searching more efficient, and effective! 2045/* new function to make monster searching more efficient, and effective!
2007 * This basically returns a randomized array (in the passed pointer) of 2046 * This basically returns a randomized array (in the passed pointer) of
2008 * the spaces to find monsters. In this way, it won't always look for 2047 * the spaces to find monsters. In this way, it won't always look for
2320 insert_ob_in_ob (object_create_clone (item), dst); 2359 insert_ob_in_ob (object_create_clone (item), dst);
2321 2360
2322 return dst; 2361 return dst;
2323} 2362}
2324 2363
2325/* GROS - Creates an object using a string representing its content. */
2326/* Basically, we save the content of the string to a temp file, then call */
2327/* load_object on it. I admit it is a highly inefficient way to make things, */
2328/* but it was simple to make and allows reusing the load_object function. */
2329/* Remember not to use load_object_str in a time-critical situation. */
2330/* Also remember that multiparts objects are not supported for now. */
2331object *
2332load_object_str (const char *obstr)
2333{
2334 object *op;
2335 char filename[MAX_BUF];
2336
2337 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2338
2339 FILE *tempfile = fopen (filename, "w");
2340
2341 if (tempfile == NULL)
2342 {
2343 LOG (llevError, "Error - Unable to access load object temp file\n");
2344 return NULL;
2345 }
2346
2347 fprintf (tempfile, obstr);
2348 fclose (tempfile);
2349
2350 op = object::create ();
2351
2352 object_thawer thawer (filename);
2353
2354 if (thawer)
2355 load_object (thawer, op, 0);
2356
2357 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2358 CLEAR_FLAG (op, FLAG_REMOVED);
2359
2360 return op;
2361}
2362
2363/* This returns the first object in who's inventory that 2364/* This returns the first object in who's inventory that
2364 * has the same type and subtype match. 2365 * has the same type and subtype match.
2365 * returns NULL if no match. 2366 * returns NULL if no match.
2366 */ 2367 */
2367object * 2368object *
2420 if (link->key == canonical_key) 2421 if (link->key == canonical_key)
2421 return link->value; 2422 return link->value;
2422 2423
2423 return 0; 2424 return 0;
2424} 2425}
2425
2426 2426
2427/* 2427/*
2428 * Updates the canonical_key in op to value. 2428 * Updates the canonical_key in op to value.
2429 * 2429 *
2430 * 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).
2570{ 2570{
2571 char flagdesc[512]; 2571 char flagdesc[512];
2572 char info2[256 * 4]; 2572 char info2[256 * 4];
2573 char *p = info; 2573 char *p = info;
2574 2574
2575 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", 2575 p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2576 count, uuid.seq, 2576 count, uuid.seq,
2577 &name, 2577 &name,
2578 title ? "\",title:\"" : "", 2578 title ? "\",title:\"" : "",
2579 title ? (const char *)title : "", 2579 title ? (const char *)title : "",
2580 flag_desc (flagdesc, 512), type); 2580 flag_desc (flagdesc, 512), type);
2600{ 2600{
2601 static char info[256 * 4]; 2601 static char info[256 * 4];
2602 return debug_desc (info); 2602 return debug_desc (info);
2603} 2603}
2604 2604
2605struct region *
2606object::region () const
2607{
2608 return map ? map->region (x, y)
2609 : region::default_region ();
2610}
2611
2612const materialtype_t *
2613object::dominant_material () const
2614{
2615 if (materialtype_t *mat = name_to_material (materialname))
2616 return mat;
2617
2618 // omfg this is slow, this has to be temporary :)
2619 shstr unknown ("unknown");
2620
2621 return name_to_material (unknown);
2622}
2623
2624void
2625object::open_container (object *new_container)
2626{
2627 if (container == new_container)
2628 return;
2629
2630 if (object *old_container = container)
2631 {
2632 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2633 return;
2634
2635#if 0
2636 // remove the "Close old_container" object.
2637 if (object *closer = old_container->inv)
2638 if (closer->type == CLOSE_CON)
2639 closer->destroy ();
2640#endif
2641
2642 old_container->flag [FLAG_APPLIED] = 0;
2643 container = 0;
2644
2645 esrv_update_item (UPD_FLAGS, this, old_container);
2646 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2647 }
2648
2649 if (new_container)
2650 {
2651 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2652 return;
2653
2654 // TODO: this does not seem to serve any purpose anymore?
2655#if 0
2656 // insert the "Close Container" object.
2657 if (archetype *closer = new_container->other_arch)
2658 {
2659 object *closer = arch_to_object (new_container->other_arch);
2660 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2661 new_container->insert (closer);
2662 }
2663#endif
2664
2665 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2666
2667 new_container->flag [FLAG_APPLIED] = 1;
2668 container = new_container;
2669
2670 esrv_update_item (UPD_FLAGS, this, new_container);
2671 esrv_send_inventory (this, new_container);
2672 }
2673}
2674
2675

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines