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.132 by root, Sat Feb 10 21:01:09 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;
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])
824 {
825 remove_friendly_object (this); 840 remove_friendly_object (this);
826
827 if (type == GOLEM
828 && owner
829 && owner->type == PLAYER
830 && owner->contr->ranges[range_golem] == this)
831 owner->contr->ranges[range_golem] = 0;
832 }
833 841
834 if (!flag [FLAG_REMOVED]) 842 if (!flag [FLAG_REMOVED])
835 remove (); 843 remove ();
836 844
837 destroy_inv (true); 845 destroy_inv (true);
1094 return top; 1102 return top;
1095 } 1103 }
1096 } 1104 }
1097 1105
1098 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 }
1099} 1130}
1100 1131
1101/* 1132/*
1102 * 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
1103 * job preparing multi-part monsters. 1134 * job preparing multi-part monsters.
1135 * just 'op' otherwise 1166 * just 'op' otherwise
1136 */ 1167 */
1137object * 1168object *
1138insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1169insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1139{ 1170{
1171 assert (!op->flag [FLAG_FREED]);
1172
1140 object *tmp, *top, *floor = NULL; 1173 object *tmp, *top, *floor = NULL;
1141 1174
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 (); 1175 op->remove ();
1152 1176
1153 if (!m) 1177#if 0
1154 { 1178 if (!m->active != !op->active)
1155 char *dump = dump_object (op); 1179 if (m->active)
1156 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1180 op->activate_recursive ();
1157 free (dump); 1181 else
1158 return op; 1182 op->deactivate_recursive ();
1159 } 1183#endif
1160 1184
1161 if (out_of_map (m, op->x, op->y)) 1185 if (out_of_map (m, op->x, op->y))
1162 { 1186 {
1163 char *dump = dump_object (op);
1164 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 ());
1165#ifdef MANY_CORES 1188#ifdef MANY_CORES
1166 /* 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
1167 * 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
1168 * improperly inserted. 1191 * improperly inserted.
1169 */ 1192 */
1170 abort (); 1193 abort ();
1171#endif 1194#endif
1172 free (dump);
1173 return op; 1195 return op;
1174 } 1196 }
1175 1197
1176 if (object *more = op->more) 1198 if (object *more = op->more)
1177 { 1199 {
1274 * looks like instead of lots of conditions here. 1296 * looks like instead of lots of conditions here.
1275 * makes things faster, and effectively the same result. 1297 * makes things faster, and effectively the same result.
1276 */ 1298 */
1277 1299
1278 /* Have object 'fall below' other objects that block view. 1300 /* Have object 'fall below' other objects that block view.
1279 * Unless those objects are exits, type 66 1301 * Unless those objects are exits.
1280 * If INS_ON_TOP is used, don't do this processing 1302 * If INS_ON_TOP is used, don't do this processing
1281 * Need to find the object that in fact blocks view, otherwise 1303 * Need to find the object that in fact blocks view, otherwise
1282 * stacking is a bit odd. 1304 * stacking is a bit odd.
1283 */ 1305 */
1284 if (!(flag & INS_ON_TOP) 1306 if (!(flag & INS_ON_TOP)
1285 && ms.flags () & P_BLOCKSVIEW 1307 && ms.flags () & P_BLOCKSVIEW
1286 && (op->face && !op->face->visibility)) 1308 && (op->face && !faces [op->face].visibility))
1287 { 1309 {
1288 for (last = top; last != floor; last = last->below) 1310 for (last = top; last != floor; last = last->below)
1289 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1311 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1290 break; 1312 break;
1291 1313
1417} 1439}
1418 1440
1419object * 1441object *
1420object::insert_at (object *where, object *originator, int flags) 1442object::insert_at (object *where, object *originator, int flags)
1421{ 1443{
1422 where->map->insert (this, where->x, where->y, originator, flags); 1444 return where->map->insert (this, where->x, where->y, originator, flags);
1423} 1445}
1424 1446
1425/* 1447/*
1426 * 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
1427 * is returned contains nr objects, and the remaining parts contains 1449 * is returned contains nr objects, and the remaining parts contains
1467 * 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
1468 * is subsequently removed and freed. 1490 * is subsequently removed and freed.
1469 * 1491 *
1470 * 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
1471 */ 1493 */
1472
1473object * 1494object *
1474decrease_ob_nr (object *op, uint32 i) 1495decrease_ob_nr (object *op, uint32 i)
1475{ 1496{
1476 object *tmp; 1497 object *tmp;
1477 1498
1552 1573
1553/* 1574/*
1554 * add_weight(object, weight) adds the specified weight to an object, 1575 * add_weight(object, weight) adds the specified weight to an object,
1555 * and also updates how much the environment(s) is/are carrying. 1576 * and also updates how much the environment(s) is/are carrying.
1556 */ 1577 */
1557
1558void 1578void
1559add_weight (object *op, signed long weight) 1579add_weight (object *op, signed long weight)
1560{ 1580{
1561 while (op != NULL) 1581 while (op != NULL)
1562 { 1582 {
1594 * inside the object environment. 1614 * inside the object environment.
1595 * 1615 *
1596 * 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
1597 * be != op, if items are merged. -Tero 1617 * be != op, if items are merged. -Tero
1598 */ 1618 */
1599
1600object * 1619object *
1601object::insert (object *op) 1620object::insert (object *op)
1602{ 1621{
1603 object *tmp, *otmp; 1622 object *tmp, *otmp;
1604 1623
2334 insert_ob_in_ob (object_create_clone (item), dst); 2353 insert_ob_in_ob (object_create_clone (item), dst);
2335 2354
2336 return dst; 2355 return dst;
2337} 2356}
2338 2357
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. */
2345object *
2346load_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 2358/* This returns the first object in who's inventory that
2378 * has the same type and subtype match. 2359 * has the same type and subtype match.
2379 * returns NULL if no match. 2360 * returns NULL if no match.
2380 */ 2361 */
2381object * 2362object *
2434 if (link->key == canonical_key) 2415 if (link->key == canonical_key)
2435 return link->value; 2416 return link->value;
2436 2417
2437 return 0; 2418 return 0;
2438} 2419}
2439
2440 2420
2441/* 2421/*
2442 * Updates the canonical_key in op to value. 2422 * Updates the canonical_key in op to value.
2443 * 2423 *
2444 * 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).

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines