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.124 by root, Sat Jan 27 02:19:36 2007 UTC vs.
Revision 1.140 by root, Tue Apr 24 12:32:14 2007 UTC

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 *
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;
903 * object will have no environment. If the object previously had an 919 * object will have no environment. If the object previously had an
904 * environment, the x and y coordinates will be updated to 920 * environment, the x and y coordinates will be updated to
905 * the previous environment. 921 * the previous environment.
906 */ 922 */
907void 923void
908object::remove_slow () 924object::do_remove ()
909{ 925{
910 object *tmp, *last = 0; 926 object *tmp, *last = 0;
911 object *otmp; 927 object *otmp;
912 928
913 if (QUERY_FLAG (this, FLAG_REMOVED)) 929 if (QUERY_FLAG (this, FLAG_REMOVED))
956 } 972 }
957 else if (map) 973 else if (map)
958 { 974 {
959 if (type == PLAYER) 975 if (type == PLAYER)
960 { 976 {
977 // leaving a spot always closes any open container on the ground
978 if (container && !container->env)
979 // this causes spurious floorbox updates, but it ensures
980 // that the CLOSE event is being sent.
981 close_container ();
982
961 --map->players; 983 --map->players;
962 map->touch (); 984 map->touch ();
963 } 985 }
964 986
965 map->dirty = true; 987 map->dirty = true;
1080 return top; 1102 return top;
1081 } 1103 }
1082 } 1104 }
1083 1105
1084 return 0; 1106 return 0;
1107}
1108
1109void
1110object::expand_tail ()
1111{
1112 if (more)
1113 return;
1114
1115 object *prev = this;
1116
1117 for (archetype *at = arch->more; at; at = at->more)
1118 {
1119 object *op = arch_to_object (at);
1120
1121 op->name = name;
1122 op->name_pl = name_pl;
1123 op->title = title;
1124
1125 op->head = this;
1126 prev->more = op;
1127
1128 prev = op;
1129 }
1085} 1130}
1086 1131
1087/* 1132/*
1088 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1133 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1089 * job preparing multi-part monsters. 1134 * job preparing multi-part monsters.
1121 * just 'op' otherwise 1166 * just 'op' otherwise
1122 */ 1167 */
1123object * 1168object *
1124insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1169insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1125{ 1170{
1171 assert (!op->flag [FLAG_FREED]);
1172
1126 object *tmp, *top, *floor = NULL; 1173 object *tmp, *top, *floor = NULL;
1127 1174
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 (); 1175 op->remove ();
1138 1176
1139 if (!m) 1177#if 0
1140 { 1178 if (!m->active != !op->active)
1141 char *dump = dump_object (op); 1179 if (m->active)
1142 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1180 op->activate_recursive ();
1143 free (dump); 1181 else
1144 return op; 1182 op->deactivate_recursive ();
1145 } 1183#endif
1146 1184
1147 if (out_of_map (m, op->x, op->y)) 1185 if (out_of_map (m, op->x, op->y))
1148 { 1186 {
1149 char *dump = dump_object (op);
1150 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1187 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1151#ifdef MANY_CORES 1188#ifdef MANY_CORES
1152 /* Better to catch this here, as otherwise the next use of this object 1189 /* 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 1190 * is likely to cause a crash. Better to find out where it is getting
1154 * improperly inserted. 1191 * improperly inserted.
1155 */ 1192 */
1156 abort (); 1193 abort ();
1157#endif 1194#endif
1158 free (dump);
1159 return op; 1195 return op;
1160 } 1196 }
1161 1197
1162 if (object *more = op->more) 1198 if (object *more = op->more)
1163 { 1199 {
1260 * looks like instead of lots of conditions here. 1296 * looks like instead of lots of conditions here.
1261 * makes things faster, and effectively the same result. 1297 * makes things faster, and effectively the same result.
1262 */ 1298 */
1263 1299
1264 /* Have object 'fall below' other objects that block view. 1300 /* Have object 'fall below' other objects that block view.
1265 * Unless those objects are exits, type 66 1301 * Unless those objects are exits.
1266 * If INS_ON_TOP is used, don't do this processing 1302 * If INS_ON_TOP is used, don't do this processing
1267 * Need to find the object that in fact blocks view, otherwise 1303 * Need to find the object that in fact blocks view, otherwise
1268 * stacking is a bit odd. 1304 * stacking is a bit odd.
1269 */ 1305 */
1270 if (!(flag & INS_ON_TOP) 1306 if (!(flag & INS_ON_TOP)
1271 && ms.flags () & P_BLOCKSVIEW 1307 && ms.flags () & P_BLOCKSVIEW
1272 && (op->face && !op->face->visibility)) 1308 && (op->face && !faces [op->face].visibility))
1273 { 1309 {
1274 for (last = top; last != floor; last = last->below) 1310 for (last = top; last != floor; last = last->below)
1275 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1311 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1276 break; 1312 break;
1277 1313
1403} 1439}
1404 1440
1405object * 1441object *
1406object::insert_at (object *where, object *originator, int flags) 1442object::insert_at (object *where, object *originator, int flags)
1407{ 1443{
1408 where->map->insert (this, where->x, where->y, originator, flags); 1444 return where->map->insert (this, where->x, where->y, originator, flags);
1409} 1445}
1410 1446
1411/* 1447/*
1412 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1448 * 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 1449 * is returned contains nr objects, and the remaining parts contains
1453 * the amount of an object. If the amount reaches 0, the object 1489 * the amount of an object. If the amount reaches 0, the object
1454 * is subsequently removed and freed. 1490 * is subsequently removed and freed.
1455 * 1491 *
1456 * Return value: 'op' if something is left, NULL if the amount reached 0 1492 * Return value: 'op' if something is left, NULL if the amount reached 0
1457 */ 1493 */
1458
1459object * 1494object *
1460decrease_ob_nr (object *op, uint32 i) 1495decrease_ob_nr (object *op, uint32 i)
1461{ 1496{
1462 object *tmp; 1497 object *tmp;
1463 1498
1538 1573
1539/* 1574/*
1540 * add_weight(object, weight) adds the specified weight to an object, 1575 * add_weight(object, weight) adds the specified weight to an object,
1541 * and also updates how much the environment(s) is/are carrying. 1576 * and also updates how much the environment(s) is/are carrying.
1542 */ 1577 */
1543
1544void 1578void
1545add_weight (object *op, signed long weight) 1579add_weight (object *op, signed long weight)
1546{ 1580{
1547 while (op != NULL) 1581 while (op != NULL)
1548 { 1582 {
1580 * inside the object environment. 1614 * inside the object environment.
1581 * 1615 *
1582 * The function returns now pointer to inserted item, and return value can 1616 * The function returns now pointer to inserted item, and return value can
1583 * be != op, if items are merged. -Tero 1617 * be != op, if items are merged. -Tero
1584 */ 1618 */
1585
1586object * 1619object *
1587object::insert (object *op) 1620object::insert (object *op)
1588{ 1621{
1589 object *tmp, *otmp; 1622 object *tmp, *otmp;
1590 1623
2320 insert_ob_in_ob (object_create_clone (item), dst); 2353 insert_ob_in_ob (object_create_clone (item), dst);
2321 2354
2322 return dst; 2355 return dst;
2323} 2356}
2324 2357
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 2358/* This returns the first object in who's inventory that
2364 * has the same type and subtype match. 2359 * has the same type and subtype match.
2365 * returns NULL if no match. 2360 * returns NULL if no match.
2366 */ 2361 */
2367object * 2362object *
2420 if (link->key == canonical_key) 2415 if (link->key == canonical_key)
2421 return link->value; 2416 return link->value;
2422 2417
2423 return 0; 2418 return 0;
2424} 2419}
2425
2426 2420
2427/* 2421/*
2428 * Updates the canonical_key in op to value. 2422 * Updates the canonical_key in op to value.
2429 * 2423 *
2430 * canonical_key is a shared string (value doesn't have to be). 2424 * canonical_key is a shared string (value doesn't have to be).
2570{ 2564{
2571 char flagdesc[512]; 2565 char flagdesc[512];
2572 char info2[256 * 4]; 2566 char info2[256 * 4];
2573 char *p = info; 2567 char *p = info;
2574 2568
2575 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", 2569 p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2576 count, uuid.seq, 2570 count, uuid.seq,
2577 &name, 2571 &name,
2578 title ? "\",title:\"" : "", 2572 title ? "\",title:\"" : "",
2579 title ? (const char *)title : "", 2573 title ? (const char *)title : "",
2580 flag_desc (flagdesc, 512), type); 2574 flag_desc (flagdesc, 512), type);
2600{ 2594{
2601 static char info[256 * 4]; 2595 static char info[256 * 4];
2602 return debug_desc (info); 2596 return debug_desc (info);
2603} 2597}
2604 2598
2599struct region *
2600object::region () const
2601{
2602 return map ? map->region (x, y)
2603 : region::default_region ();
2604}
2605
2606const materialtype_t *
2607object::dominant_material () const
2608{
2609 if (materialtype_t *mat = name_to_material (materialname))
2610 return mat;
2611
2612 // omfg this is slow, this has to be temporary :)
2613 shstr unknown ("unknown");
2614
2615 return name_to_material (unknown);
2616}
2617
2618void
2619object::open_container (object *new_container)
2620{
2621 if (container == new_container)
2622 return;
2623
2624 if (object *old_container = container)
2625 {
2626 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2627 return;
2628
2629#if 0
2630 // remove the "Close old_container" object.
2631 if (object *closer = old_container->inv)
2632 if (closer->type == CLOSE_CON)
2633 closer->destroy ();
2634#endif
2635
2636 old_container->flag [FLAG_APPLIED] = 0;
2637 container = 0;
2638
2639 esrv_update_item (UPD_FLAGS, this, old_container);
2640 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2641 }
2642
2643 if (new_container)
2644 {
2645 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2646 return;
2647
2648 // TODO: this does not seem to serve any purpose anymore?
2649#if 0
2650 // insert the "Close Container" object.
2651 if (archetype *closer = new_container->other_arch)
2652 {
2653 object *closer = arch_to_object (new_container->other_arch);
2654 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2655 new_container->insert (closer);
2656 }
2657#endif
2658
2659 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2660
2661 new_container->flag [FLAG_APPLIED] = 1;
2662 container = new_container;
2663
2664 esrv_update_item (UPD_FLAGS, this, new_container);
2665 esrv_send_inventory (this, new_container);
2666 }
2667}
2668
2669

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines